/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:24:35,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:24:35,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:24:35,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:24:35,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:24:35,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:24:35,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:24:35,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:24:35,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:24:35,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:24:35,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:24:35,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:24:35,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:24:35,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:24:35,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:24:35,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:24:35,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:24:35,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:24:35,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:24:35,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:24:35,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:24:35,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:24:35,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:24:35,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:24:35,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:24:35,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:24:35,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:24:35,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:24:35,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:24:35,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:24:35,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:24:35,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:24:35,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:24:35,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:24:35,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:24:35,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:24:35,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:24:35,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:24:35,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:24:35,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:24:35,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:24:35,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:24:35,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:24:35,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:24:35,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:24:35,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:24:35,510 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:24:35,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:24:35,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:24:35,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:24:35,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:24:35,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:24:35,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:24:35,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:24:35,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:24:35,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:24:35,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:24:35,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:24:35,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:24:35,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:24:35,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:24:35,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:24:35,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:24:35,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:24:35,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:24:35,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-06 05:24:35,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:24:35,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:24:35,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:24:35,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:24:35,852 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:24:35,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-06 05:24:36,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:24:37,170 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:24:37,170 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-06 05:24:37,177 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4568f70/ce07b3d2594c478fbb3c532836d2542e/FLAG589aff2a0 [2022-12-06 05:24:37,192 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4568f70/ce07b3d2594c478fbb3c532836d2542e [2022-12-06 05:24:37,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:24:37,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:24:37,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:24:37,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:24:37,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:24:37,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9217ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37, skipping insertion in model container [2022-12-06 05:24:37,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:24:37,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:24:37,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3947,3960] [2022-12-06 05:24:37,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:24:37,394 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:24:37,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:24:37,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:24:37,434 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3947,3960] [2022-12-06 05:24:37,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:24:37,452 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:24:37,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37 WrapperNode [2022-12-06 05:24:37,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:24:37,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:24:37,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:24:37,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:24:37,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,518 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-06 05:24:37,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:24:37,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:24:37,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:24:37,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:24:37,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:24:37,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:24:37,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:24:37,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:24:37,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (1/1) ... [2022-12-06 05:24:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:24:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:37,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:24:37,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:24:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:24:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:24:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:24:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:24:37,651 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:24:37,812 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:24:37,813 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:24:38,154 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:24:38,264 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:24:38,264 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:24:38,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:24:38 BoogieIcfgContainer [2022-12-06 05:24:38,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:24:38,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:24:38,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:24:38,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:24:38,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:24:37" (1/3) ... [2022-12-06 05:24:38,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e09d9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:24:38, skipping insertion in model container [2022-12-06 05:24:38,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:24:37" (2/3) ... [2022-12-06 05:24:38,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e09d9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:24:38, skipping insertion in model container [2022-12-06 05:24:38,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:24:38" (3/3) ... [2022-12-06 05:24:38,271 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-06 05:24:38,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:24:38,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:24:38,316 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:24:38,407 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:24:38,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 05:24:38,536 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-06 05:24:38,536 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:38,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 242 events. 22/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-06 05:24:38,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 05:24:38,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-06 05:24:38,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:38,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 05:24:38,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-06 05:24:38,622 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-06 05:24:38,622 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:38,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 22/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2022-12-06 05:24:38,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 05:24:38,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-06 05:24:47,827 INFO L203 LiptonReduction]: Total number of compositions: 200 [2022-12-06 05:24:47,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:24:47,843 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6707f329, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:24:47,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:24:47,848 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-06 05:24:47,848 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:24:47,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:47,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:47,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-06 05:24:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:47,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021486692] [2022-12-06 05:24:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:48,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021486692] [2022-12-06 05:24:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021486692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:48,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:24:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338743904] [2022-12-06 05:24:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:48,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:24:48,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:24:48,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:48,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:48,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:24:48,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:48,362 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-06 05:24:48,363 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 05:24:48,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 690 events. 472/690 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2132 event pairs, 135 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1216. Up to 449 conditions per place. [2022-12-06 05:24:48,369 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 05:24:48,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-06 05:24:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:24:48,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-06 05:24:48,380 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:24:48,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 196 flow [2022-12-06 05:24:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:24:48,386 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2022-12-06 05:24:48,390 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 05:24:48,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:48,394 INFO L89 Accepts]: Start accepts. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:48,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:48,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,413 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-06 05:24:48,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:24:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 43 events. 14/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 17 conditions per place. [2022-12-06 05:24:48,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:24:48,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:48,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 05:24:48,433 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 87 flow [2022-12-06 05:24:48,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:48,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:48,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:48,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:24:48,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-06 05:24:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759969608] [2022-12-06 05:24:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759969608] [2022-12-06 05:24:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759969608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:24:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934937858] [2022-12-06 05:24:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:48,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:48,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:48,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:48,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:48,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:48,760 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-06 05:24:48,760 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 05:24:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 810 events. 529/810 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2610 event pairs, 371 based on Foata normal form. 52/712 useless extension candidates. Maximal degree in co-relation 753. Up to 691 conditions per place. [2022-12-06 05:24:48,763 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 31 selfloop transitions, 2 changer transitions 27/60 dead transitions. [2022-12-06 05:24:48,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 269 flow [2022-12-06 05:24:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:24:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:24:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 05:24:48,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-06 05:24:48,765 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 87 flow. Second operand 5 states and 64 transitions. [2022-12-06 05:24:48,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 269 flow [2022-12-06 05:24:48,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:48,766 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 114 flow [2022-12-06 05:24:48,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-06 05:24:48,767 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 05:24:48,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:48,767 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 114 flow [2022-12-06 05:24:48,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:48,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:48,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 114 flow [2022-12-06 05:24:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 114 flow [2022-12-06 05:24:48,774 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 05:24:48,774 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-06 05:24:48,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 62 events. 22/62 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 146 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 19 conditions per place. [2022-12-06 05:24:48,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 114 flow [2022-12-06 05:24:48,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 05:24:50,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:50,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1564 [2022-12-06 05:24:50,331 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 110 flow [2022-12-06 05:24:50,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:50,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:50,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:24:50,347 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 602269161, now seen corresponding path program 1 times [2022-12-06 05:24:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:50,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130633237] [2022-12-06 05:24:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130633237] [2022-12-06 05:24:50,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130633237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:50,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:50,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642330482] [2022-12-06 05:24:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:50,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:50,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:50,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:50,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:50,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:50,726 INFO L130 PetriNetUnfolder]: 759/1166 cut-off events. [2022-12-06 05:24:50,727 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-06 05:24:50,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1166 events. 759/1166 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4329 event pairs, 563 based on Foata normal form. 56/1039 useless extension candidates. Maximal degree in co-relation 3178. Up to 691 conditions per place. [2022-12-06 05:24:50,733 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2022-12-06 05:24:50,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 358 flow [2022-12-06 05:24:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:24:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:24:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 05:24:50,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 05:24:50,737 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 110 flow. Second operand 5 states and 70 transitions. [2022-12-06 05:24:50,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 358 flow [2022-12-06 05:24:50,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:50,741 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2022-12-06 05:24:50,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 05:24:50,742 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 05:24:50,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:50,743 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 118 flow [2022-12-06 05:24:50,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:50,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:50,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 118 flow [2022-12-06 05:24:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 118 flow [2022-12-06 05:24:50,754 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 05:24:50,754 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 05:24:50,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 62 events. 22/62 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 4 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 116. Up to 17 conditions per place. [2022-12-06 05:24:50,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 118 flow [2022-12-06 05:24:50,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 05:24:51,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:51,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 05:24:51,083 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 114 flow [2022-12-06 05:24:51,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:51,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:51,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:51,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:24:51,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1216932410, now seen corresponding path program 1 times [2022-12-06 05:24:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:51,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598219689] [2022-12-06 05:24:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:51,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598219689] [2022-12-06 05:24:51,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598219689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:51,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:51,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311903352] [2022-12-06 05:24:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:51,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:51,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:51,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:51,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:51,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:51,480 INFO L130 PetriNetUnfolder]: 797/1197 cut-off events. [2022-12-06 05:24:51,480 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 05:24:51,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3572 conditions, 1197 events. 797/1197 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4404 event pairs, 586 based on Foata normal form. 70/1030 useless extension candidates. Maximal degree in co-relation 3554. Up to 691 conditions per place. [2022-12-06 05:24:51,487 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 21/54 dead transitions. [2022-12-06 05:24:51,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 301 flow [2022-12-06 05:24:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 05:24:51,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 05:24:51,489 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 114 flow. Second operand 4 states and 53 transitions. [2022-12-06 05:24:51,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 301 flow [2022-12-06 05:24:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 261 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 05:24:51,495 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 108 flow [2022-12-06 05:24:51,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 05:24:51,496 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 05:24:51,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:51,497 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 108 flow [2022-12-06 05:24:51,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:51,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:51,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 108 flow [2022-12-06 05:24:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 108 flow [2022-12-06 05:24:51,509 INFO L130 PetriNetUnfolder]: 38/84 cut-off events. [2022-12-06 05:24:51,510 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:24:51,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 84 events. 38/84 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 10 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 160. Up to 33 conditions per place. [2022-12-06 05:24:51,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 108 flow [2022-12-06 05:24:51,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:24:51,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:51,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-06 05:24:51,795 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 104 flow [2022-12-06 05:24:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:51,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:51,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:51,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:24:51,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -582879671, now seen corresponding path program 1 times [2022-12-06 05:24:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349474144] [2022-12-06 05:24:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:51,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349474144] [2022-12-06 05:24:51,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349474144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:51,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:51,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:24:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531081894] [2022-12-06 05:24:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:51,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:24:51,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:51,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 104 flow. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:51,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:51,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:51,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:52,182 INFO L130 PetriNetUnfolder]: 839/1226 cut-off events. [2022-12-06 05:24:52,182 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-06 05:24:52,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1226 events. 839/1226 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4517 event pairs, 317 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 3344. Up to 645 conditions per place. [2022-12-06 05:24:52,189 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 46 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2022-12-06 05:24:52,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 285 flow [2022-12-06 05:24:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 05:24:52,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 05:24:52,194 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-06 05:24:52,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 285 flow [2022-12-06 05:24:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 277 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:52,197 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2022-12-06 05:24:52,200 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 05:24:52,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:52,201 INFO L89 Accepts]: Start accepts. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:52,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:52,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,215 INFO L130 PetriNetUnfolder]: 46/107 cut-off events. [2022-12-06 05:24:52,215 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-06 05:24:52,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 107 events. 46/107 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 337 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 194. Up to 39 conditions per place. [2022-12-06 05:24:52,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 05:24:52,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:52,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:24:52,221 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 110 flow [2022-12-06 05:24:52,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:52,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:52,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:52,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:24:52,221 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 971652712, now seen corresponding path program 1 times [2022-12-06 05:24:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:52,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635112279] [2022-12-06 05:24:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:52,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635112279] [2022-12-06 05:24:52,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635112279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:52,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491813160] [2022-12-06 05:24:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:52,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:52,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:52,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:52,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:24:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:52,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:24:52,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:52,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:24:52,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491813160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:52,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:24:52,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 05:24:52,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439400008] [2022-12-06 05:24:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:52,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:24:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:24:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:24:52,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:52,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-12-06 05:24:52,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:52,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:52,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:52,935 INFO L130 PetriNetUnfolder]: 1774/2682 cut-off events. [2022-12-06 05:24:52,936 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-12-06 05:24:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 2682 events. 1774/2682 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12250 event pairs, 784 based on Foata normal form. 148/2294 useless extension candidates. Maximal degree in co-relation 4829. Up to 1227 conditions per place. [2022-12-06 05:24:52,943 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 32 selfloop transitions, 2 changer transitions 75/109 dead transitions. [2022-12-06 05:24:52,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 109 transitions, 554 flow [2022-12-06 05:24:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:24:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:24:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 05:24:52,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 05:24:52,944 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 110 flow. Second operand 7 states and 106 transitions. [2022-12-06 05:24:52,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 109 transitions, 554 flow [2022-12-06 05:24:52,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 109 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:52,946 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 146 flow [2022-12-06 05:24:52,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-06 05:24:52,947 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 05:24:52,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:52,947 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 146 flow [2022-12-06 05:24:52,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:52,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:52,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 146 flow [2022-12-06 05:24:52,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 146 flow [2022-12-06 05:24:52,957 INFO L130 PetriNetUnfolder]: 46/108 cut-off events. [2022-12-06 05:24:52,957 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-06 05:24:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 108 events. 46/108 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 event pairs, 14 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 293. Up to 39 conditions per place. [2022-12-06 05:24:52,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 146 flow [2022-12-06 05:24:52,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 05:24:55,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:55,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2192 [2022-12-06 05:24:55,139 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 142 flow [2022-12-06 05:24:55,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-12-06 05:24:55,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:55,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:55,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:55,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 05:24:55,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -651039405, now seen corresponding path program 1 times [2022-12-06 05:24:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498354620] [2022-12-06 05:24:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498354620] [2022-12-06 05:24:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498354620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:24:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024345132] [2022-12-06 05:24:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:55,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:24:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:55,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:24:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:24:55,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:55,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-06 05:24:55,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:55,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:55,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:55,688 INFO L130 PetriNetUnfolder]: 658/961 cut-off events. [2022-12-06 05:24:55,688 INFO L131 PetriNetUnfolder]: For 1575/1575 co-relation queries the response was YES. [2022-12-06 05:24:55,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 961 events. 658/961 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3026 event pairs, 269 based on Foata normal form. 38/754 useless extension candidates. Maximal degree in co-relation 3443. Up to 512 conditions per place. [2022-12-06 05:24:55,692 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-06 05:24:55,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 300 flow [2022-12-06 05:24:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:24:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:24:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 05:24:55,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 05:24:55,693 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 142 flow. Second operand 3 states and 44 transitions. [2022-12-06 05:24:55,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 300 flow [2022-12-06 05:24:55,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 258 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 05:24:55,695 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2022-12-06 05:24:55,696 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 05:24:55,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:55,696 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:55,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:55,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,705 INFO L130 PetriNetUnfolder]: 33/105 cut-off events. [2022-12-06 05:24:55,705 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-06 05:24:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 105 events. 33/105 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 8 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2022-12-06 05:24:55,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 05:24:55,707 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:55,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:24:55,707 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 141 flow [2022-12-06 05:24:55,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-06 05:24:55,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:55,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:24:55,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -965008021, now seen corresponding path program 2 times [2022-12-06 05:24:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:55,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035572640] [2022-12-06 05:24:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:56,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035572640] [2022-12-06 05:24:56,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035572640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:56,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336045160] [2022-12-06 05:24:56,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:24:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:56,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:24:56,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:24:56,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:24:56,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:24:56,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:24:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:24:56,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:24:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:56,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:24:56,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336045160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:56,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:24:56,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-12-06 05:24:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614211923] [2022-12-06 05:24:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:56,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:24:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:24:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:24:56,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:24:56,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12-06 05:24:56,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:56,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:24:56,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:57,107 INFO L130 PetriNetUnfolder]: 494/770 cut-off events. [2022-12-06 05:24:57,107 INFO L131 PetriNetUnfolder]: For 638/638 co-relation queries the response was YES. [2022-12-06 05:24:57,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 770 events. 494/770 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2614 event pairs, 108 based on Foata normal form. 12/611 useless extension candidates. Maximal degree in co-relation 1658. Up to 599 conditions per place. [2022-12-06 05:24:57,112 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 60 selfloop transitions, 6 changer transitions 2/68 dead transitions. [2022-12-06 05:24:57,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 411 flow [2022-12-06 05:24:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:24:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:24:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 05:24:57,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 05:24:57,114 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 141 flow. Second operand 7 states and 62 transitions. [2022-12-06 05:24:57,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 411 flow [2022-12-06 05:24:57,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 380 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:57,118 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 171 flow [2022-12-06 05:24:57,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 05:24:57,147 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 05:24:57,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:57,147 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 05:24:57,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:57,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:57,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 05:24:57,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 05:24:57,163 INFO L130 PetriNetUnfolder]: 44/118 cut-off events. [2022-12-06 05:24:57,163 INFO L131 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2022-12-06 05:24:57,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 118 events. 44/118 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 338 event pairs, 4 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 182. Up to 36 conditions per place. [2022-12-06 05:24:57,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 05:24:57,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:24:57,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:24:57,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1061] L142-3-->L143-3: Formula: (and (= |v_#pthreadsForks_66| (+ |v_#pthreadsForks_67| 1)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_228| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre32#1_25|)) |v_#memory_int_227|) (= |v_#pthreadsForks_67| |v_ULTIMATE.start_main_#t~pre32#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_228|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_66|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_227|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_11|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-06 05:24:57,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:57,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 05:24:57,406 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 173 flow [2022-12-06 05:24:57,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-12-06 05:24:57,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:57,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:57,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 05:24:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 05:24:57,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1991254802, now seen corresponding path program 1 times [2022-12-06 05:24:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081055766] [2022-12-06 05:24:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:58,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:58,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081055766] [2022-12-06 05:24:58,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081055766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:58,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138872689] [2022-12-06 05:24:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:58,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:58,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:58,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:24:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:58,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:24:58,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:58,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:24:58,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:24:58,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:24:58,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:24:58,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:24:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:58,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:24:58,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138872689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:58,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:24:58,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-06 05:24:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391777545] [2022-12-06 05:24:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:58,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:24:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:24:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:24:58,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:24:58,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-12-06 05:24:58,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:58,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:24:58,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:58,860 INFO L130 PetriNetUnfolder]: 407/628 cut-off events. [2022-12-06 05:24:58,860 INFO L131 PetriNetUnfolder]: For 778/778 co-relation queries the response was YES. [2022-12-06 05:24:58,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 628 events. 407/628 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2026 event pairs, 34 based on Foata normal form. 20/516 useless extension candidates. Maximal degree in co-relation 1253. Up to 296 conditions per place. [2022-12-06 05:24:58,865 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 75 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2022-12-06 05:24:58,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 553 flow [2022-12-06 05:24:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:24:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:24:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-12-06 05:24:58,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2673611111111111 [2022-12-06 05:24:58,866 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 173 flow. Second operand 9 states and 77 transitions. [2022-12-06 05:24:58,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 553 flow [2022-12-06 05:24:58,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 535 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:24:58,870 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-06 05:24:58,871 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 05:24:58,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:58,871 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:58,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:58,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,890 INFO L130 PetriNetUnfolder]: 64/153 cut-off events. [2022-12-06 05:24:58,890 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-06 05:24:58,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 153 events. 64/153 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 12 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 242. Up to 51 conditions per place. [2022-12-06 05:24:58,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:24:58,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:58,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:24:58,894 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 216 flow [2022-12-06 05:24:58,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-12-06 05:24:58,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:58,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:58,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:59,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:59,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:24:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash -927655443, now seen corresponding path program 1 times [2022-12-06 05:24:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:59,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105525749] [2022-12-06 05:24:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:59,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105525749] [2022-12-06 05:24:59,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105525749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:59,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23719179] [2022-12-06 05:24:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:59,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:59,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:59,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:24:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:59,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:24:59,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:59,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:24:59,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23719179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:59,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:24:59,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 05:24:59,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514660343] [2022-12-06 05:24:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:59,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:24:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:24:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:24:59,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:24:59,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-12-06 05:24:59,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:59,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:24:59,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:59,765 INFO L130 PetriNetUnfolder]: 892/1436 cut-off events. [2022-12-06 05:24:59,765 INFO L131 PetriNetUnfolder]: For 2609/2609 co-relation queries the response was YES. [2022-12-06 05:24:59,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1436 events. 892/1436 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5841 event pairs, 334 based on Foata normal form. 136/1335 useless extension candidates. Maximal degree in co-relation 1903. Up to 629 conditions per place. [2022-12-06 05:24:59,771 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 41 selfloop transitions, 2 changer transitions 69/112 dead transitions. [2022-12-06 05:24:59,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 794 flow [2022-12-06 05:24:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:24:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:24:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-06 05:24:59,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 05:24:59,772 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 216 flow. Second operand 7 states and 92 transitions. [2022-12-06 05:24:59,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 794 flow [2022-12-06 05:24:59,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 746 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:59,776 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 222 flow [2022-12-06 05:24:59,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-12-06 05:24:59,777 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-06 05:24:59,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:59,777 INFO L89 Accepts]: Start accepts. Operand has 58 places, 43 transitions, 222 flow [2022-12-06 05:24:59,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:59,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:59,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 43 transitions, 222 flow [2022-12-06 05:24:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 222 flow [2022-12-06 05:24:59,793 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-06 05:24:59,793 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 05:24:59,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 154 events. 64/154 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 12 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 486. Up to 51 conditions per place. [2022-12-06 05:24:59,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 222 flow [2022-12-06 05:24:59,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:25:00,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:00,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 05:25:00,115 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 218 flow [2022-12-06 05:25:00,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-12-06 05:25:00,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:00,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:00,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:25:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:00,316 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 990816050, now seen corresponding path program 1 times [2022-12-06 05:25:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:00,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717641160] [2022-12-06 05:25:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:00,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717641160] [2022-12-06 05:25:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717641160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787755105] [2022-12-06 05:25:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:00,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:25:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:00,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:25:00,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:01,122 INFO L321 Elim1Store]: treesize reduction 7, result has 86.8 percent of original size [2022-12-06 05:25:01,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 57 [2022-12-06 05:25:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:01,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:25:01,359 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 05:25:01,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 109 [2022-12-06 05:25:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:01,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787755105] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:01,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:25:01,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 19 [2022-12-06 05:25:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892691194] [2022-12-06 05:25:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:01,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:25:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:25:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:25:01,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:25:01,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-12-06 05:25:01,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:01,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:25:01,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:02,264 INFO L130 PetriNetUnfolder]: 933/1457 cut-off events. [2022-12-06 05:25:02,264 INFO L131 PetriNetUnfolder]: For 2824/2824 co-relation queries the response was YES. [2022-12-06 05:25:02,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 1457 events. 933/1457 cut-off events. For 2824/2824 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5676 event pairs, 270 based on Foata normal form. 8/1221 useless extension candidates. Maximal degree in co-relation 3361. Up to 556 conditions per place. [2022-12-06 05:25:02,277 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 106 selfloop transitions, 24 changer transitions 6/136 dead transitions. [2022-12-06 05:25:02,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 915 flow [2022-12-06 05:25:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:25:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:25:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-12-06 05:25:02,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2022-12-06 05:25:02,279 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 218 flow. Second operand 12 states and 116 transitions. [2022-12-06 05:25:02,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 915 flow [2022-12-06 05:25:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 136 transitions, 859 flow, removed 28 selfloop flow, removed 6 redundant places. [2022-12-06 05:25:02,289 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 446 flow [2022-12-06 05:25:02,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=446, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-06 05:25:02,292 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-06 05:25:02,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:02,293 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 446 flow [2022-12-06 05:25:02,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:02,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:02,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 446 flow [2022-12-06 05:25:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 446 flow [2022-12-06 05:25:02,351 INFO L130 PetriNetUnfolder]: 171/400 cut-off events. [2022-12-06 05:25:02,351 INFO L131 PetriNetUnfolder]: For 779/807 co-relation queries the response was YES. [2022-12-06 05:25:02,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 400 events. 171/400 cut-off events. For 779/807 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1849 event pairs, 18 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 1325. Up to 129 conditions per place. [2022-12-06 05:25:02,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 446 flow [2022-12-06 05:25:02,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 05:25:02,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:25:02,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:25:02,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:25:02,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:25:03,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1115] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~q1~0.base_112))) (and (< v_~q1_back~0_186 v_~n1~0_100) (= (+ v_~q1_front~0_130 1) v_~q1_front~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_back~0_186 4))) 2) (= (ite |v_thread1_#t~short2#1_86| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= (+ v_~q1_back~0_186 1) v_~q1_back~0_185) (= (ite (and (<= 0 v_~q1_front~0_130) (< v_~q1_front~0_130 v_~n1~0_100) (< v_~q1_front~0_130 v_~q1_back~0_185)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_67| (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_front~0_130 4)))) |v_thread1_#t~short2#1_85| (< |v_thread1Thread1of1ForFork0_~i~0#1_66| v_~N~0_73))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_130, ~q1_back~0=v_~q1_back~0_186, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_330|, ~N~0=v_~N~0_73} OutVars{~q1~0.offset=v_~q1~0.offset_111, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_67|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_18|, ~q1_front~0=v_~q1_front~0_129, ~n1~0=v_~n1~0_100, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_27|, ~q1_back~0=v_~q1_back~0_185, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_18|, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_27|, #memory_int=|v_#memory_int_330|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_20|} AuxVars[|v_thread1_#t~short2#1_86|, |v_thread1_#t~short2#1_85|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:25:08,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1115] L52-2-->L81: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~q1~0.base_112))) (and (< v_~q1_back~0_186 v_~n1~0_100) (= (+ v_~q1_front~0_130 1) v_~q1_front~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_back~0_186 4))) 2) (= (ite |v_thread1_#t~short2#1_86| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= (+ v_~q1_back~0_186 1) v_~q1_back~0_185) (= (ite (and (<= 0 v_~q1_front~0_130) (< v_~q1_front~0_130 v_~n1~0_100) (< v_~q1_front~0_130 v_~q1_back~0_185)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_67| (select .cse0 (+ v_~q1~0.offset_111 (* v_~q1_front~0_130 4)))) |v_thread1_#t~short2#1_85| (< |v_thread1Thread1of1ForFork0_~i~0#1_66| v_~N~0_73))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_130, ~q1_back~0=v_~q1_back~0_186, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_330|, ~N~0=v_~N~0_73} OutVars{~q1~0.offset=v_~q1~0.offset_111, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_67|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_18|, ~q1_front~0=v_~q1_front~0_129, ~n1~0=v_~n1~0_100, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~N~0=v_~N~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_27|, ~q1_back~0=v_~q1_back~0_185, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_18|, ~q1~0.base=v_~q1~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_27|, #memory_int=|v_#memory_int_330|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_58|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_20|} AuxVars[|v_thread1_#t~short2#1_86|, |v_thread1_#t~short2#1_85|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:25:08,887 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:25:08,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6595 [2022-12-06 05:25:08,888 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 492 flow [2022-12-06 05:25:08,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-12-06 05:25:08,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:08,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:08,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:09,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 05:25:09,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1776517051, now seen corresponding path program 1 times [2022-12-06 05:25:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:09,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318853649] [2022-12-06 05:25:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:09,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318853649] [2022-12-06 05:25:09,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318853649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:09,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194063447] [2022-12-06 05:25:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:09,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:09,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:25:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:09,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:25:09,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:09,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:25:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:09,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:09,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194063447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:09,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:09,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 05:25:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208801800] [2022-12-06 05:25:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:09,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:25:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:25:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:25:09,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:25:09,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12-06 05:25:09,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:09,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:25:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:10,131 INFO L130 PetriNetUnfolder]: 929/1442 cut-off events. [2022-12-06 05:25:10,132 INFO L131 PetriNetUnfolder]: For 3840/3840 co-relation queries the response was YES. [2022-12-06 05:25:10,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6369 conditions, 1442 events. 929/1442 cut-off events. For 3840/3840 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5662 event pairs, 325 based on Foata normal form. 16/1214 useless extension candidates. Maximal degree in co-relation 5176. Up to 718 conditions per place. [2022-12-06 05:25:10,148 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 103 selfloop transitions, 13 changer transitions 1/117 dead transitions. [2022-12-06 05:25:10,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 117 transitions, 1022 flow [2022-12-06 05:25:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:25:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:25:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-06 05:25:10,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2022-12-06 05:25:10,150 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 492 flow. Second operand 7 states and 96 transitions. [2022-12-06 05:25:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 117 transitions, 1022 flow [2022-12-06 05:25:10,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 117 transitions, 934 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-06 05:25:10,161 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 531 flow [2022-12-06 05:25:10,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2022-12-06 05:25:10,162 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 05:25:10,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:10,163 INFO L89 Accepts]: Start accepts. Operand has 65 places, 65 transitions, 531 flow [2022-12-06 05:25:10,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:10,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:10,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 65 transitions, 531 flow [2022-12-06 05:25:10,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 531 flow [2022-12-06 05:25:10,200 INFO L130 PetriNetUnfolder]: 206/442 cut-off events. [2022-12-06 05:25:10,200 INFO L131 PetriNetUnfolder]: For 1124/1133 co-relation queries the response was YES. [2022-12-06 05:25:10,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 442 events. 206/442 cut-off events. For 1124/1133 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1971 event pairs, 12 based on Foata normal form. 5/331 useless extension candidates. Maximal degree in co-relation 1078. Up to 166 conditions per place. [2022-12-06 05:25:10,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 531 flow [2022-12-06 05:25:10,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 05:25:10,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:25:10,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:10,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 05:25:10,524 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 527 flow [2022-12-06 05:25:10,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12-06 05:25:10,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:10,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:10,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:10,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:10,725 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -208767707, now seen corresponding path program 1 times [2022-12-06 05:25:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57343969] [2022-12-06 05:25:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57343969] [2022-12-06 05:25:11,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57343969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694843817] [2022-12-06 05:25:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:11,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:11,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:25:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:11,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:25:11,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:12,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:12,056 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:25:12,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2022-12-06 05:25:12,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-12-06 05:25:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:12,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:12,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694843817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:12,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:12,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 05:25:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59411037] [2022-12-06 05:25:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:12,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:25:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:25:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:25:12,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:25:12,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:12,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:12,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:25:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:12,498 INFO L130 PetriNetUnfolder]: 1445/2244 cut-off events. [2022-12-06 05:25:12,498 INFO L131 PetriNetUnfolder]: For 7644/7644 co-relation queries the response was YES. [2022-12-06 05:25:12,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 2244 events. 1445/2244 cut-off events. For 7644/7644 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9764 event pairs, 544 based on Foata normal form. 4/1864 useless extension candidates. Maximal degree in co-relation 7885. Up to 1432 conditions per place. [2022-12-06 05:25:12,510 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 116 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2022-12-06 05:25:12,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 1228 flow [2022-12-06 05:25:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:25:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:25:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 05:25:12,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-06 05:25:12,512 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 527 flow. Second operand 6 states and 87 transitions. [2022-12-06 05:25:12,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 1228 flow [2022-12-06 05:25:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 1207 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:12,520 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 675 flow [2022-12-06 05:25:12,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2022-12-06 05:25:12,521 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-06 05:25:12,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:12,521 INFO L89 Accepts]: Start accepts. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 05:25:12,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:12,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:12,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 05:25:12,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 05:25:12,580 INFO L130 PetriNetUnfolder]: 323/695 cut-off events. [2022-12-06 05:25:12,580 INFO L131 PetriNetUnfolder]: For 2262/2278 co-relation queries the response was YES. [2022-12-06 05:25:12,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 695 events. 323/695 cut-off events. For 2262/2278 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3556 event pairs, 25 based on Foata normal form. 10/532 useless extension candidates. Maximal degree in co-relation 1638. Up to 253 conditions per place. [2022-12-06 05:25:12,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 05:25:12,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 05:25:20,458 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:20,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1093] L52-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (<= 0 v_~q1_back~0_In_8) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_36| v_~q1~0.base_In_8) (+ (* v_~q1_back~0_In_8 4) v_~q1~0.offset_In_8)) 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_2| v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (ite |v_thread1_#t~short8#1_65| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (+ v_~q1_back~0_In_8 1) v_~q1_back~0_Out_24) |v_thread1_#t~short8#1_66| (< v_~q1_back~0_In_8 v_~n1~0_In_6) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q1~0.offset=v_~q1~0.offset_In_8, ~q1_back~0=v_~q1_back~0_In_8, ~n1~0=v_~n1~0_In_6, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_36|, ~N~0=v_~N~0_In_3} OutVars{~q1~0.offset=v_~q1~0.offset_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n1~0=v_~n1~0_In_6, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, ~q1_back~0=v_~q1_back~0_Out_24, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[|v_thread1_#t~short8#1_65|, |v_thread1_#t~short8#1_66|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#res#1.base] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:21,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:21,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:21,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1093] L52-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (<= 0 v_~q1_back~0_In_8) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_36| v_~q1~0.base_In_8) (+ (* v_~q1_back~0_In_8 4) v_~q1~0.offset_In_8)) 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_2| v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (ite |v_thread1_#t~short8#1_65| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (+ v_~q1_back~0_In_8 1) v_~q1_back~0_Out_24) |v_thread1_#t~short8#1_66| (< v_~q1_back~0_In_8 v_~n1~0_In_6) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q1~0.offset=v_~q1~0.offset_In_8, ~q1_back~0=v_~q1_back~0_In_8, ~n1~0=v_~n1~0_In_6, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_36|, ~N~0=v_~N~0_In_3} OutVars{~q1~0.offset=v_~q1~0.offset_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n1~0=v_~n1~0_In_6, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, ~q1_back~0=v_~q1_back~0_Out_24, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[|v_thread1_#t~short8#1_65|, |v_thread1_#t~short8#1_66|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#res#1.base] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:22,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1116] L52-2-->L143-3: Formula: (and (= (ite |v_thread1_#t~short2#1_90| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (< |v_thread1Thread1of1ForFork0_~i~0#1_68| v_~N~0_75) (= (+ v_~q1_back~0_190 1) v_~q1_back~0_189) (= |v_ULTIMATE.start_main_#t~pre32#1_58| |v_#pthreadsForks_117|) (= (store |v_#memory_int_333| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_333| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre32#1_58|)) |v_#memory_int_332|) (<= 0 v_~q1_back~0_190) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= (+ |v_#pthreadsForks_117| 1) |v_#pthreadsForks_116|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) |v_thread1_#t~short2#1_89| (< v_~q1_back~0_190 v_~n1~0_102) (= 2 (select (select |v_#memory_int_333| v_~q1~0.base_114) (+ (* v_~q1_back~0_190 4) v_~q1~0.offset_113)))) InVars {~q1~0.offset=v_~q1~0.offset_113, #pthreadsForks=|v_#pthreadsForks_117|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~q1_back~0=v_~q1_back~0_190, ~n1~0=v_~n1~0_102, ~q1~0.base=v_~q1~0.base_114, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_333|, ~N~0=v_~N~0_75, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} OutVars{~q1~0.offset=v_~q1~0.offset_113, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_31|, ~N~0=v_~N~0_75, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_58|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|, #pthreadsForks=|v_#pthreadsForks_116|, ~q1_back~0=v_~q1_back~0_189, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_20|, ~q1~0.base=v_~q1~0.base_114, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_22|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[|v_thread1_#t~short2#1_89|, |v_thread1_#t~short2#1_90|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, #pthreadsForks, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre32#1, thread1Thread1of1ForFork0_#t~mem1#1, ULTIMATE.start_main_#t~pre30#1] and [1108] L160-22-->L142-2: Formula: (and (= (store |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31| (store (select |v_#memory_int_266| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre30#1_33|)) |v_#memory_int_265|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet29#1_48| v_~q3_front~0_102) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (<= |v_ULTIMATE.start_main_#t~nondet27#1_40| 2147483647) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154| |v_ULTIMATE.start_create_fresh_int_array_~size#1_160|)) (<= |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483647) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| (ite (<= 0 v_~N~0_54) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483648)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet29#1_48| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90| v_~q3~0.base_83) (= |v_#pthreadsForks_79| |v_ULTIMATE.start_main_#t~pre30#1_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| v_~q3~0.offset_83) (= (+ |v_#pthreadsForks_79| 1) |v_#pthreadsForks_78|) (= v_~q1_back~0_145 v_~q1_front~0_96) (= v_~q2_front~0_124 v_~q2_back~0_122) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_213| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_56| v_~q2_front~0_124) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= v_~q3_front~0_102 v_~q3_back~0_120) (= |v_ULTIMATE.start_main_#t~nondet27#1_40| v_~q1_front~0_96) (<= |v_ULTIMATE.start_main_#t~nondet28#1_56| 2147483647)) 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_79|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, #memory_int=|v_#memory_int_266|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_48|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_40|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_56|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ~q1_front~0=v_~q1_front~0_96, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_35|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_90|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_33|, ~q3_front~0=v_~q3_front~0_102, ~q3_back~0=v_~q3_back~0_120, #pthreadsForks=|v_#pthreadsForks_78|, ~q1_back~0=v_~q1_back~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_213|, ~q3~0.base=v_~q3~0.base_83, ~q2_back~0=v_~q2_back~0_122, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ~q2_front~0=v_~q2_front~0_124, ~N~0=v_~N~0_54, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ~q3~0.offset=v_~q3~0.offset_83, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_160|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_90|, #memory_int=|v_#memory_int_265|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_167|} AuxVars[] AssignedVars[~q1_front~0, ULTIMATE.start_main_#t~ret26#1.base, ~q2_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet29#1, ~q3~0.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~pre30#1, ~q3_front~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~q3_back~0, #pthreadsForks, ~q1_back~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~q3~0.base, ~q2_back~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:25:22,450 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:25:22,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9930 [2022-12-06 05:25:22,451 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 807 flow [2022-12-06 05:25:22,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:22,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:22,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:22,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:22,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:22,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1720087402, now seen corresponding path program 1 times [2022-12-06 05:25:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:22,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372275597] [2022-12-06 05:25:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:23,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:23,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372275597] [2022-12-06 05:25:23,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372275597] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:23,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437747167] [2022-12-06 05:25:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:23,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:23,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:25:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:23,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 05:25:23,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:23,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 288 [2022-12-06 05:25:23,948 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:25:23,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-12-06 05:25:23,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-06 05:25:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:24,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437747167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:24,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 05:25:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345939836] [2022-12-06 05:25:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:25:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:25:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:25:24,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:25:24,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:24,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:24,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:25:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:24,509 INFO L130 PetriNetUnfolder]: 1447/2250 cut-off events. [2022-12-06 05:25:24,510 INFO L131 PetriNetUnfolder]: For 9200/9200 co-relation queries the response was YES. [2022-12-06 05:25:24,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11358 conditions, 2250 events. 1447/2250 cut-off events. For 9200/9200 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9833 event pairs, 540 based on Foata normal form. 4/1875 useless extension candidates. Maximal degree in co-relation 6155. Up to 797 conditions per place. [2022-12-06 05:25:24,533 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 152 selfloop transitions, 19 changer transitions 1/172 dead transitions. [2022-12-06 05:25:24,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 172 transitions, 1641 flow [2022-12-06 05:25:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:25:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:25:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-06 05:25:24,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30260047281323876 [2022-12-06 05:25:24,535 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 807 flow. Second operand 9 states and 128 transitions. [2022-12-06 05:25:24,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 172 transitions, 1641 flow [2022-12-06 05:25:24,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 172 transitions, 1629 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 05:25:24,552 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 782 flow [2022-12-06 05:25:24,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=782, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2022-12-06 05:25:24,552 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2022-12-06 05:25:24,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:24,553 INFO L89 Accepts]: Start accepts. Operand has 80 places, 77 transitions, 782 flow [2022-12-06 05:25:24,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:24,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:24,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 782 flow [2022-12-06 05:25:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 782 flow [2022-12-06 05:25:24,650 INFO L130 PetriNetUnfolder]: 321/691 cut-off events. [2022-12-06 05:25:24,650 INFO L131 PetriNetUnfolder]: For 2792/2812 co-relation queries the response was YES. [2022-12-06 05:25:24,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 691 events. 321/691 cut-off events. For 2792/2812 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3557 event pairs, 32 based on Foata normal form. 12/533 useless extension candidates. Maximal degree in co-relation 1932. Up to 252 conditions per place. [2022-12-06 05:25:24,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 782 flow [2022-12-06 05:25:24,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 05:25:24,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:24,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 05:25:24,675 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 782 flow [2022-12-06 05:25:24,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:24,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:24,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:24,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:24,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 05:25:24,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -843807897, now seen corresponding path program 1 times [2022-12-06 05:25:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:24,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983315077] [2022-12-06 05:25:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:24,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:24,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983315077] [2022-12-06 05:25:24,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983315077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:24,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89135620] [2022-12-06 05:25:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:24,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:24,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:25:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:25,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:25:25,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:25,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:25,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89135620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:25,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:25,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 05:25:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948101299] [2022-12-06 05:25:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:25:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:25:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:25:25,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:25:25,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 782 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:25,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:25,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:25:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:25,696 INFO L130 PetriNetUnfolder]: 2318/3859 cut-off events. [2022-12-06 05:25:25,696 INFO L131 PetriNetUnfolder]: For 20989/20989 co-relation queries the response was YES. [2022-12-06 05:25:25,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18734 conditions, 3859 events. 2318/3859 cut-off events. For 20989/20989 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21138 event pairs, 862 based on Foata normal form. 250/3615 useless extension candidates. Maximal degree in co-relation 10003. Up to 2250 conditions per place. [2022-12-06 05:25:25,722 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 125 selfloop transitions, 7 changer transitions 21/153 dead transitions. [2022-12-06 05:25:25,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 153 transitions, 1833 flow [2022-12-06 05:25:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:25:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:25:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 05:25:25,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.395 [2022-12-06 05:25:25,723 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 782 flow. Second operand 5 states and 79 transitions. [2022-12-06 05:25:25,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 153 transitions, 1833 flow [2022-12-06 05:25:25,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 1772 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 05:25:25,748 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 815 flow [2022-12-06 05:25:25,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=815, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2022-12-06 05:25:25,749 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-06 05:25:25,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:25,749 INFO L89 Accepts]: Start accepts. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 05:25:25,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:25,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:25,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 05:25:25,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 05:25:25,861 INFO L130 PetriNetUnfolder]: 383/954 cut-off events. [2022-12-06 05:25:25,861 INFO L131 PetriNetUnfolder]: For 3946/3976 co-relation queries the response was YES. [2022-12-06 05:25:25,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 954 events. 383/954 cut-off events. For 3946/3976 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5891 event pairs, 39 based on Foata normal form. 16/770 useless extension candidates. Maximal degree in co-relation 2237. Up to 294 conditions per place. [2022-12-06 05:25:25,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 05:25:25,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 05:25:30,506 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:30,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4758 [2022-12-06 05:25:30,507 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 830 flow [2022-12-06 05:25:30,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:30,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:30,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:30,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 05:25:30,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:25:30,708 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1562394205, now seen corresponding path program 1 times [2022-12-06 05:25:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:30,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312735727] [2022-12-06 05:25:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312735727] [2022-12-06 05:25:31,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312735727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128581239] [2022-12-06 05:25:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:31,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:31,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:31,379 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:31,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:25:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:25:31,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:31,625 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 05:25:31,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2022-12-06 05:25:31,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-12-06 05:25:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:31,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:31,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128581239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:31,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:31,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 05:25:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893712991] [2022-12-06 05:25:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:25:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:25:31,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:25:31,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:25:31,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-12-06 05:25:31,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:31,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:25:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:32,144 INFO L130 PetriNetUnfolder]: 1935/3200 cut-off events. [2022-12-06 05:25:32,145 INFO L131 PetriNetUnfolder]: For 15166/15166 co-relation queries the response was YES. [2022-12-06 05:25:32,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16115 conditions, 3200 events. 1935/3200 cut-off events. For 15166/15166 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16314 event pairs, 870 based on Foata normal form. 6/2790 useless extension candidates. Maximal degree in co-relation 8556. Up to 2747 conditions per place. [2022-12-06 05:25:32,168 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 70 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2022-12-06 05:25:32,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 1074 flow [2022-12-06 05:25:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:25:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:25:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 05:25:32,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28292682926829266 [2022-12-06 05:25:32,170 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 830 flow. Second operand 5 states and 58 transitions. [2022-12-06 05:25:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 1074 flow [2022-12-06 05:25:32,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 1058 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:25:32,212 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-12-06 05:25:32,213 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-06 05:25:32,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:32,213 INFO L89 Accepts]: Start accepts. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:32,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:32,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,321 INFO L130 PetriNetUnfolder]: 387/960 cut-off events. [2022-12-06 05:25:32,321 INFO L131 PetriNetUnfolder]: For 4334/4364 co-relation queries the response was YES. [2022-12-06 05:25:32,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 960 events. 387/960 cut-off events. For 4334/4364 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5892 event pairs, 52 based on Foata normal form. 16/776 useless extension candidates. Maximal degree in co-relation 2348. Up to 299 conditions per place. [2022-12-06 05:25:32,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 05:25:32,330 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:32,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 05:25:32,330 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 930 flow [2022-12-06 05:25:32,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-12-06 05:25:32,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:32,331 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:32,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:32,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:25:32,536 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1096053303, now seen corresponding path program 1 times [2022-12-06 05:25:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:32,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320202299] [2022-12-06 05:25:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320202299] [2022-12-06 05:25:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320202299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156099988] [2022-12-06 05:25:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:32,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:32,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:32,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:32,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:25:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:25:32,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:32,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156099988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:32,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:32,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 05:25:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723946033] [2022-12-06 05:25:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:32,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:25:32,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:25:32,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:32,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:32,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:25:32,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:33,433 INFO L130 PetriNetUnfolder]: 3164/5127 cut-off events. [2022-12-06 05:25:33,433 INFO L131 PetriNetUnfolder]: For 26848/26848 co-relation queries the response was YES. [2022-12-06 05:25:33,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27432 conditions, 5127 events. 3164/5127 cut-off events. For 26848/26848 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27791 event pairs, 702 based on Foata normal form. 158/4395 useless extension candidates. Maximal degree in co-relation 13760. Up to 1971 conditions per place. [2022-12-06 05:25:33,472 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 93 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-12-06 05:25:33,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1519 flow [2022-12-06 05:25:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:25:33,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-06 05:25:33,473 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 930 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:25:33,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1519 flow [2022-12-06 05:25:33,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1501 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:25:33,504 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1217, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2022-12-06 05:25:33,504 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2022-12-06 05:25:33,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:33,504 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:33,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:33,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,684 INFO L130 PetriNetUnfolder]: 655/1607 cut-off events. [2022-12-06 05:25:33,685 INFO L131 PetriNetUnfolder]: For 7970/8022 co-relation queries the response was YES. [2022-12-06 05:25:33,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 1607 events. 655/1607 cut-off events. For 7970/8022 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11045 event pairs, 55 based on Foata normal form. 4/1209 useless extension candidates. Maximal degree in co-relation 8196. Up to 503 conditions per place. [2022-12-06 05:25:33,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 05:25:33,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:33,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:25:33,703 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 1217 flow [2022-12-06 05:25:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:33,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:33,703 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:33,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:33,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:25:33,912 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 842607351, now seen corresponding path program 2 times [2022-12-06 05:25:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822018502] [2022-12-06 05:25:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822018502] [2022-12-06 05:25:34,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822018502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259747774] [2022-12-06 05:25:34,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:25:34,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:34,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:34,560 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:34,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:25:34,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:25:34,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:25:34,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:25:34,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:34,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:34,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:25:34,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 05:25:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:34,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:34,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259747774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:34,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:34,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 05:25:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951449790] [2022-12-06 05:25:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:34,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:25:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:25:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:25:34,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:25:34,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 98 transitions, 1217 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:34,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:34,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:25:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:36,040 INFO L130 PetriNetUnfolder]: 3545/5714 cut-off events. [2022-12-06 05:25:36,041 INFO L131 PetriNetUnfolder]: For 39178/39178 co-relation queries the response was YES. [2022-12-06 05:25:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33542 conditions, 5714 events. 3545/5714 cut-off events. For 39178/39178 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31394 event pairs, 1386 based on Foata normal form. 38/4816 useless extension candidates. Maximal degree in co-relation 33062. Up to 5091 conditions per place. [2022-12-06 05:25:36,092 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 159 selfloop transitions, 23 changer transitions 0/182 dead transitions. [2022-12-06 05:25:36,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 2287 flow [2022-12-06 05:25:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:25:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:25:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-06 05:25:36,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3201219512195122 [2022-12-06 05:25:36,093 INFO L175 Difference]: Start difference. First operand has 89 places, 98 transitions, 1217 flow. Second operand 8 states and 105 transitions. [2022-12-06 05:25:36,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 2287 flow [2022-12-06 05:25:36,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 182 transitions, 2155 flow, removed 66 selfloop flow, removed 0 redundant places. [2022-12-06 05:25:36,157 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1474, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2022-12-06 05:25:36,158 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2022-12-06 05:25:36,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:36,158 INFO L89 Accepts]: Start accepts. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:36,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:36,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,416 INFO L130 PetriNetUnfolder]: 736/1804 cut-off events. [2022-12-06 05:25:36,416 INFO L131 PetriNetUnfolder]: For 12027/12069 co-relation queries the response was YES. [2022-12-06 05:25:36,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 1804 events. 736/1804 cut-off events. For 12027/12069 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12842 event pairs, 65 based on Foata normal form. 6/1379 useless extension candidates. Maximal degree in co-relation 9652. Up to 565 conditions per place. [2022-12-06 05:25:36,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 05:25:36,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:36,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-06 05:25:36,449 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 1474 flow [2022-12-06 05:25:36,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:36,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:36,449 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:36,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:25:36,652 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1365045397, now seen corresponding path program 3 times [2022-12-06 05:25:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799204609] [2022-12-06 05:25:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799204609] [2022-12-06 05:25:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799204609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462269719] [2022-12-06 05:25:37,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:25:37,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:37,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:37,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:25:38,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:25:38,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:25:38,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:25:38,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:38,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:38,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:25:38,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:38,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:25:38,283 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 05:25:38,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 12 [2022-12-06 05:25:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:38,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462269719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:38,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:38,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 05:25:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764250404] [2022-12-06 05:25:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:38,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:25:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:25:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:25:38,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:25:38,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 1474 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:38,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:38,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:25:38,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:39,477 INFO L130 PetriNetUnfolder]: 3628/5831 cut-off events. [2022-12-06 05:25:39,477 INFO L131 PetriNetUnfolder]: For 53784/53784 co-relation queries the response was YES. [2022-12-06 05:25:39,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36784 conditions, 5831 events. 3628/5831 cut-off events. For 53784/53784 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31923 event pairs, 1359 based on Foata normal form. 2/4891 useless extension candidates. Maximal degree in co-relation 36250. Up to 5366 conditions per place. [2022-12-06 05:25:39,565 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 157 selfloop transitions, 27 changer transitions 0/184 dead transitions. [2022-12-06 05:25:39,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 184 transitions, 2316 flow [2022-12-06 05:25:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:25:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:25:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-06 05:25:39,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31097560975609756 [2022-12-06 05:25:39,566 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 1474 flow. Second operand 8 states and 102 transitions. [2022-12-06 05:25:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 184 transitions, 2316 flow [2022-12-06 05:25:39,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 184 transitions, 2278 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 05:25:39,622 INFO L231 Difference]: Finished difference. Result has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1631, PETRI_PLACES=110, PETRI_TRANSITIONS=121} [2022-12-06 05:25:39,623 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2022-12-06 05:25:39,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:39,623 INFO L89 Accepts]: Start accepts. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:39,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:39,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,799 INFO L130 PetriNetUnfolder]: 752/1839 cut-off events. [2022-12-06 05:25:39,799 INFO L131 PetriNetUnfolder]: For 11649/11693 co-relation queries the response was YES. [2022-12-06 05:25:39,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10140 conditions, 1839 events. 752/1839 cut-off events. For 11649/11693 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13090 event pairs, 65 based on Foata normal form. 8/1413 useless extension candidates. Maximal degree in co-relation 9874. Up to 580 conditions per place. [2022-12-06 05:25:39,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 05:25:39,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:39,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 05:25:39,826 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 121 transitions, 1631 flow [2022-12-06 05:25:39,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:39,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:39,826 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:39,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:40,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:40,031 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:25:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:40,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1009844971, now seen corresponding path program 4 times [2022-12-06 05:25:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:40,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345337295] [2022-12-06 05:25:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345337295] [2022-12-06 05:25:40,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345337295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736892578] [2022-12-06 05:25:40,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:25:40,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:40,778 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:40,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:25:40,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:25:40,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:25:40,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:25:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:40,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 288 [2022-12-06 05:25:41,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:25:41,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:25:41,255 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:25:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-12-06 05:25:41,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:25:41,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:25:43,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:25:43,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-12-06 05:25:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:43,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:25:44,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:25:44,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 263 treesize of output 307 [2022-12-06 05:25:44,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:25:44,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 147 [2022-12-06 05:25:44,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2022-12-06 05:25:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:46,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736892578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:25:46,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:25:46,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 05:25:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064832526] [2022-12-06 05:25:46,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:25:46,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 05:25:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 05:25:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-12-06 05:25:46,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:25:46,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 121 transitions, 1631 flow. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 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-12-06 05:25:46,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:46,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:25:46,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:49,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 05:26:41,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:26:58,814 INFO L130 PetriNetUnfolder]: 5412/8673 cut-off events. [2022-12-06 05:26:58,815 INFO L131 PetriNetUnfolder]: For 87288/87288 co-relation queries the response was YES. [2022-12-06 05:26:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57865 conditions, 8673 events. 5412/8673 cut-off events. For 87288/87288 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 52315 event pairs, 1095 based on Foata normal form. 724/7733 useless extension candidates. Maximal degree in co-relation 57328. Up to 3318 conditions per place. [2022-12-06 05:26:58,890 INFO L137 encePairwiseOnDemand]: 18/41 looper letters, 309 selfloop transitions, 119 changer transitions 278/706 dead transitions. [2022-12-06 05:26:58,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 706 transitions, 8361 flow [2022-12-06 05:26:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-06 05:26:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-06 05:26:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 539 transitions. [2022-12-06 05:26:58,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18515973892133286 [2022-12-06 05:26:58,913 INFO L175 Difference]: Start difference. First operand has 110 places, 121 transitions, 1631 flow. Second operand 71 states and 539 transitions. [2022-12-06 05:26:58,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 706 transitions, 8361 flow [2022-12-06 05:26:59,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 706 transitions, 8291 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 05:26:59,025 INFO L231 Difference]: Finished difference. Result has 217 places, 220 transitions, 3684 flow [2022-12-06 05:26:59,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=3684, PETRI_PLACES=217, PETRI_TRANSITIONS=220} [2022-12-06 05:26:59,026 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 183 predicate places. [2022-12-06 05:26:59,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:59,026 INFO L89 Accepts]: Start accepts. Operand has 217 places, 220 transitions, 3684 flow [2022-12-06 05:26:59,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:59,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:59,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 220 transitions, 3684 flow [2022-12-06 05:26:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 220 transitions, 3684 flow [2022-12-06 05:26:59,278 INFO L130 PetriNetUnfolder]: 756/1810 cut-off events. [2022-12-06 05:26:59,278 INFO L131 PetriNetUnfolder]: For 64764/65064 co-relation queries the response was YES. [2022-12-06 05:26:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16365 conditions, 1810 events. 756/1810 cut-off events. For 64764/65064 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12698 event pairs, 92 based on Foata normal form. 18/1604 useless extension candidates. Maximal degree in co-relation 15998. Up to 673 conditions per place. [2022-12-06 05:26:59,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 220 transitions, 3684 flow [2022-12-06 05:26:59,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 05:26:59,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:26:59,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:27:05,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:27:05,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:27:05,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:27:06,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:27:11,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1051] L143-4-->L144-3: Formula: (and (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= (store |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27| (store (select |v_#memory_int_210| |v_ULTIMATE.start_main_~#t3~0#1.base_27|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre34#1_23|)) |v_#memory_int_209|) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre34#1_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_210|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #memory_int=|v_#memory_int_209|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_27|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_23|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 05:27:11,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1058] L81-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_45| (+ (select (select |v_#memory_int_225| v_~q2~0.base_67) (+ v_~q2~0.offset_67 (* v_~q2_back~0_91 4))) 1)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_45| 0) (<= 0 v_~q2_back~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (< v_~q2_back~0_91 v_~n2~0_58) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite |v_thread2_#t~short13#1_67| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread2Thread1of1ForFork1_~s~0#1_31| (+ |v_thread2Thread1of1ForFork1_~s~0#1_32| |v_thread2Thread1of1ForFork1_~j~0#1_45|)) |v_thread2_#t~short13#1_68| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_32|, ~q2_back~0=v_~q2_back~0_91} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_15|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_31|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_25|, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, ~q2_back~0=v_~q2_back~0_90} AuxVars[|v_thread2_#t~short13#1_68|, |v_thread2_#t~short13#1_67|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:27:11,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1058] L81-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_45| (+ (select (select |v_#memory_int_225| v_~q2~0.base_67) (+ v_~q2~0.offset_67 (* v_~q2_back~0_91 4))) 1)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_45| 0) (<= 0 v_~q2_back~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (< v_~q2_back~0_91 v_~n2~0_58) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite |v_thread2_#t~short13#1_67| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= |v_thread2Thread1of1ForFork1_~s~0#1_31| (+ |v_thread2Thread1of1ForFork1_~s~0#1_32| |v_thread2Thread1of1ForFork1_~j~0#1_45|)) |v_thread2_#t~short13#1_68| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_32|, ~q2_back~0=v_~q2_back~0_91} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_45|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_15|, ~n2~0=v_~n2~0_58, ~q2~0.offset=v_~q2~0.offset_67, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_31|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_15|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_25|, #memory_int=|v_#memory_int_225|, ~q2~0.base=v_~q2~0.base_67, ~q2_back~0=v_~q2_back~0_90} AuxVars[|v_thread2_#t~short13#1_68|, |v_thread2_#t~short13#1_67|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:27:12,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:27:21,829 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 05:27:21,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22804 [2022-12-06 05:27:21,830 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 212 transitions, 3782 flow [2022-12-06 05:27:21,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 states have internal predecessors, (59), 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-12-06 05:27:21,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:21,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:21,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:27:22,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:22,031 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:27:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash 718661309, now seen corresponding path program 1 times [2022-12-06 05:27:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847030968] [2022-12-06 05:27:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847030968] [2022-12-06 05:27:23,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847030968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:27:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969590589] [2022-12-06 05:27:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:23,212 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:27:23,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:27:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:27:23,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:23,631 INFO L321 Elim1Store]: treesize reduction 9, result has 84.7 percent of original size [2022-12-06 05:27:23,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2022-12-06 05:27:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:23,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:27:23,948 INFO L321 Elim1Store]: treesize reduction 8, result has 97.0 percent of original size [2022-12-06 05:27:23,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 289 [2022-12-06 05:27:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:46,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969590589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:27:46,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:27:46,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-06 05:27:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393924436] [2022-12-06 05:27:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:27:46,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:27:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:27:46,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:27:46,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:27:46,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 212 transitions, 3782 flow. Second operand has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 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-12-06 05:27:46,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:46,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:27:46,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:50,068 INFO L130 PetriNetUnfolder]: 5566/9260 cut-off events. [2022-12-06 05:27:50,068 INFO L131 PetriNetUnfolder]: For 319904/319904 co-relation queries the response was YES. [2022-12-06 05:27:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83514 conditions, 9260 events. 5566/9260 cut-off events. For 319904/319904 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 59365 event pairs, 1562 based on Foata normal form. 6/8778 useless extension candidates. Maximal degree in co-relation 81520. Up to 4756 conditions per place. [2022-12-06 05:27:50,173 INFO L137 encePairwiseOnDemand]: 30/55 looper letters, 385 selfloop transitions, 40 changer transitions 86/511 dead transitions. [2022-12-06 05:27:50,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 511 transitions, 9387 flow [2022-12-06 05:27:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 05:27:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 05:27:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 215 transitions. [2022-12-06 05:27:50,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18614718614718614 [2022-12-06 05:27:50,178 INFO L175 Difference]: Start difference. First operand has 185 places, 212 transitions, 3782 flow. Second operand 21 states and 215 transitions. [2022-12-06 05:27:50,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 511 transitions, 9387 flow [2022-12-06 05:27:51,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 511 transitions, 7929 flow, removed 722 selfloop flow, removed 20 redundant places. [2022-12-06 05:27:51,707 INFO L231 Difference]: Finished difference. Result has 194 places, 221 transitions, 3435 flow [2022-12-06 05:27:51,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3435, PETRI_PLACES=194, PETRI_TRANSITIONS=221} [2022-12-06 05:27:51,707 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 160 predicate places. [2022-12-06 05:27:51,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:51,708 INFO L89 Accepts]: Start accepts. Operand has 194 places, 221 transitions, 3435 flow [2022-12-06 05:27:51,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:51,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:51,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 221 transitions, 3435 flow [2022-12-06 05:27:51,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 221 transitions, 3435 flow [2022-12-06 05:27:51,930 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1093] L52-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (<= 0 v_~q1_back~0_In_8) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_36| v_~q1~0.base_In_8) (+ (* v_~q1_back~0_In_8 4) v_~q1~0.offset_In_8)) 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_2| v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (ite |v_thread1_#t~short8#1_65| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= (+ v_~q1_back~0_In_8 1) v_~q1_back~0_Out_24) |v_thread1_#t~short8#1_66| (< v_~q1_back~0_In_8 v_~n1~0_In_6) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q1~0.offset=v_~q1~0.offset_In_8, ~q1_back~0=v_~q1_back~0_In_8, ~n1~0=v_~n1~0_In_6, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_36|, ~N~0=v_~N~0_In_3} OutVars{~q1~0.offset=v_~q1~0.offset_In_8, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n1~0=v_~n1~0_In_6, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, ~q1_back~0=v_~q1_back~0_Out_24, ~q1~0.base=v_~q1~0.base_In_8, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[|v_thread1_#t~short8#1_65|, |v_thread1_#t~short8#1_66|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 263#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 134#L98-2true, 1855#true, Black: 268#(= ~r~0 0), Black: 1725#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1761#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1368#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1759#(and (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= 1 ~n1~0) (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1394#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 1358#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), 845#(= ~q1~0.offset 0), Black: 1713#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1378#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1428#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 916#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1737#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 377#(<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|), Black: 1695#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 920#(and (= ~q1~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1111#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1765#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1177#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 1)), Black: 1677#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (or (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))))) (= ~q2~0.offset 0) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1701#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1735#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 26#L144-4true, Black: 1717#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1727#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 544#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 1747#(and (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1767#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1785#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1797#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 1755#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), 171#thread1EXITtrue, Black: 1697#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 1723#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1703#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1743#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 657#(<= ~n1~0 2), Black: 1751#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), 1277#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 1276#(<= ~q1_back~0 ~q1_front~0), Black: 384#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0)), Black: 1099#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (= ~q1~0.base ~q2~0.base))), Black: 1033#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), Black: 1093#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), 158#L76-2true, 1269#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), 546#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), 1029#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (not (= ~q1~0.base ~q2~0.base))), Black: 273#(<= ~n1~0 1), Black: 360#(or (< ~q3_front~0 0) (<= ~q3_back~0 ~q3_front~0) (<= ~n3~0 ~q3_front~0)), Black: 945#(and (<= ~n2~0 2) (= ~q1_back~0 ~q1_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1483#(and (<= ~n2~0 2) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 1473#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) |thread2Thread1of1ForFork1_~j~0#1|)))), Black: 941#(and (<= ~n2~0 2) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), Black: 238#(<= ~q2_back~0 ~q2_front~0), Black: 1456#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), Black: 1005#(and (<= 1 ~n1~0) (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), 1521#true, Black: 2007#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2011#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 1945#(or (not (< ~q3_back~0 ~n3~0)) (and (< 0 (+ ~r~0 1)) (<= ~r~0 0))), Black: 1267#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0)), Black: 1271#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2029#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2037#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (or (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (<= 0 (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4)))) (= ~q2~0.offset 0) (<= 0 ~q3_front~0)) (<= ~n3~0 ~q3_back~0)) (= ~q3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4))) ~r~0) 0) (not (< ~q3_back~0 ~n3~0))) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2009#(and (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= 0 ~q1~0.offset) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))))))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= ~q3~0.offset 0) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 2033#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~r~0 1) (< 0 (+ ~r~0 1)) (= (* ~q3_back~0 4) (* ~q3_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2013#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (<= ~n3~0 2) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (or (not (= ~q3_back~0 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (= ~r~0 0) (= ~q3_back~0 ~q3_front~0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 814#(and (<= ~n1~0 2) (or (< ~q1_front~0 0) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~n1~0 (+ ~q1_front~0 2)) (< ~n1~0 (+ ~q1_back~0 2)))), Black: 1864#(and (< 0 (+ ~r~0 1)) (<= ~r~0 0))]) [2022-12-06 05:27:51,930 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:27:51,930 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,930 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:27:51,931 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,931 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1092] L98-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| (ite |v_thread3_#t~short18#1_93| 1 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_4| 0) |v_thread3_#t~short18#1_94| (= (+ 1 (select (select |v_#memory_int_In_34| v_~q3~0.base_In_5) (+ (* v_~q3_back~0_In_5 4) v_~q3~0.offset_In_5))) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= v_~q2_front~0_Out_22 (+ v_~q2_front~0_In_3 1)) (not (= (ite (and (< v_~q2_front~0_In_3 v_~n2~0_In_4) (<= 0 v_~q2_front~0_In_3) (< v_~q2_front~0_In_3 v_~q2_back~0_In_4)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_Out_4| (+ |v_thread3Thread1of1ForFork2_~t~0#1_In_2| |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_Out_6| 0) (< v_~q3_back~0_In_5 v_~n3~0_In_6) (<= 0 v_~q3_back~0_In_5) (= (select (select |v_#memory_int_In_34| v_~q2~0.base_In_4) (+ (* v_~q2_front~0_In_3 4) v_~q2~0.offset_In_4)) |v_thread3Thread1of1ForFork2_~k~0#1_Out_6|) (= (+ v_~q3_back~0_In_5 1) v_~q3_back~0_Out_20) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|)) InVars {~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, ~q2_front~0=v_~q2_front~0_In_3, ~q3~0.offset=v_~q3~0.offset_In_5, ~q3_back~0=v_~q3_back~0_In_5, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_In_2|, ~q2_back~0=v_~q2_back~0_In_4} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_Out_6|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~n2~0=v_~n2~0_In_4, ~n3~0=v_~n3~0_In_6, ~q2~0.offset=v_~q2~0.offset_In_4, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_Out_6|, ~q2_front~0=v_~q2_front~0_Out_22, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_Out_4|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_Out_4|, ~q3~0.offset=v_~q3~0.offset_In_5, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_Out_4|, ~q3_back~0=v_~q3_back~0_Out_20, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_4|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_34|, ~q3~0.base=v_~q3~0.base_In_5, ~q2~0.base=v_~q2~0.base_In_4, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_Out_4|, ~q2_back~0=v_~q2_back~0_In_4, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_Out_6|} AuxVars[|v_thread3_#t~short18#1_93|, |v_thread3_#t~short18#1_94|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1][77], [Black: 263#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 91#L52-2true, 1855#true, Black: 268#(= ~r~0 0), Black: 1725#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1761#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1759#(and (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= 1 ~n1~0) (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1368#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1394#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 1358#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), 845#(= ~q1~0.offset 0), Black: 1713#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1378#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1428#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1737#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 916#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), 377#(<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|), Black: 1695#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 920#(and (= ~q1~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1111#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1765#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1177#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 1)), Black: 1677#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (or (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))))) (= ~q2~0.offset 0) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1701#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1735#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 26#L144-4true, Black: 1717#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), 99#thread3EXITtrue, Black: 1727#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 544#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 1747#(and (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1767#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1785#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1797#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 1755#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1697#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), 657#(<= ~n1~0 2), Black: 1723#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1703#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1743#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1751#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 814#(and (<= ~n1~0 2) (or (< ~q1_front~0 0) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~n1~0 (+ ~q1_front~0 2)) (< ~n1~0 (+ ~q1_back~0 2)))), Black: 1277#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 384#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0)), Black: 1099#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (= ~q1~0.base ~q2~0.base))), Black: 1033#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), Black: 1093#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), 158#L76-2true, 1269#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), 546#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), 1029#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (not (= ~q1~0.base ~q2~0.base))), Black: 273#(<= ~n1~0 1), 1276#(<= ~q1_back~0 ~q1_front~0), Black: 360#(or (< ~q3_front~0 0) (<= ~q3_back~0 ~q3_front~0) (<= ~n3~0 ~q3_front~0)), Black: 945#(and (<= ~n2~0 2) (= ~q1_back~0 ~q1_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1483#(and (<= ~n2~0 2) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 941#(and (<= ~n2~0 2) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), Black: 238#(<= ~q2_back~0 ~q2_front~0), Black: 1473#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) |thread2Thread1of1ForFork1_~j~0#1|)))), Black: 1456#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), Black: 1005#(and (<= 1 ~n1~0) (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), 1521#true, Black: 2007#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2011#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 1267#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0)), Black: 1945#(or (not (< ~q3_back~0 ~n3~0)) (and (< 0 (+ ~r~0 1)) (<= ~r~0 0))), Black: 1271#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2029#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2037#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (or (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (<= 0 (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4)))) (= ~q2~0.offset 0) (<= 0 ~q3_front~0)) (<= ~n3~0 ~q3_back~0)) (= ~q3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4))) ~r~0) 0) (not (< ~q3_back~0 ~n3~0))) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2009#(and (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= 0 ~q1~0.offset) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))))))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= ~q3~0.offset 0) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 2033#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~r~0 1) (< 0 (+ ~r~0 1)) (= (* ~q3_back~0 4) (* ~q3_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2013#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (<= ~n3~0 2) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (or (not (= ~q3_back~0 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (= ~r~0 0) (= ~q3_back~0 ~q3_front~0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1864#(and (< 0 (+ ~r~0 1)) (<= ~r~0 0))]) [2022-12-06 05:27:51,931 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:27:51,931 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,932 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:27:51,932 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,932 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1][57], [Black: 263#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 134#L98-2true, 91#L52-2true, 1855#true, Black: 268#(= ~r~0 0), Black: 1725#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1761#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1368#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1759#(and (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= 1 ~n1~0) (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1394#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 1358#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), 845#(= ~q1~0.offset 0), Black: 1713#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1378#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1428#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 916#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1737#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 377#(<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|), Black: 920#(and (= ~q1~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1695#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1111#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1765#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1177#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 1)), Black: 1677#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (or (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))))) (= ~q2~0.offset 0) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1701#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1735#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 26#L144-4true, Black: 1717#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1727#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 544#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 1747#(and (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1767#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1785#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1797#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 1755#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1697#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), 657#(<= ~n1~0 2), Black: 1723#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1703#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1743#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1751#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 814#(and (<= ~n1~0 2) (or (< ~q1_front~0 0) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~n1~0 (+ ~q1_front~0 2)) (< ~n1~0 (+ ~q1_back~0 2)))), Black: 1277#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 384#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0)), Black: 1099#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (= ~q1~0.base ~q2~0.base))), Black: 1033#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), Black: 1093#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), 158#L76-2true, 1269#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), 546#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), 1029#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (not (= ~q1~0.base ~q2~0.base))), Black: 273#(<= ~n1~0 1), 1276#(<= ~q1_back~0 ~q1_front~0), Black: 360#(or (< ~q3_front~0 0) (<= ~q3_back~0 ~q3_front~0) (<= ~n3~0 ~q3_front~0)), Black: 945#(and (<= ~n2~0 2) (= ~q1_back~0 ~q1_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1483#(and (<= ~n2~0 2) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 1473#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) |thread2Thread1of1ForFork1_~j~0#1|)))), Black: 238#(<= ~q2_back~0 ~q2_front~0), Black: 941#(and (<= ~n2~0 2) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), Black: 1456#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), Black: 1005#(and (<= 1 ~n1~0) (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), 1521#true, Black: 2007#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2011#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 1267#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0)), Black: 1945#(or (not (< ~q3_back~0 ~n3~0)) (and (< 0 (+ ~r~0 1)) (<= ~r~0 0))), Black: 1271#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2029#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2037#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (or (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (<= 0 (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4)))) (= ~q2~0.offset 0) (<= 0 ~q3_front~0)) (<= ~n3~0 ~q3_back~0)) (= ~q3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4))) ~r~0) 0) (not (< ~q3_back~0 ~n3~0))) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2009#(and (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= 0 ~q1~0.offset) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))))))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= ~q3~0.offset 0) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 2033#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~r~0 1) (< 0 (+ ~r~0 1)) (= (* ~q3_back~0 4) (* ~q3_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2013#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (<= ~n3~0 2) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (or (not (= ~q3_back~0 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (= ~r~0 0) (= ~q3_back~0 ~q3_front~0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1864#(and (< 0 (+ ~r~0 1)) (<= ~r~0 0))]) [2022-12-06 05:27:51,933 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:27:51,933 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,933 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:27:51,933 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1][128], [Black: 263#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 134#L98-2true, 1855#true, Black: 268#(= ~r~0 0), Black: 1725#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1761#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1368#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1759#(and (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= 1 ~n1~0) (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1394#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~n1~0 2)), Black: 1358#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), 845#(= ~q1~0.offset 0), Black: 1713#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1378#(and (<= ~n2~0 2) (<= 1 ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1428#(and (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q1_front~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (= ~q2~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 916#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1737#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 377#(<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|), Black: 920#(and (= ~q1~0.offset 0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|) (= ~q2_back~0 ~q2_front~0)), Black: 1695#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1111#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1765#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1177#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 1)), Black: 1677#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (or (forall ((~q2_back~0 Int) (~q1_front~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (< (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (or (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))))) (= ~q2~0.offset 0) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), Black: 1701#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1735#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (< ~q1_back~0 ~n1~0)) (not (< ~q2_back~0 ~n2~0)))), 26#L144-4true, Black: 1717#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1727#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 544#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), Black: 1747#(and (<= 2 ~q2_back~0) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n2~0) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0)))), Black: 1767#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1785#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1797#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), Black: 1755#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)))) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1697#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 1723#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 1703#(and (or (and (<= 1 ~n1~0) (<= 1 ~q1_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))))) (and (<= 1 ~n1~0) (<= 2 ~q1_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int) (v_ArrVal_1484 (Array Int Int))) (or (not (< (+ ~q2_back~0 1) ~n2~0)) (not (<= 0 ~q2_front~0)) (not (<= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1484) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (< ~q2_front~0 (+ ~q2_back~0 1))))) (not (< ~q1_back~0 ~n1~0))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base))), Black: 1743#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0))) (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= |thread2Thread1of1ForFork1_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0)) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 ~q1_back~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= 0 ~q1~0.offset) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (* ~q1_back~0 4) (+ ~q1~0.offset (* ~q1_front~0 4))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0))), Black: 657#(<= ~n1~0 2), Black: 1751#(and (<= ~n2~0 2) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)) (not (= ~q1~0.base ~q2~0.base)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_back~0_273 Int) (v_~q1_front~0_193 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (< v_~q1_front~0_193 ~n1~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_193 4) ~q1~0.offset)) |thread2Thread1of1ForFork1_~j~0#1|) (< v_~q1_front~0_193 ~q1_back~0) (<= 0 v_~q1_front~0_193) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0) (not (= ~q1~0.base ~q2~0.base)))) (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (<= ~n1~0 2) (not (= ~q1~0.base ~q2~0.base)) (exists ((v_~q1_back~0_273 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* v_~q1_back~0_273 4)))) (<= 0 v_~q1_back~0_273) (<= (+ v_~q1_back~0_273 1) ~q1_back~0))) (or (and (<= 1 ~n2~0) (<= 2 ~q1_back~0)) (and (<= 2 ~q2_back~0) (<= 1 ~n2~0)))), 1277#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 1276#(<= ~q1_back~0 ~q1_front~0), Black: 384#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0)), Black: 1099#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (= ~q1~0.base ~q2~0.base))), Black: 1033#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), Black: 1093#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (not (= ~q1~0.base ~q2~0.base))), 158#L76-2true, 1269#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), 546#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 2 |thread2Thread1of1ForFork1_~j~0#1|)), 1029#(and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1~0.offset 0) (not (= ~q1~0.base ~q2~0.base))), Black: 273#(<= ~n1~0 1), Black: 360#(or (< ~q3_front~0 0) (<= ~q3_back~0 ~q3_front~0) (<= ~n3~0 ~q3_front~0)), 151#L56true, Black: 945#(and (<= ~n2~0 2) (= ~q1_back~0 ~q1_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 2)), Black: 1483#(and (<= ~n2~0 2) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (- 4) (* ~q2_back~0 4))) 1)))) (= ~q2~0.offset 0) (<= 1 ~q2_back~0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 1473#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0) (exists ((~q1~0.base Int) (v_~q1_front~0_192 Int)) (and (<= 2 (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4))) (<= (select (select |#memory_int| ~q1~0.base) (* v_~q1_front~0_192 4)) |thread2Thread1of1ForFork1_~j~0#1|)))), Black: 941#(and (<= ~n2~0 2) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), Black: 238#(<= ~q2_back~0 ~q2_front~0), Black: 1456#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n2~0 2) (<= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), Black: 1005#(and (<= 1 ~n1~0) (<= ~n2~0 2) (<= 1 ~q1_back~0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= 0 ~q2_front~0) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n1~0 2)), 1521#true, Black: 2007#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2011#(and (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 1945#(or (not (< ~q3_back~0 ~n3~0)) (and (< 0 (+ ~r~0 1)) (<= ~r~0 0))), Black: 1267#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q2_back~0 ~q2_front~0)), Black: 1271#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~q2~0.base) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2029#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2037#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (not (<= (+ ~r~0 1) 0)) (<= ~n3~0 2) (<= 1 ~q3_back~0) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (or (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (<= 0 (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4)))) (= ~q2~0.offset 0) (<= 0 ~q3_front~0)) (<= ~n3~0 ~q3_back~0)) (= ~q3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~q3~0.base) (+ ~q3~0.offset (* ~q3_front~0 4))) ~r~0) 0) (not (< ~q3_back~0 ~n3~0))) (<= ~r~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2009#(and (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (or (and (not (= ~q3_back~0 0)) (or (<= ~n3~0 2) (<= ~q3_back~0 0))) (and (<= (+ ~q3~0.offset (* ~q3_front~0 4)) 0) (or (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (and (or (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= (+ ~n2~0 ~q2_back~0) (+ 2 ~q2_front~0))) (< 0 (+ ~q2~0.offset (* ~q2_back~0 4) 1)))) (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (<= (* ~q1_front~0 4) (+ (* ~q1_back~0 4) ~q1~0.offset)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 8)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= 0 ~q1~0.offset) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1))))))) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= ~q3~0.offset 0) (= ~q3_back~0 ~q3_front~0) (< 0 (+ ~r~0 1)) (<= ~r~0 0)), Black: 2033#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~r~0 1) (< 0 (+ ~r~0 1)) (= (* ~q3_back~0 4) (* ~q3_front~0 4))) (not (<= 0 ~q3_back~0)) (< ~n3~0 (+ ~q3_back~0 2))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2013#(and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (<= ~n2~0 2) (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (= ~q2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0))) (or (= ~q2~0.offset 0) (<= (* ~n3~0 4) (+ ~q3~0.offset (* ~q3_back~0 4) 3))) (<= ~n3~0 2) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (= ~q3~0.offset 0) (or (not (= ~q3_back~0 0)) (and (or (<= (+ (* ~n1~0 4) ~q1~0.offset) 8) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (= ~q2~0.offset 0) (or (<= ~n2~0 2) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)))) (= ~r~0 0) (= ~q3_back~0 ~q3_front~0) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 814#(and (<= ~n1~0 2) (or (< ~q1_front~0 0) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~n1~0 (+ ~q1_front~0 2)) (< ~n1~0 (+ ~q1_back~0 2)))), Black: 1864#(and (< 0 (+ ~r~0 1)) (<= ~r~0 0))]) [2022-12-06 05:27:51,934 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:27:51,934 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,934 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:27:51,934 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:27:52,227 INFO L130 PetriNetUnfolder]: 1038/2530 cut-off events. [2022-12-06 05:27:52,227 INFO L131 PetriNetUnfolder]: For 87013/87459 co-relation queries the response was YES. [2022-12-06 05:27:52,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20886 conditions, 2530 events. 1038/2530 cut-off events. For 87013/87459 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19755 event pairs, 121 based on Foata normal form. 39/2224 useless extension candidates. Maximal degree in co-relation 20816. Up to 930 conditions per place. [2022-12-06 05:27:52,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 221 transitions, 3435 flow [2022-12-06 05:27:52,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-06 05:28:03,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1129] L52-2-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_391| v_~q2~0.base_120)) (.cse1 (select |v_#memory_int_391| v_~q1~0.base_135))) (and (= (+ v_~q2_back~0_175 1) v_~q2_back~0_174) |v_thread3_#t~short18#1_150| (not (= (ite (and (<= 0 v_~q2_front~0_149) (< v_~q2_front~0_149 v_~q2_back~0_174) (< v_~q2_front~0_149 v_~n2~0_128)) 1 0) 0)) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_91| 0)) (<= 0 v_~q3_back~0_149) (= (select .cse0 (+ v_~q2~0.offset_120 (* v_~q2_front~0_149 4))) |v_thread3Thread1of1ForFork2_~k~0#1_54|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (= |v_thread3Thread1of1ForFork2_~t~0#1_58| (+ |v_thread3Thread1of1ForFork2_~t~0#1_59| |v_thread3Thread1of1ForFork2_~k~0#1_54|)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_54| 0)) (= (ite |v_thread3_#t~short18#1_149| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) |v_thread2_#t~short13#1_162| (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| 0)) (= (+ (select .cse0 (+ v_~q2~0.offset_120 (* 4 v_~q2_back~0_175))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_91|) (= |v_thread2Thread1of1ForFork1_~s~0#1_83| (+ |v_thread2Thread1of1ForFork1_~s~0#1_84| |v_thread2Thread1of1ForFork1_~j~0#1_91|)) (< v_~q3_back~0_149 v_~n3~0_110) (= (+ v_~q3_back~0_149 1) v_~q3_back~0_148) (not (= (ite (and (< v_~q1_front~0_162 v_~n1~0_118) (<= 0 v_~q1_front~0_162) (< v_~q1_front~0_162 v_~q1_back~0_222)) 1 0) 0)) (< v_~q1_back~0_223 v_~n1~0_118) |v_thread1_#t~short2#1_126| (< |v_thread1Thread1of1ForFork0_~i~0#1_83| v_~N~0_91) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (= (ite |v_thread1_#t~short2#1_125| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~q1_front~0_162 1) v_~q1_front~0_161) (< v_~q2_back~0_175 v_~n2~0_128) (= |v_thread2Thread1of1ForFork1_~j~0#1_91| (select .cse1 (+ v_~q1~0.offset_134 (* v_~q1_front~0_162 4)))) (= (ite |v_thread2_#t~short13#1_161| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (= 2 (select .cse1 (+ (* v_~q1_back~0_223 4) v_~q1~0.offset_134))) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148) (= (+ v_~q1_back~0_223 1) v_~q1_back~0_222) (= |v_thread3Thread1of1ForFork2_~k~0#1_54| (+ (select (select |v_#memory_int_391| v_~q3~0.base_104) (+ (* 4 v_~q3_back~0_149) v_~q3~0.offset_104)) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_134, ~n2~0=v_~n2~0_128, ~q1_front~0=v_~q1_front~0_162, ~n3~0=v_~n3~0_110, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_118, ~q2_front~0=v_~q2_front~0_149, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_84|, ~q3~0.offset=v_~q3~0.offset_104, ~q3_back~0=v_~q3_back~0_149, ~q1_back~0=v_~q1_back~0_223, ~q1~0.base=v_~q1~0.base_135, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, #memory_int=|v_#memory_int_391|, ~q3~0.base=v_~q3~0.base_104, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_175, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_59|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_42|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_34|, ~q1_front~0=v_~q1_front~0_161, ~n3~0=v_~n3~0_110, ~q2~0.offset=v_~q2~0.offset_120, ~n1~0=v_~n1~0_118, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_37|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_37|, ~q3_back~0=v_~q3_back~0_148, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_42|, ~q1_back~0=v_~q1_back~0_222, ~q1~0.base=v_~q1~0.base_135, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, ~q3~0.base=v_~q3~0.base_104, ~q2~0.base=v_~q2~0.base_120, ~q2_back~0=v_~q2_back~0_174, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_54|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_91|, ~q1~0.offset=v_~q1~0.offset_134, ~n2~0=v_~n2~0_128, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_35|, ~q2_front~0=v_~q2_front~0_148, ~N~0=v_~N~0_91, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_37|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_83|, ~q3~0.offset=v_~q3~0.offset_104, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_42|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_54|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_34|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, #memory_int=|v_#memory_int_391|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_36|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_58|} AuxVars[|v_thread1_#t~short2#1_126|, |v_thread3_#t~short18#1_150|, |v_thread2_#t~short13#1_161|, |v_thread2_#t~short13#1_162|, |v_thread1_#t~short2#1_125|, |v_thread3_#t~short18#1_149|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_front~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, ~q1_back~0, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread3Thread1of1ForFork2_~t~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 05:28:04,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1124] L52-2-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_369| v_~q2~0.base_112)) (.cse1 (select |v_#memory_int_369| v_~q1~0.base_123))) (and |v_thread3_#t~short18#1_143| (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_85| (+ 1 (select .cse0 (+ v_~q2~0.offset_112 (* 4 v_~q2_back~0_163))))) (= |v_thread3Thread1of1ForFork2_~k~0#1_52| (select .cse0 (+ v_~q2~0.offset_112 (* v_~q2_front~0_141 4)))) (<= 0 v_~q3_back~0_141) (= |v_thread2Thread1of1ForFork1_~s~0#1_75| (+ |v_thread2Thread1of1ForFork1_~s~0#1_76| |v_thread2Thread1of1ForFork1_~j~0#1_85|)) (not (= (ite (and (< v_~q2_front~0_141 v_~q2_back~0_162) (<= 0 v_~q2_front~0_141) (< v_~q2_front~0_141 v_~n2~0_120)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_77| v_~N~0_81) (= (ite |v_thread3_#t~short18#1_144| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) |v_thread2_#t~short13#1_149| (= 2 (select .cse1 (+ (* v_~q1_back~0_207 4) v_~q1~0.offset_122))) (= (+ (select (select |v_#memory_int_369| v_~q3~0.base_98) (+ (* 4 v_~q3_back~0_141) v_~q3~0.offset_98)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_52|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= |v_thread3Thread1of1ForFork2_~t~0#1_54| (+ |v_thread3Thread1of1ForFork2_~t~0#1_55| |v_thread3Thread1of1ForFork2_~k~0#1_52|)) (= v_~q3_back~0_140 (+ v_~q3_back~0_141 1)) (= (+ v_~q2_back~0_163 1) v_~q2_back~0_162) (= (+ v_~q1_back~0_207 1) v_~q1_back~0_206) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| 0)) (= (+ v_~q1_front~0_146 1) v_~q1_front~0_145) (< v_~q1_back~0_207 v_~n1~0_108) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (< v_~q3_back~0_141 v_~n3~0_104) (= (ite |v_thread1_#t~short2#1_113| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) |v_thread1_#t~short2#1_114| (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_52| 0)) (= (+ v_~q2_front~0_141 1) v_~q2_front~0_140) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_85| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_85| (select .cse1 (+ v_~q1~0.offset_122 (* v_~q1_front~0_146 4)))) (not (= (ite (and (< v_~q1_front~0_146 v_~n1~0_108) (<= 0 v_~q1_front~0_146) (< v_~q1_front~0_146 v_~q1_back~0_206)) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (< v_~q2_back~0_163 v_~n2~0_120) (= (ite |v_thread2_#t~short13#1_150| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|))) InVars {~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_120, ~q1_front~0=v_~q1_front~0_146, ~n3~0=v_~n3~0_104, ~q2~0.offset=v_~q2~0.offset_112, ~n1~0=v_~n1~0_108, ~q2_front~0=v_~q2_front~0_141, ~N~0=v_~N~0_81, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_76|, ~q3~0.offset=v_~q3~0.offset_98, ~q3_back~0=v_~q3_back~0_141, ~q1_back~0=v_~q1_back~0_207, ~q1~0.base=v_~q1~0.base_123, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_369|, ~q3~0.base=v_~q3~0.base_98, ~q2~0.base=v_~q2~0.base_112, ~q2_back~0=v_~q2_back~0_163, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_55|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_38|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_28|, ~q1_front~0=v_~q1_front~0_145, ~n3~0=v_~n3~0_104, ~q2~0.offset=v_~q2~0.offset_112, ~n1~0=v_~n1~0_108, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_35|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_35|, ~q3_back~0=v_~q3_back~0_140, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_36|, ~q1_back~0=v_~q1_back~0_206, ~q1~0.base=v_~q1~0.base_123, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_70|, ~q3~0.base=v_~q3~0.base_98, ~q2~0.base=v_~q2~0.base_112, ~q2_back~0=v_~q2_back~0_162, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_52|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_33|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_85|, ~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_120, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_33|, ~q2_front~0=v_~q2_front~0_140, ~N~0=v_~N~0_81, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_35|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_75|, ~q3~0.offset=v_~q3~0.offset_98, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_38|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_50|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_28|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_369|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_30|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_54|} AuxVars[|v_thread3_#t~short18#1_144|, |v_thread3_#t~short18#1_143|, |v_thread2_#t~short13#1_150|, |v_thread1_#t~short2#1_113|, |v_thread1_#t~short2#1_114|, |v_thread2_#t~short13#1_149|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_front~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, ~q1_back~0, thread2Thread1of1ForFork1_#t~mem10#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread3Thread1of1ForFork2_~t~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 05:28:05,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L52-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= 2 (select (select |v_#memory_int_119| v_~q1~0.base_46) (+ v_~q1~0.offset_46 (* 4 v_~q1_back~0_91)))) (= (+ 1 v_~q1_back~0_91) v_~q1_back~0_90) (= (ite |v_thread1_#t~short2#1_49| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (< v_~q1_back~0_91 v_~n1~0_27) (< |v_thread1Thread1of1ForFork0_~i~0#1_19| v_~N~0_10) (<= 0 v_~q1_back~0_91) |v_thread1_#t~short2#1_50| (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~q1~0.offset=v_~q1~0.offset_46, ~q1_back~0=v_~q1_back~0_91, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~q1~0.offset=v_~q1~0.offset_46, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1_back~0=v_~q1_back~0_90, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_27, ~q1~0.base=v_~q1~0.base_46, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_19|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_119|, ~N~0=v_~N~0_10, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[|v_thread1_#t~short2#1_50|, |v_thread1_#t~short2#1_49|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] [2022-12-06 05:28:05,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_394| v_~q2~0.base_122))) (and |v_thread3_#t~short18#1_160| (= (ite |v_thread2_#t~short13#1_174| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite |v_thread3_#t~short18#1_159| 1 0)) (= (+ (select (select |v_#memory_int_394| v_~q3~0.base_106) (+ v_~q3~0.offset_106 (* 4 v_~q3_back~0_153))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_56|) |v_thread2_#t~short13#1_173| (= |v_thread3Thread1of1ForFork2_~t~0#1_62| (+ |v_thread3Thread1of1ForFork2_~t~0#1_63| |v_thread3Thread1of1ForFork2_~k~0#1_56|)) (not (= (ite (and (< v_~q2_front~0_154 v_~q2_back~0_179) (< v_~q2_front~0_154 v_~n2~0_130) (<= 0 v_~q2_front~0_154)) 1 0) 0)) (= (+ v_~q2_front~0_154 1) v_~q2_front~0_153) (= (+ v_~q2_back~0_180 1) v_~q2_back~0_179) (< v_~q3_back~0_153 v_~n3~0_112) (= (+ v_~q3_back~0_153 1) v_~q3_back~0_152) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (= |v_thread2Thread1of1ForFork1_~s~0#1_87| (+ |v_thread2Thread1of1ForFork1_~s~0#1_88| |v_thread2Thread1of1ForFork1_~j~0#1_93|)) (= |v_thread2Thread1of1ForFork1_~j~0#1_93| (+ (select .cse0 (+ v_~q2~0.offset_122 (* 4 v_~q2_back~0_180))) 1)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_56| 0)) (<= 0 v_~q3_back~0_153) (< v_~q2_back~0_180 v_~n2~0_130) (= (select .cse0 (+ v_~q2~0.offset_122 (* v_~q2_front~0_154 4))) |v_thread3Thread1of1ForFork2_~k~0#1_56|) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, ~q2_front~0=v_~q2_front~0_154, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_88|, ~q3~0.offset=v_~q3~0.offset_106, ~q3_back~0=v_~q3_back~0_153, #memory_int=|v_#memory_int_394|, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_63|, ~q2_back~0=v_~q2_back~0_180} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_44|, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_39|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_39|, ~q3_back~0=v_~q3_back~0_152, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, ~q2_back~0=v_~q2_back~0_179, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_56|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_37|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_37|, ~q2_front~0=v_~q2_front~0_153, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_39|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_87|, ~q3~0.offset=v_~q3~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_44|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_56|, #memory_int=|v_#memory_int_394|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_62|} AuxVars[|v_thread2_#t~short13#1_174|, |v_thread2_#t~short13#1_173|, |v_thread3_#t~short18#1_160|, |v_thread3_#t~short18#1_159|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1163] L56-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|) (= (+ |v_thread1Thread1of1ForFork0_~l~0#1_46| v_~r~0_112) v_~r~0_111) (= |v_thread1Thread1of1ForFork0_~l~0#1_46| (select (select |v_#memory_int_533| v_~q3~0.base_165) (+ v_~q3~0.offset_165 (* v_~q3_front~0_170 4)))) (= (ite |v_thread1_#t~short2#1_202| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (= |v_thread1Thread1of1ForFork0_~i~0#1_115| (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_115| v_~N~0_135) (<= 0 v_~q1_back~0_330) (= 2 (select (select |v_#memory_int_533| v_~q1~0.base_193) (+ v_~q1~0.offset_192 (* v_~q1_back~0_330 4)))) (= (+ v_~q1_back~0_330 1) v_~q1_back~0_329) |v_thread1_#t~short2#1_201| (= v_~q3_front~0_169 (+ v_~q3_front~0_170 1)) (< v_~q1_back~0_330 v_~n1~0_174) (not (= (ite (and (< v_~q3_front~0_170 v_~n3~0_154) (<= 0 v_~q3_front~0_170) (< v_~q3_front~0_170 v_~q3_back~0_239)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_192, ~n3~0=v_~n3~0_154, ~n1~0=v_~n1~0_174, ~N~0=v_~N~0_135, ~q3~0.offset=v_~q3~0.offset_165, ~q3_front~0=v_~q3_front~0_170, ~q3_back~0=v_~q3_back~0_239, ~q1_back~0=v_~q1_back~0_330, ~q1~0.base=v_~q1~0.base_193, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_533|, ~q3~0.base=v_~q3~0.base_165, ~r~0=v_~r~0_112} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_46|, ~q1~0.offset=v_~q1~0.offset_192, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_56|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_35|, ~n3~0=v_~n3~0_154, ~n1~0=v_~n1~0_174, ~N~0=v_~N~0_135, ~q3~0.offset=v_~q3~0.offset_165, ~q3_front~0=v_~q3_front~0_169, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, ~q3_back~0=v_~q3_back~0_239, ~q1_back~0=v_~q1_back~0_329, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_37|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_56|, ~q1~0.base=v_~q1~0.base_193, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_115|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, #memory_int=|v_#memory_int_533|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_35|, ~q3~0.base=v_~q3~0.base_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_58|, ~r~0=v_~r~0_111} AuxVars[|v_thread1_#t~short2#1_201|, |v_thread1_#t~short2#1_202|] AssignedVars[thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_#t~short2#1, thread1Thread1of1ForFork0_#t~mem4#1, ~q3_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem1#1, ~r~0] [2022-12-06 05:28:06,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_394| v_~q2~0.base_122))) (and |v_thread3_#t~short18#1_160| (= (ite |v_thread2_#t~short13#1_174| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite |v_thread3_#t~short18#1_159| 1 0)) (= (+ (select (select |v_#memory_int_394| v_~q3~0.base_106) (+ v_~q3~0.offset_106 (* 4 v_~q3_back~0_153))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_56|) |v_thread2_#t~short13#1_173| (= |v_thread3Thread1of1ForFork2_~t~0#1_62| (+ |v_thread3Thread1of1ForFork2_~t~0#1_63| |v_thread3Thread1of1ForFork2_~k~0#1_56|)) (not (= (ite (and (< v_~q2_front~0_154 v_~q2_back~0_179) (< v_~q2_front~0_154 v_~n2~0_130) (<= 0 v_~q2_front~0_154)) 1 0) 0)) (= (+ v_~q2_front~0_154 1) v_~q2_front~0_153) (= (+ v_~q2_back~0_180 1) v_~q2_back~0_179) (< v_~q3_back~0_153 v_~n3~0_112) (= (+ v_~q3_back~0_153 1) v_~q3_back~0_152) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (= |v_thread2Thread1of1ForFork1_~s~0#1_87| (+ |v_thread2Thread1of1ForFork1_~s~0#1_88| |v_thread2Thread1of1ForFork1_~j~0#1_93|)) (= |v_thread2Thread1of1ForFork1_~j~0#1_93| (+ (select .cse0 (+ v_~q2~0.offset_122 (* 4 v_~q2_back~0_180))) 1)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_56| 0)) (<= 0 v_~q3_back~0_153) (< v_~q2_back~0_180 v_~n2~0_130) (= (select .cse0 (+ v_~q2~0.offset_122 (* v_~q2_front~0_154 4))) |v_thread3Thread1of1ForFork2_~k~0#1_56|) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, ~q2_front~0=v_~q2_front~0_154, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_88|, ~q3~0.offset=v_~q3~0.offset_106, ~q3_back~0=v_~q3_back~0_153, #memory_int=|v_#memory_int_394|, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_63|, ~q2_back~0=v_~q2_back~0_180} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_44|, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_39|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_39|, ~q3_back~0=v_~q3_back~0_152, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, ~q2_back~0=v_~q2_back~0_179, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_56|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_37|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_37|, ~q2_front~0=v_~q2_front~0_153, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_39|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_87|, ~q3~0.offset=v_~q3~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_44|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_56|, #memory_int=|v_#memory_int_394|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_62|} AuxVars[|v_thread2_#t~short13#1_174|, |v_thread2_#t~short13#1_173|, |v_thread3_#t~short18#1_160|, |v_thread3_#t~short18#1_159|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 05:28:06,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_394| v_~q2~0.base_122))) (and |v_thread3_#t~short18#1_160| (= (ite |v_thread2_#t~short13#1_174| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43| (ite |v_thread3_#t~short18#1_159| 1 0)) (= (+ (select (select |v_#memory_int_394| v_~q3~0.base_106) (+ v_~q3~0.offset_106 (* 4 v_~q3_back~0_153))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_56|) |v_thread2_#t~short13#1_173| (= |v_thread3Thread1of1ForFork2_~t~0#1_62| (+ |v_thread3Thread1of1ForFork2_~t~0#1_63| |v_thread3Thread1of1ForFork2_~k~0#1_56|)) (not (= (ite (and (< v_~q2_front~0_154 v_~q2_back~0_179) (< v_~q2_front~0_154 v_~n2~0_130) (<= 0 v_~q2_front~0_154)) 1 0) 0)) (= (+ v_~q2_front~0_154 1) v_~q2_front~0_153) (= (+ v_~q2_back~0_180 1) v_~q2_back~0_179) (< v_~q3_back~0_153 v_~n3~0_112) (= (+ v_~q3_back~0_153 1) v_~q3_back~0_152) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|) (= |v_thread2Thread1of1ForFork1_~s~0#1_87| (+ |v_thread2Thread1of1ForFork1_~s~0#1_88| |v_thread2Thread1of1ForFork1_~j~0#1_93|)) (= |v_thread2Thread1of1ForFork1_~j~0#1_93| (+ (select .cse0 (+ v_~q2~0.offset_122 (* 4 v_~q2_back~0_180))) 1)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_56| 0)) (<= 0 v_~q3_back~0_153) (< v_~q2_back~0_180 v_~n2~0_130) (= (select .cse0 (+ v_~q2~0.offset_122 (* v_~q2_front~0_154 4))) |v_thread3Thread1of1ForFork2_~k~0#1_56|) (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0)))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, ~q2_front~0=v_~q2_front~0_154, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_88|, ~q3~0.offset=v_~q3~0.offset_106, ~q3_back~0=v_~q3_back~0_153, #memory_int=|v_#memory_int_394|, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_63|, ~q2_back~0=v_~q2_back~0_180} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_44|, ~n3~0=v_~n3~0_112, ~q2~0.offset=v_~q2~0.offset_122, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_39|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_39|, ~q3_back~0=v_~q3_back~0_152, ~q3~0.base=v_~q3~0.base_106, ~q2~0.base=v_~q2~0.base_122, ~q2_back~0=v_~q2_back~0_179, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_56|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_37|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_43|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~n2~0=v_~n2~0_130, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_37|, ~q2_front~0=v_~q2_front~0_153, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_39|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_87|, ~q3~0.offset=v_~q3~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_44|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_56|, #memory_int=|v_#memory_int_394|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_62|} AuxVars[|v_thread2_#t~short13#1_174|, |v_thread2_#t~short13#1_173|, |v_thread3_#t~short18#1_160|, |v_thread3_#t~short18#1_159|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, ~q2_back~0, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] and [1164] L56-->thread1EXIT: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_~l~0#1_48| v_~r~0_116) v_~r~0_115) (< v_~q1_back~0_334 v_~n1~0_176) (= |v_thread1Thread1of1ForFork0_~i~0#1_119| (+ |v_thread1Thread1of1ForFork0_~i~0#1_120| 1)) (= (select (select |v_#memory_int_535| v_~q1~0.base_195) (+ v_~q1~0.offset_194 (* v_~q1_back~0_334 4))) 0) (= v_~q3_front~0_173 (+ v_~q3_front~0_174 1)) (= (+ v_~q1_back~0_334 1) v_~q1_back~0_333) (not (= (ite (and (< v_~q3_front~0_174 v_~n3~0_156) (<= 0 v_~q3_front~0_174) (< v_~q3_front~0_174 v_~q3_back~0_241)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|) (<= 0 v_~q1_back~0_334) (= |v_thread1Thread1of1ForFork0_#res#1.offset_25| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| (ite |v_thread1_#t~short8#1_157| 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_25| 0) |v_thread1_#t~short8#1_158| (not (< |v_thread1Thread1of1ForFork0_~i~0#1_119| v_~N~0_137)) (= |v_thread1Thread1of1ForFork0_~l~0#1_48| (select (select |v_#memory_int_535| v_~q3~0.base_167) (+ v_~q3~0.offset_167 (* v_~q3_front~0_174 4))))) InVars {~q1~0.offset=v_~q1~0.offset_194, ~n3~0=v_~n3~0_156, ~n1~0=v_~n1~0_176, ~N~0=v_~N~0_137, ~q3~0.offset=v_~q3~0.offset_167, ~q3_front~0=v_~q3_front~0_174, ~q3_back~0=v_~q3_back~0_241, ~q1_back~0=v_~q1_back~0_334, ~q1~0.base=v_~q1~0.base_195, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_120|, #memory_int=|v_#memory_int_535|, ~q3~0.base=v_~q3~0.base_167, ~r~0=v_~r~0_116} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_48|, ~q1~0.offset=v_~q1~0.offset_194, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_25|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_37|, ~n3~0=v_~n3~0_156, ~n1~0=v_~n1~0_176, ~N~0=v_~N~0_137, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_31|, ~q3~0.offset=v_~q3~0.offset_167, ~q3_front~0=v_~q3_front~0_173, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, ~q3_back~0=v_~q3_back~0_241, ~q1_back~0=v_~q1_back~0_333, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_39|, ~q1~0.base=v_~q1~0.base_195, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_35|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, #memory_int=|v_#memory_int_535|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_37|, ~q3~0.base=v_~q3~0.base_167, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_31|, ~r~0=v_~r~0_115, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_25|} AuxVars[|v_thread1_#t~short8#1_158|, |v_thread1_#t~short8#1_157|] AssignedVars[thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~short8#1, ~q3_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~post9#1, ~r~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:28:18,540 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:28:18,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26833 [2022-12-06 05:28:18,540 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 219 transitions, 3571 flow [2022-12-06 05:28:18,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 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-12-06 05:28:18,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:18,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:18,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 05:28:18,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:18,741 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2113006273, now seen corresponding path program 1 times [2022-12-06 05:28:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:18,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680853531] [2022-12-06 05:28:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:28:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680853531] [2022-12-06 05:28:18,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680853531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:18,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:28:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553993310] [2022-12-06 05:28:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:18,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:28:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:28:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:28:18,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:28:18,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 219 transitions, 3571 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:18,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:18,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:28:18,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:20,384 INFO L130 PetriNetUnfolder]: 5133/8407 cut-off events. [2022-12-06 05:28:20,384 INFO L131 PetriNetUnfolder]: For 306515/306515 co-relation queries the response was YES. [2022-12-06 05:28:20,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69211 conditions, 8407 events. 5133/8407 cut-off events. For 306515/306515 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 52154 event pairs, 1234 based on Foata normal form. 300/8125 useless extension candidates. Maximal degree in co-relation 69139. Up to 7378 conditions per place. [2022-12-06 05:28:20,458 INFO L137 encePairwiseOnDemand]: 42/57 looper letters, 219 selfloop transitions, 28 changer transitions 2/249 dead transitions. [2022-12-06 05:28:20,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 249 transitions, 4387 flow [2022-12-06 05:28:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:28:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:28:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-06 05:28:20,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4152046783625731 [2022-12-06 05:28:20,459 INFO L175 Difference]: Start difference. First operand has 182 places, 219 transitions, 3571 flow. Second operand 3 states and 71 transitions. [2022-12-06 05:28:20,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 249 transitions, 4387 flow [2022-12-06 05:28:21,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 249 transitions, 4197 flow, removed 77 selfloop flow, removed 7 redundant places. [2022-12-06 05:28:21,364 INFO L231 Difference]: Finished difference. Result has 178 places, 224 transitions, 3506 flow [2022-12-06 05:28:21,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3309, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3506, PETRI_PLACES=178, PETRI_TRANSITIONS=224} [2022-12-06 05:28:21,364 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 144 predicate places. [2022-12-06 05:28:21,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:21,364 INFO L89 Accepts]: Start accepts. Operand has 178 places, 224 transitions, 3506 flow [2022-12-06 05:28:21,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:21,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:21,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 224 transitions, 3506 flow [2022-12-06 05:28:21,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 224 transitions, 3506 flow [2022-12-06 05:28:21,812 INFO L130 PetriNetUnfolder]: 1066/2596 cut-off events. [2022-12-06 05:28:21,813 INFO L131 PetriNetUnfolder]: For 74921/75409 co-relation queries the response was YES. [2022-12-06 05:28:21,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20926 conditions, 2596 events. 1066/2596 cut-off events. For 74921/75409 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20410 event pairs, 123 based on Foata normal form. 31/2239 useless extension candidates. Maximal degree in co-relation 20853. Up to 920 conditions per place. [2022-12-06 05:28:21,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 224 transitions, 3506 flow [2022-12-06 05:28:21,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-06 05:28:22,792 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:22,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1428 [2022-12-06 05:28:22,792 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 224 transitions, 3514 flow [2022-12-06 05:28:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:22,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:22,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:22,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:28:22,793 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1200269175, now seen corresponding path program 1 times [2022-12-06 05:28:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248175974] [2022-12-06 05:28:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248175974] [2022-12-06 05:28:23,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248175974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331519531] [2022-12-06 05:28:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:23,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:28:23,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 05:28:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:23,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:28:23,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:23,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 05:28:23,935 INFO L321 Elim1Store]: treesize reduction 3, result has 84.2 percent of original size [2022-12-06 05:28:23,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2022-12-06 05:28:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:24,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:24,148 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 05:28:24,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 124 [2022-12-06 05:28:24,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:28:24,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-06 05:28:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:25,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331519531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:28:25,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:28:25,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:28:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700628505] [2022-12-06 05:28:25,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:28:25,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:28:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:28:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:28:25,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 05:28:25,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 224 transitions, 3514 flow. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:25,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:25,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 05:28:25,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:28,359 INFO L130 PetriNetUnfolder]: 5028/8256 cut-off events. [2022-12-06 05:28:28,360 INFO L131 PetriNetUnfolder]: For 252293/252293 co-relation queries the response was YES. [2022-12-06 05:28:28,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68449 conditions, 8256 events. 5028/8256 cut-off events. For 252293/252293 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 51343 event pairs, 1215 based on Foata normal form. 8/7684 useless extension candidates. Maximal degree in co-relation 68372. Up to 7060 conditions per place. [2022-12-06 05:28:28,551 INFO L137 encePairwiseOnDemand]: 25/56 looper letters, 266 selfloop transitions, 71 changer transitions 37/374 dead transitions. [2022-12-06 05:28:28,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 374 transitions, 5762 flow [2022-12-06 05:28:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:28:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:28:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 204 transitions. [2022-12-06 05:28:28,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15178571428571427 [2022-12-06 05:28:28,567 INFO L175 Difference]: Start difference. First operand has 176 places, 224 transitions, 3514 flow. Second operand 24 states and 204 transitions. [2022-12-06 05:28:28,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 374 transitions, 5762 flow [2022-12-06 05:28:29,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 374 transitions, 5704 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:29,161 INFO L231 Difference]: Finished difference. Result has 208 places, 251 transitions, 4094 flow [2022-12-06 05:28:29,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4094, PETRI_PLACES=208, PETRI_TRANSITIONS=251} [2022-12-06 05:28:29,162 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 174 predicate places. [2022-12-06 05:28:29,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:29,163 INFO L89 Accepts]: Start accepts. Operand has 208 places, 251 transitions, 4094 flow [2022-12-06 05:28:29,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:29,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:29,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 251 transitions, 4094 flow [2022-12-06 05:28:29,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 251 transitions, 4094 flow [2022-12-06 05:28:29,684 INFO L130 PetriNetUnfolder]: 1043/2525 cut-off events. [2022-12-06 05:28:29,685 INFO L131 PetriNetUnfolder]: For 84838/85412 co-relation queries the response was YES. [2022-12-06 05:28:29,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21888 conditions, 2525 events. 1043/2525 cut-off events. For 84838/85412 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 19657 event pairs, 133 based on Foata normal form. 23/2168 useless extension candidates. Maximal degree in co-relation 21096. Up to 894 conditions per place. [2022-12-06 05:28:29,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 251 transitions, 4094 flow [2022-12-06 05:28:29,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-06 05:28:29,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1057] L81-->L76-2: Formula: (and (not (<= |v_thread2Thread1of1ForFork1_~j~0#1_43| 0)) (= (ite |v_thread2_#t~short13#1_63| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread2Thread1of1ForFork1_~s~0#1_27| (+ |v_thread2Thread1of1ForFork1_~s~0#1_28| |v_thread2Thread1of1ForFork1_~j~0#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q2_back~0_87 1) v_~q2_back~0_86) (< v_~q2_back~0_87 v_~n2~0_56) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_43| (+ (select (select |v_#memory_int_223| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_back~0_87 4))) 1)) |v_thread2_#t~short13#1_64| (<= 0 v_~q2_back~0_87)) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_223|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_28|, ~q2_back~0=v_~q2_back~0_87} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_43|, thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_65, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_13|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_21|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~q2~0.base=v_~q2~0.base_65, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_27|, ~q2_back~0=v_~q2_back~0_86} AuxVars[|v_thread2_#t~short13#1_64|, |v_thread2_#t~short13#1_63|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~s~0#1, ~q2_back~0] and [1053] L98-2-->L98-2: Formula: (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= (+ (select (select |v_#memory_int_217| v_~q3~0.base_57) (+ (* v_~q3_back~0_83 4) v_~q3~0.offset_57)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (= (ite |v_thread3_#t~short18#1_73| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= v_~q3_back~0_82 (+ v_~q3_back~0_83 1)) |v_thread3_#t~short18#1_74| (< v_~q3_back~0_83 v_~n3~0_52) (= (select (select |v_#memory_int_217| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* 4 v_~q2_front~0_89))) |v_thread3Thread1of1ForFork2_~k~0#1_35|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_80) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_48)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_35| 0)) (= (+ |v_thread3Thread1of1ForFork2_~t~0#1_24| |v_thread3Thread1of1ForFork2_~k~0#1_35|) |v_thread3Thread1of1ForFork2_~t~0#1_23|) (<= 0 v_~q3_back~0_83) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| 0))) InVars {~q3_back~0=v_~q3_back~0_83, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_24|, ~q3~0.offset=v_~q3~0.offset_57, ~q2_back~0=v_~q2_back~0_80} OutVars{thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, ~n2~0=v_~n2~0_48, ~n3~0=v_~n3~0_52, ~q2~0.offset=v_~q2~0.offset_61, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_17|, ~q2_front~0=v_~q2_front~0_88, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_19|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_19|, ~q3~0.offset=v_~q3~0.offset_57, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_19|, ~q3_back~0=v_~q3_back~0_82, #memory_int=|v_#memory_int_217|, ~q3~0.base=v_~q3~0.base_57, ~q2~0.base=v_~q2~0.base_61, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_23|, ~q2_back~0=v_~q2_back~0_80, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_35|} AuxVars[|v_thread3_#t~short18#1_73|, |v_thread3_#t~short18#1_74|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~short18#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem17#1, thread3Thread1of1ForFork2_#t~mem15#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1] [2022-12-06 05:28:30,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [960] L76-2-->L81: Formula: (and (= |v_thread2Thread1of1ForFork1_~j~0#1_25| (select (select |v_#memory_int_129| v_~q1~0.base_48) (+ v_~q1~0.offset_48 (* 4 v_~q1_front~0_39)))) (= (ite (and (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 v_~n1~0_29) (< v_~q1_front~0_39 v_~q1_back~0_94)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~q1_front~0_39 1) v_~q1_front~0_38) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~q1~0.offset=v_~q1~0.offset_48, ~q1_front~0=v_~q1_front~0_39, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, #memory_int=|v_#memory_int_129|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q1~0.offset=v_~q1~0.offset_48, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_25|, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_5|, ~q1_front~0=v_~q1_front~0_38, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_29, ~q1~0.base=v_~q1~0.base_48, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_5|, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#t~post11#1, ~q1_front~0, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] and [1043] L56-->L52-2: Formula: (and (= (+ 1 v_~q3_front~0_71) v_~q3_front~0_70) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~l~0#1_23| (select (select |v_#memory_int_201| v_~q3~0.base_49) (+ (* 4 v_~q3_front~0_71) v_~q3~0.offset_49))) (= v_~r~0_30 (+ v_~r~0_31 |v_thread1Thread1of1ForFork0_~l~0#1_23|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| (+ |v_thread1Thread1of1ForFork0_~i~0#1_34| 1)) (= (ite (and (<= 0 v_~q3_front~0_71) (< v_~q3_front~0_71 v_~n3~0_42) (< v_~q3_front~0_71 v_~q3_back~0_70)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~q3_front~0=v_~q3_front~0_71, ~q3_back~0=v_~q3_back~0_70, ~n3~0=v_~n3~0_42, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_34|, #memory_int=|v_#memory_int_201|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_31, ~q3~0.offset=v_~q3~0.offset_49} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_15|, ~n3~0=v_~n3~0_42, ~q3~0.offset=v_~q3~0.offset_49, ~q3_front~0=v_~q3_front~0_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~q3_back~0=v_~q3_back~0_70, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_15|, #memory_int=|v_#memory_int_201|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~q3~0.base=v_~q3~0.base_49, ~r~0=v_~r~0_30} AuxVars[] AssignedVars[~q3_front~0, thread1Thread1of1ForFork0_~l~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~r~0] [2022-12-06 05:28:30,224 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:28:30,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1065 [2022-12-06 05:28:30,228 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 250 transitions, 4120 flow [2022-12-06 05:28:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:30,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:30,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:30,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 05:28:30,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:28:30,434 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2032042851, now seen corresponding path program 1 times [2022-12-06 05:28:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:30,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354500103] [2022-12-06 05:28:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:31,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354500103] [2022-12-06 05:28:31,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354500103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:28:31,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934723776] [2022-12-06 05:28:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:31,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:28:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:31,452 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:28:31,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 05:28:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:31,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 05:28:31,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:28:31,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 622 [2022-12-06 05:28:31,992 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 05:28:31,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-12-06 05:28:32,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-06 05:28:32,110 INFO L321 Elim1Store]: treesize reduction 3, result has 85.7 percent of original size [2022-12-06 05:28:32,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2022-12-06 05:28:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:32,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:28:32,696 INFO L321 Elim1Store]: treesize reduction 34, result has 92.8 percent of original size [2022-12-06 05:28:32,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 391 treesize of output 711 [2022-12-06 05:28:32,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:28:32,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 270 [2022-12-06 05:28:32,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:28:32,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 234 Received shutdown request... [2022-12-06 05:38:37,742 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:38:37,744 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:38:37,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 05:38:37,757 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:38:37,758 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:38:37,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:37,951 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 12ms.. [2022-12-06 05:38:37,952 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:38:37,952 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:38:37,952 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:38:37,952 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:37,955 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:38:37,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:38:37,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:38:37 BasicIcfg [2022-12-06 05:38:37,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:38:37,957 INFO L158 Benchmark]: Toolchain (without parser) took 840762.93ms. Allocated memory was 173.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 151.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-06 05:38:37,957 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:38:37,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.54ms. Allocated memory is still 173.0MB. Free memory was 150.8MB in the beginning and 136.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 05:38:37,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.71ms. Allocated memory is still 173.0MB. Free memory was 136.5MB in the beginning and 134.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:38:37,957 INFO L158 Benchmark]: Boogie Preprocessor took 47.66ms. Allocated memory is still 173.0MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:38:37,958 INFO L158 Benchmark]: RCFGBuilder took 699.10ms. Allocated memory is still 173.0MB. Free memory was 132.0MB in the beginning and 91.1MB in the end (delta: 40.9MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 05:38:37,958 INFO L158 Benchmark]: TraceAbstraction took 839689.11ms. Allocated memory was 173.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 987.3MB. Max. memory is 8.0GB. [2022-12-06 05:38:37,958 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.54ms. Allocated memory is still 173.0MB. Free memory was 150.8MB in the beginning and 136.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.71ms. Allocated memory is still 173.0MB. Free memory was 136.5MB in the beginning and 134.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.66ms. Allocated memory is still 173.0MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 699.10ms. Allocated memory is still 173.0MB. Free memory was 132.0MB in the beginning and 91.1MB in the end (delta: 40.9MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 839689.11ms. Allocated memory was 173.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 987.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 220 PlacesBefore, 34 PlacesAfterwards, 232 TransitionsBefore, 31 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 35 ConcurrentYvCompositions, 14 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 1198, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1222, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1108, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1108, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1222, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1108, unknown conditional: 0, unknown unconditional: 1108] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1822, Positive conditional cache size: 0, Positive unconditional cache size: 1822, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 34 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 54 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 66 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 60 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 32, Positive conditional cache size: 15, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 63 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 35, Positive conditional cache size: 18, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 69 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 80 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 81 PlacesBefore, 81 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 21, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.5s, 192 PlacesBefore, 185 PlacesAfterwards, 220 TransitionsBefore, 212 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 62, Positive conditional cache size: 45, Positive unconditional cache size: 17, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.3s, 184 PlacesBefore, 182 PlacesAfterwards, 221 TransitionsBefore, 219 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 69, Positive conditional cache size: 50, Positive unconditional cache size: 19, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 176 PlacesBefore, 176 PlacesAfterwards, 224 TransitionsBefore, 224 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 69, Positive conditional cache size: 50, Positive unconditional cache size: 19, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 205 PlacesBefore, 204 PlacesAfterwards, 251 TransitionsBefore, 250 TransitionsAfterwards, 1162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 70, Positive conditional cache size: 51, Positive unconditional cache size: 19, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 12ms.. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 12ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 12ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 12ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 261 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 839.5s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 93.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2666 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2666 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 795 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6281 IncrementalHoareTripleChecker+Invalid, 7082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 795 mSolverCounterUnsat, 0 mSDtfsCounter, 6281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 394 SyntacticMatches, 4 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 71.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4120occurred in iteration=23, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 964 ConstructedInterpolants, 26 QuantifiedInterpolants, 18277 SizeOfPredicates, 173 NumberOfNonLiveVariables, 6757 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 27/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown