/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-RepeatedSemanticLbe.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 00:09:46,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:09:46,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:09:46,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:09:46,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:09:46,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:09:46,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:09:46,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:09:46,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:09:46,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:09:46,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:09:46,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:09:46,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:09:46,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:09:46,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:09:46,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:09:46,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:09:46,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:09:46,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:09:46,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:09:46,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:09:46,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:09:46,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:09:46,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:09:46,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:09:46,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:09:46,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:09:46,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:09:46,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:09:46,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:09:46,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:09:46,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:09:46,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:09:46,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:09:46,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:09:46,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:09:46,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:09:46,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:09:46,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:09:46,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:09:46,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:09:46,445 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-RepeatedSemanticLbe.epf [2022-12-06 00:09:46,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:09:46,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:09:46,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:09:46,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:09:46,481 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:09:46,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:09:46,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:09:46,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:09:46,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:09:46,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:09:46,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:09:46,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:09:46,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:09:46,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:09:46,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:09:46,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:09:46,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:09:46,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:09:46,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:09:46,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:09:46,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:09:46,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:09:46,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:09:46,486 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 00:09:46,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:09:46,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:09:46,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:09:46,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:09:46,824 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:09:46,825 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 00:09:47,906 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:09:48,152 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:09:48,152 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2022-12-06 00:09:48,160 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7370fa9d/8ea20840f7eb422f80bc8f5bdb012755/FLAGbc2b589dd [2022-12-06 00:09:48,172 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7370fa9d/8ea20840f7eb422f80bc8f5bdb012755 [2022-12-06 00:09:48,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:09:48,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:09:48,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:09:48,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:09:48,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:09:48,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27562769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48, skipping insertion in model container [2022-12-06 00:09:48,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:09:48,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:09:48,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,376 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 00:09:48,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:09:48,401 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:09:48,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:09:48,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:09:48,439 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 00:09:48,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:09:48,464 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:09:48,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48 WrapperNode [2022-12-06 00:09:48,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:09:48,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:09:48,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:09:48,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:09:48,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,535 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-12-06 00:09:48,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:09:48,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:09:48,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:09:48,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:09:48,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:09:48,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:09:48,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:09:48,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:09:48,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (1/1) ... [2022-12-06 00:09:48,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:09:48,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:09:48,633 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 00:09:48,659 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 00:09:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:09:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:09:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:09:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:09:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:09:48,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:09:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:09:48,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:09:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:09:48,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:09:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:09:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:09:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:09:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:09:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:09:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:09:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:09:48,685 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 00:09:48,864 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:09:48,865 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:09:49,363 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:09:49,549 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:09:49,549 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 00:09:49,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:09:49 BoogieIcfgContainer [2022-12-06 00:09:49,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:09:49,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:09:49,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:09:49,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:09:49,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:09:48" (1/3) ... [2022-12-06 00:09:49,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2590b7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:09:49, skipping insertion in model container [2022-12-06 00:09:49,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:09:48" (2/3) ... [2022-12-06 00:09:49,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2590b7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:09:49, skipping insertion in model container [2022-12-06 00:09:49,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:09:49" (3/3) ... [2022-12-06 00:09:49,572 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-12-06 00:09:49,590 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:09:49,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:09:49,603 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:09:49,693 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:09:49,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 00:09:49,881 INFO L130 PetriNetUnfolder]: 22/242 cut-off events. [2022-12-06 00:09:49,881 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:49,888 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 00:09:49,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-12-06 00:09:49,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 232 transitions, 482 flow [2022-12-06 00:09:49,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:49,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 00:09:49,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 232 transitions, 482 flow [2022-12-06 00:09:49,973 INFO L130 PetriNetUnfolder]: 22/232 cut-off events. [2022-12-06 00:09:49,974 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:09:49,975 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 00:09:49,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 232 transitions, 482 flow [2022-12-06 00:09:49,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-06 00:09:59,982 INFO L203 LiptonReduction]: Total number of compositions: 200 [2022-12-06 00:10:00,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:10:00,013 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;@2c3cc78c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:10:00,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:10:00,023 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-06 00:10:00,023 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:10:00,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:00,024 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 00:10:00,025 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 00:10:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash -32754915, now seen corresponding path program 1 times [2022-12-06 00:10:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:00,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154148437] [2022-12-06 00:10:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:00,452 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 00:10:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154148437] [2022-12-06 00:10:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154148437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:00,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:00,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:10:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966791290] [2022-12-06 00:10:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:10:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:10:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:10:00,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:10:00,481 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 00:10:00,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:00,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:10:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:00,655 INFO L130 PetriNetUnfolder]: 472/690 cut-off events. [2022-12-06 00:10:00,656 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 00:10:00,658 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 00:10:00,662 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 00:10:00,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 196 flow [2022-12-06 00:10:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:10:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:10:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 00:10:00,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-06 00:10:00,674 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 3 states and 47 transitions. [2022-12-06 00:10:00,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 196 flow [2022-12-06 00:10:00,677 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 00:10:00,679 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,681 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 00:10:00,684 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 00:10:00,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:00,685 INFO L89 Accepts]: Start accepts. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:00,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:00,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,696 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-06 00:10:00,697 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:10:00,697 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 00:10:00,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:10:00,716 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:00,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 00:10:00,718 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 87 flow [2022-12-06 00:10:00,718 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 00:10:00,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:00,718 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 00:10:00,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:10:00,718 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 00:10:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2034944899, now seen corresponding path program 1 times [2022-12-06 00:10:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:00,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535322623] [2022-12-06 00:10:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:00,901 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 00:10:00,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:00,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535322623] [2022-12-06 00:10:00,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535322623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:00,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:00,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:10:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404493926] [2022-12-06 00:10:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:00,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:00,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:00,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:00,906 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 00:10:00,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:00,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:00,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:01,095 INFO L130 PetriNetUnfolder]: 529/810 cut-off events. [2022-12-06 00:10:01,095 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 00:10:01,098 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 00:10:01,101 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 31 selfloop transitions, 2 changer transitions 27/60 dead transitions. [2022-12-06 00:10:01,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 269 flow [2022-12-06 00:10:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 00:10:01,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-06 00:10:01,104 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 87 flow. Second operand 5 states and 64 transitions. [2022-12-06 00:10:01,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 60 transitions, 269 flow [2022-12-06 00:10:01,106 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 00:10:01,107 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 114 flow [2022-12-06 00:10:01,107 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 00:10:01,108 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 00:10:01,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:01,108 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 114 flow [2022-12-06 00:10:01,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:01,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:01,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 114 flow [2022-12-06 00:10:01,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 114 flow [2022-12-06 00:10:01,120 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 00:10:01,120 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-06 00:10:01,120 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 00:10:01,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 114 flow [2022-12-06 00:10:01,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 00:10:02,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:02,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1557 [2022-12-06 00:10:02,666 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 110 flow [2022-12-06 00:10:02,666 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 00:10:02,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:02,666 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 00:10:02,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:10:02,667 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 00:10:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 602269161, now seen corresponding path program 1 times [2022-12-06 00:10:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:02,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128789414] [2022-12-06 00:10:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:02,854 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 00:10:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128789414] [2022-12-06 00:10:02,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128789414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:02,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:02,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493260910] [2022-12-06 00:10:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:02,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:02,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:02,862 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 00:10:02,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:02,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:03,079 INFO L130 PetriNetUnfolder]: 759/1166 cut-off events. [2022-12-06 00:10:03,079 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-06 00:10:03,081 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 00:10:03,084 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 35/68 dead transitions. [2022-12-06 00:10:03,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 358 flow [2022-12-06 00:10:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 00:10:03,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 00:10:03,086 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 110 flow. Second operand 5 states and 70 transitions. [2022-12-06 00:10:03,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 358 flow [2022-12-06 00:10:03,087 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 00:10:03,088 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2022-12-06 00:10:03,088 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 00:10:03,089 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 00:10:03,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:03,089 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 118 flow [2022-12-06 00:10:03,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:03,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:03,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 118 flow [2022-12-06 00:10:03,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 118 flow [2022-12-06 00:10:03,099 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 00:10:03,100 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 00:10:03,100 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 00:10:03,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 118 flow [2022-12-06 00:10:03,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 00:10:03,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:03,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 00:10:03,387 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 114 flow [2022-12-06 00:10:03,387 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 00:10:03,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:03,387 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 00:10:03,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:10:03,388 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 00:10:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1216932410, now seen corresponding path program 1 times [2022-12-06 00:10:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:03,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440577534] [2022-12-06 00:10:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,504 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 00:10:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:03,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440577534] [2022-12-06 00:10:03,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440577534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:03,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:03,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546037063] [2022-12-06 00:10:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:03,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:03,507 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 00:10:03,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:03,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:03,711 INFO L130 PetriNetUnfolder]: 797/1197 cut-off events. [2022-12-06 00:10:03,711 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 00:10:03,713 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 00:10:03,717 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 2 changer transitions 21/54 dead transitions. [2022-12-06 00:10:03,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 301 flow [2022-12-06 00:10:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 00:10:03,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 00:10:03,719 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 114 flow. Second operand 4 states and 53 transitions. [2022-12-06 00:10:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 301 flow [2022-12-06 00:10:03,721 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 00:10:03,722 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 108 flow [2022-12-06 00:10:03,722 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 00:10:03,723 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 00:10:03,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:03,723 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 108 flow [2022-12-06 00:10:03,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:03,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:03,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 108 flow [2022-12-06 00:10:03,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 108 flow [2022-12-06 00:10:03,735 INFO L130 PetriNetUnfolder]: 38/84 cut-off events. [2022-12-06 00:10:03,735 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 00:10:03,735 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 00:10:03,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 108 flow [2022-12-06 00:10:03,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 00:10:04,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:04,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 00:10:04,007 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 104 flow [2022-12-06 00:10:04,008 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 00:10:04,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:04,008 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 00:10:04,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:10:04,008 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 00:10:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash -582879671, now seen corresponding path program 1 times [2022-12-06 00:10:04,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:04,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073584229] [2022-12-06 00:10:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:04,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:04,164 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 00:10:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073584229] [2022-12-06 00:10:04,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073584229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:04,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:04,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:10:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383924880] [2022-12-06 00:10:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:04,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:10:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:10:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:10:04,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:04,166 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 00:10:04,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:04,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:04,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:04,344 INFO L130 PetriNetUnfolder]: 839/1226 cut-off events. [2022-12-06 00:10:04,344 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-06 00:10:04,346 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 00:10:04,351 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 46 selfloop transitions, 2 changer transitions 6/54 dead transitions. [2022-12-06 00:10:04,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 285 flow [2022-12-06 00:10:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:10:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:10:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 00:10:04,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 00:10:04,353 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-06 00:10:04,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 285 flow [2022-12-06 00:10:04,354 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 00:10:04,355 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,355 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 00:10:04,356 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 00:10:04,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:04,356 INFO L89 Accepts]: Start accepts. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:04,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:04,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,370 INFO L130 PetriNetUnfolder]: 46/107 cut-off events. [2022-12-06 00:10:04,370 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-06 00:10:04,371 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 00:10:04,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 00:10:04,372 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:04,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:10:04,373 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 110 flow [2022-12-06 00:10:04,374 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 00:10:04,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:04,374 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 00:10:04,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:10:04,374 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 00:10:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 971652712, now seen corresponding path program 1 times [2022-12-06 00:10:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:04,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332534253] [2022-12-06 00:10:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:04,502 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 00:10:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332534253] [2022-12-06 00:10:04,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332534253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:04,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902114260] [2022-12-06 00:10:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:04,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:04,507 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 00:10:04,527 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 00:10:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:04,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:10:04,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:04,785 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 00:10:04,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:04,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902114260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:04,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:04,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 00:10:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284010477] [2022-12-06 00:10:04,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:04,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:10:04,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:04,787 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 00:10:04,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:04,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:04,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:05,226 INFO L130 PetriNetUnfolder]: 1774/2682 cut-off events. [2022-12-06 00:10:05,226 INFO L131 PetriNetUnfolder]: For 1111/1111 co-relation queries the response was YES. [2022-12-06 00:10:05,230 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 00:10:05,237 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 32 selfloop transitions, 2 changer transitions 75/109 dead transitions. [2022-12-06 00:10:05,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 109 transitions, 554 flow [2022-12-06 00:10:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:10:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:10:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 00:10:05,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 00:10:05,240 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 110 flow. Second operand 7 states and 106 transitions. [2022-12-06 00:10:05,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 109 transitions, 554 flow [2022-12-06 00:10:05,244 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 00:10:05,246 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 146 flow [2022-12-06 00:10:05,246 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 00:10:05,248 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 00:10:05,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:05,249 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 146 flow [2022-12-06 00:10:05,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:05,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:05,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 146 flow [2022-12-06 00:10:05,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 146 flow [2022-12-06 00:10:05,268 INFO L130 PetriNetUnfolder]: 46/108 cut-off events. [2022-12-06 00:10:05,268 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-06 00:10:05,269 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 00:10:05,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 146 flow [2022-12-06 00:10:05,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 00:10:07,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:07,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1990 [2022-12-06 00:10:07,239 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 142 flow [2022-12-06 00:10:07,239 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 00:10:07,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:07,239 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 00:10:07,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:10:07,443 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 00:10:07,444 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 00:10:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -651039405, now seen corresponding path program 1 times [2022-12-06 00:10:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681180898] [2022-12-06 00:10:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:07,677 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 00:10:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681180898] [2022-12-06 00:10:07,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681180898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:10:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109775022] [2022-12-06 00:10:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:10:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:10:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:10:07,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:07,679 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 00:10:07,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:07,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:07,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:07,845 INFO L130 PetriNetUnfolder]: 658/961 cut-off events. [2022-12-06 00:10:07,845 INFO L131 PetriNetUnfolder]: For 1575/1575 co-relation queries the response was YES. [2022-12-06 00:10:07,847 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 00:10:07,850 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2022-12-06 00:10:07,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 300 flow [2022-12-06 00:10:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:10:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:10:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 00:10:07,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 00:10:07,852 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 142 flow. Second operand 3 states and 44 transitions. [2022-12-06 00:10:07,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 300 flow [2022-12-06 00:10:07,856 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 00:10:07,857 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,858 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 00:10:07,858 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 00:10:07,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:07,858 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:07,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:07,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,872 INFO L130 PetriNetUnfolder]: 33/105 cut-off events. [2022-12-06 00:10:07,872 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-12-06 00:10:07,873 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 00:10:07,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 00:10:07,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:07,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:10:07,877 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 141 flow [2022-12-06 00:10:07,877 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 00:10:07,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:07,877 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 00:10:07,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:10:07,877 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 00:10:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -965008021, now seen corresponding path program 2 times [2022-12-06 00:10:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:07,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463751750] [2022-12-06 00:10:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:08,762 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 00:10:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:08,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463751750] [2022-12-06 00:10:08,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463751750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:08,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505063388] [2022-12-06 00:10:08,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:10:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:08,765 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 00:10:08,787 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 00:10:08,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:10:08,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:10:08,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 00:10:08,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:09,072 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 00:10:09,095 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 00:10:09,110 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 00:10:09,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:09,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505063388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:09,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:09,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-12-06 00:10:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985606545] [2022-12-06 00:10:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:09,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:10:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:10:09,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:10:09,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:10:09,113 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 00:10:09,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:09,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:10:09,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:09,341 INFO L130 PetriNetUnfolder]: 494/770 cut-off events. [2022-12-06 00:10:09,342 INFO L131 PetriNetUnfolder]: For 638/638 co-relation queries the response was YES. [2022-12-06 00:10:09,343 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 00:10:09,346 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 60 selfloop transitions, 6 changer transitions 2/68 dead transitions. [2022-12-06 00:10:09,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 411 flow [2022-12-06 00:10:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:10:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:10:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 00:10:09,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 00:10:09,347 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 141 flow. Second operand 7 states and 62 transitions. [2022-12-06 00:10:09,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 411 flow [2022-12-06 00:10:09,348 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 00:10:09,349 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 171 flow [2022-12-06 00:10:09,349 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 00:10:09,350 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 00:10:09,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:09,350 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 00:10:09,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:09,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:09,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 00:10:09,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 171 flow [2022-12-06 00:10:09,365 INFO L130 PetriNetUnfolder]: 44/118 cut-off events. [2022-12-06 00:10:09,365 INFO L131 PetriNetUnfolder]: For 60/61 co-relation queries the response was YES. [2022-12-06 00:10:09,365 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 00:10:09,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 171 flow [2022-12-06 00:10:09,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 00:10:09,375 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 00:10:09,559 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 00:10:09,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:09,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-06 00:10:09,653 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 173 flow [2022-12-06 00:10:09,653 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 00:10:09,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:09,653 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 00:10:09,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:09,853 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 00:10:09,854 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 00:10:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1991254802, now seen corresponding path program 1 times [2022-12-06 00:10:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:09,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251917256] [2022-12-06 00:10:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:10,469 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 00:10:10,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:10,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251917256] [2022-12-06 00:10:10,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251917256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:10,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242018755] [2022-12-06 00:10:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:10,472 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 00:10:10,504 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 00:10:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:10,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 00:10:10,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:10,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:10,711 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 00:10:10,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:10,741 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 00:10:10,758 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 00:10:10,772 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 00:10:10,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:10,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242018755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:10,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:10,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-06 00:10:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155230418] [2022-12-06 00:10:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:10:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:10,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:10:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:10:10,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:10:10,774 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 00:10:10,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:10,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:10:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:11,084 INFO L130 PetriNetUnfolder]: 407/628 cut-off events. [2022-12-06 00:10:11,084 INFO L131 PetriNetUnfolder]: For 778/778 co-relation queries the response was YES. [2022-12-06 00:10:11,086 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 00:10:11,089 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 75 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2022-12-06 00:10:11,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 553 flow [2022-12-06 00:10:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:10:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:10:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-12-06 00:10:11,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2673611111111111 [2022-12-06 00:10:11,091 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 173 flow. Second operand 9 states and 77 transitions. [2022-12-06 00:10:11,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 553 flow [2022-12-06 00:10:11,092 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 00:10:11,094 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,094 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 00:10:11,094 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 00:10:11,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:11,095 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:11,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:11,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,125 INFO L130 PetriNetUnfolder]: 64/153 cut-off events. [2022-12-06 00:10:11,125 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-06 00:10:11,125 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 00:10:11,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 00:10:11,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:11,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 00:10:11,128 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 216 flow [2022-12-06 00:10:11,128 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 00:10:11,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:11,128 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 00:10:11,138 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 00:10:11,335 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 00:10:11,335 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 00:10:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash -927655443, now seen corresponding path program 1 times [2022-12-06 00:10:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:11,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956007856] [2022-12-06 00:10:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:11,459 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 00:10:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956007856] [2022-12-06 00:10:11,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956007856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:11,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371642930] [2022-12-06 00:10:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:11,461 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 00:10:11,464 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 00:10:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:11,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:10:11,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:11,666 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 00:10:11,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:11,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371642930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:11,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:11,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 00:10:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690661921] [2022-12-06 00:10:11,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:11,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:11,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:11,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:10:11,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:10:11,668 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 00:10:11,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:11,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:10:11,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:11,983 INFO L130 PetriNetUnfolder]: 892/1436 cut-off events. [2022-12-06 00:10:11,983 INFO L131 PetriNetUnfolder]: For 2609/2609 co-relation queries the response was YES. [2022-12-06 00:10:11,986 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 00:10:11,990 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 41 selfloop transitions, 2 changer transitions 69/112 dead transitions. [2022-12-06 00:10:11,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 794 flow [2022-12-06 00:10:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:10:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:10:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-06 00:10:11,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 00:10:11,992 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 216 flow. Second operand 7 states and 92 transitions. [2022-12-06 00:10:11,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 794 flow [2022-12-06 00:10:11,996 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 00:10:11,997 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 222 flow [2022-12-06 00:10:11,997 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 00:10:11,998 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-06 00:10:11,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:11,998 INFO L89 Accepts]: Start accepts. Operand has 58 places, 43 transitions, 222 flow [2022-12-06 00:10:12,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:12,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:12,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 43 transitions, 222 flow [2022-12-06 00:10:12,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 222 flow [2022-12-06 00:10:12,020 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-06 00:10:12,020 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 00:10:12,021 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 00:10:12,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 222 flow [2022-12-06 00:10:12,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 00:10:12,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:12,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-06 00:10:12,385 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 218 flow [2022-12-06 00:10:12,385 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 00:10:12,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:12,385 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 00:10:12,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:12,590 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 00:10:12,591 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 00:10:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 990816050, now seen corresponding path program 1 times [2022-12-06 00:10:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:12,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737844319] [2022-12-06 00:10:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,179 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 00:10:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737844319] [2022-12-06 00:10:13,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737844319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:13,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255924509] [2022-12-06 00:10:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:13,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:13,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:13,181 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 00:10:13,184 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 00:10:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 00:10:13,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:13,648 INFO L321 Elim1Store]: treesize reduction 7, result has 86.8 percent of original size [2022-12-06 00:10:13,649 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 00:10:13,695 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 00:10:13,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:13,859 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-06 00:10:13,859 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 00:10:14,233 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 00:10:14,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255924509] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:14,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:10:14,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 19 [2022-12-06 00:10:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653902052] [2022-12-06 00:10:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:14,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:10:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:10:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:10:14,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:10:14,238 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 00:10:14,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:14,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:10:14,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:14,849 INFO L130 PetriNetUnfolder]: 933/1457 cut-off events. [2022-12-06 00:10:14,850 INFO L131 PetriNetUnfolder]: For 2824/2824 co-relation queries the response was YES. [2022-12-06 00:10:14,854 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 00:10:14,862 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 106 selfloop transitions, 24 changer transitions 6/136 dead transitions. [2022-12-06 00:10:14,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 915 flow [2022-12-06 00:10:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:10:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:10:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-12-06 00:10:14,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2022-12-06 00:10:14,864 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 218 flow. Second operand 12 states and 116 transitions. [2022-12-06 00:10:14,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 915 flow [2022-12-06 00:10:14,873 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 00:10:14,875 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 446 flow [2022-12-06 00:10:14,875 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 00:10:14,877 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-06 00:10:14,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:14,877 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 446 flow [2022-12-06 00:10:14,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:14,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:14,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 446 flow [2022-12-06 00:10:14,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 446 flow [2022-12-06 00:10:14,927 INFO L130 PetriNetUnfolder]: 171/400 cut-off events. [2022-12-06 00:10:14,928 INFO L131 PetriNetUnfolder]: For 779/807 co-relation queries the response was YES. [2022-12-06 00:10:14,930 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 00:10:14,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 446 flow [2022-12-06 00:10:14,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 00:10:14,944 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 00:10:15,072 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 00:10:15,431 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 00:10:15,535 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 00:10:15,908 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 00:10:21,270 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 00:10:21,766 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:10:21,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6890 [2022-12-06 00:10:21,767 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 492 flow [2022-12-06 00:10:21,767 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 00:10:21,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:21,767 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 00:10:21,773 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 00:10:21,968 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 00:10:21,968 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 00:10:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1776517051, now seen corresponding path program 1 times [2022-12-06 00:10:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618174633] [2022-12-06 00:10:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:22,639 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 00:10:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:22,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618174633] [2022-12-06 00:10:22,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618174633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414665924] [2022-12-06 00:10:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:22,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:22,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:22,641 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 00:10:22,644 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 00:10:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:22,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 00:10:22,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:22,877 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 00:10:22,916 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 00:10:22,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:22,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414665924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:22,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:22,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 00:10:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317009395] [2022-12-06 00:10:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:22,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:10:22,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:22,918 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 00:10:22,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:22,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:23,295 INFO L130 PetriNetUnfolder]: 929/1442 cut-off events. [2022-12-06 00:10:23,295 INFO L131 PetriNetUnfolder]: For 3840/3840 co-relation queries the response was YES. [2022-12-06 00:10:23,300 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 00:10:23,317 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 103 selfloop transitions, 13 changer transitions 1/117 dead transitions. [2022-12-06 00:10:23,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 117 transitions, 1022 flow [2022-12-06 00:10:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:10:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:10:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-06 00:10:23,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2022-12-06 00:10:23,318 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 492 flow. Second operand 7 states and 96 transitions. [2022-12-06 00:10:23,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 117 transitions, 1022 flow [2022-12-06 00:10:23,326 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 00:10:23,330 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 531 flow [2022-12-06 00:10:23,330 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 00:10:23,332 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 00:10:23,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:23,332 INFO L89 Accepts]: Start accepts. Operand has 65 places, 65 transitions, 531 flow [2022-12-06 00:10:23,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:23,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:23,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 65 transitions, 531 flow [2022-12-06 00:10:23,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 531 flow [2022-12-06 00:10:23,384 INFO L130 PetriNetUnfolder]: 206/442 cut-off events. [2022-12-06 00:10:23,384 INFO L131 PetriNetUnfolder]: For 1124/1133 co-relation queries the response was YES. [2022-12-06 00:10:23,386 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 00:10:23,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 531 flow [2022-12-06 00:10:23,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 00:10:23,399 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 00:10:23,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:23,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-06 00:10:23,760 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 527 flow [2022-12-06 00:10:23,760 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 00:10:23,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:23,760 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 00:10:23,767 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 00:10:23,961 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 00:10:23,961 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 00:10:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -208767707, now seen corresponding path program 1 times [2022-12-06 00:10:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907195721] [2022-12-06 00:10:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:25,412 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 00:10:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907195721] [2022-12-06 00:10:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907195721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291184181] [2022-12-06 00:10:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:25,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:25,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:25,416 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 00:10:25,418 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 00:10:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:25,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:10:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:25,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:25,778 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:10:25,779 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 00:10:25,796 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 00:10:25,867 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 00:10:25,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291184181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:25,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:25,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 00:10:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49825309] [2022-12-06 00:10:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:10:25,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:10:25,869 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 00:10:25,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:25,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:10:25,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:26,326 INFO L130 PetriNetUnfolder]: 1445/2244 cut-off events. [2022-12-06 00:10:26,327 INFO L131 PetriNetUnfolder]: For 7644/7644 co-relation queries the response was YES. [2022-12-06 00:10:26,333 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 00:10:26,346 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 116 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2022-12-06 00:10:26,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 1228 flow [2022-12-06 00:10:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:10:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:10:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 00:10:26,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-06 00:10:26,347 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 527 flow. Second operand 6 states and 87 transitions. [2022-12-06 00:10:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 1228 flow [2022-12-06 00:10:26,359 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 00:10:26,361 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 675 flow [2022-12-06 00:10:26,361 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 00:10:26,362 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-06 00:10:26,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:26,363 INFO L89 Accepts]: Start accepts. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 00:10:26,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:26,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:26,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 00:10:26,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 675 flow [2022-12-06 00:10:26,459 INFO L130 PetriNetUnfolder]: 323/695 cut-off events. [2022-12-06 00:10:26,459 INFO L131 PetriNetUnfolder]: For 2262/2278 co-relation queries the response was YES. [2022-12-06 00:10:26,463 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 00:10:26,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 74 transitions, 675 flow [2022-12-06 00:10:26,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 00:10:33,486 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 00:10:33,774 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 00:10:34,148 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 00:10:34,475 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 00:10:34,733 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 00:10:35,086 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 00:10:35,384 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:10:35,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9022 [2022-12-06 00:10:35,385 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 807 flow [2022-12-06 00:10:35,385 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 00:10:35,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:35,385 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 00:10:35,395 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 00:10:35,591 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 00:10:35,592 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 00:10:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1720087402, now seen corresponding path program 1 times [2022-12-06 00:10:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:35,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499545205] [2022-12-06 00:10:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,589 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 00:10:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499545205] [2022-12-06 00:10:36,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499545205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827005093] [2022-12-06 00:10:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:36,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:36,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:36,591 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 00:10:36,615 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 00:10:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 00:10:36,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:36,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 00:10:36,925 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:10:36,925 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 00:10:36,930 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 00:10:36,985 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 00:10:36,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:36,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827005093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:36,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:36,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-06 00:10:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780682100] [2022-12-06 00:10:36,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:36,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:36,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:10:36,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:10:36,987 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 00:10:36,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:36,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:10:36,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:37,536 INFO L130 PetriNetUnfolder]: 1447/2250 cut-off events. [2022-12-06 00:10:37,536 INFO L131 PetriNetUnfolder]: For 9200/9200 co-relation queries the response was YES. [2022-12-06 00:10:37,544 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 00:10:37,578 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 152 selfloop transitions, 19 changer transitions 1/172 dead transitions. [2022-12-06 00:10:37,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 172 transitions, 1641 flow [2022-12-06 00:10:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:10:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:10:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-06 00:10:37,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30260047281323876 [2022-12-06 00:10:37,580 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 807 flow. Second operand 9 states and 128 transitions. [2022-12-06 00:10:37,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 172 transitions, 1641 flow [2022-12-06 00:10:37,592 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 00:10:37,595 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 782 flow [2022-12-06 00:10:37,595 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 00:10:37,595 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2022-12-06 00:10:37,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:37,595 INFO L89 Accepts]: Start accepts. Operand has 80 places, 77 transitions, 782 flow [2022-12-06 00:10:37,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:37,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:37,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 782 flow [2022-12-06 00:10:37,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 782 flow [2022-12-06 00:10:37,683 INFO L130 PetriNetUnfolder]: 321/691 cut-off events. [2022-12-06 00:10:37,684 INFO L131 PetriNetUnfolder]: For 2792/2812 co-relation queries the response was YES. [2022-12-06 00:10:37,688 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 00:10:37,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 782 flow [2022-12-06 00:10:37,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 00:10:37,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:37,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 00:10:37,697 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 782 flow [2022-12-06 00:10:37,697 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 00:10:37,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:37,697 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 00:10:37,711 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 00:10:37,905 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 00:10:37,905 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 00:10:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash -843807897, now seen corresponding path program 1 times [2022-12-06 00:10:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788103794] [2022-12-06 00:10:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:38,014 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 00:10:38,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:38,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788103794] [2022-12-06 00:10:38,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788103794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:38,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128286506] [2022-12-06 00:10:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:38,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:38,017 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 00:10:38,048 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 00:10:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:38,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:10:38,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:38,270 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 00:10:38,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:38,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128286506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:38,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:38,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 00:10:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711958850] [2022-12-06 00:10:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:38,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:10:38,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:10:38,273 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 00:10:38,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:38,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:10:38,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:38,852 INFO L130 PetriNetUnfolder]: 2318/3859 cut-off events. [2022-12-06 00:10:38,852 INFO L131 PetriNetUnfolder]: For 20989/20989 co-relation queries the response was YES. [2022-12-06 00:10:38,870 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 00:10:38,887 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 125 selfloop transitions, 7 changer transitions 21/153 dead transitions. [2022-12-06 00:10:38,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 153 transitions, 1833 flow [2022-12-06 00:10:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 00:10:38,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.395 [2022-12-06 00:10:38,889 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 782 flow. Second operand 5 states and 79 transitions. [2022-12-06 00:10:38,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 153 transitions, 1833 flow [2022-12-06 00:10:38,913 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 00:10:38,954 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 815 flow [2022-12-06 00:10:38,954 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 00:10:38,954 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-12-06 00:10:38,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:38,955 INFO L89 Accepts]: Start accepts. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 00:10:38,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:38,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:38,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 00:10:38,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 81 transitions, 815 flow [2022-12-06 00:10:39,066 INFO L130 PetriNetUnfolder]: 383/954 cut-off events. [2022-12-06 00:10:39,066 INFO L131 PetriNetUnfolder]: For 3946/3976 co-relation queries the response was YES. [2022-12-06 00:10:39,072 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 00:10:39,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 81 transitions, 815 flow [2022-12-06 00:10:39,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 00:10:43,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:43,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4750 [2022-12-06 00:10:43,705 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 830 flow [2022-12-06 00:10:43,705 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 00:10:43,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:43,705 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 00:10:43,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:10:43,911 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 00:10:43,911 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 00:10:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1562394205, now seen corresponding path program 1 times [2022-12-06 00:10:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031458508] [2022-12-06 00:10:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:44,815 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 00:10:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031458508] [2022-12-06 00:10:44,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031458508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:44,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319904957] [2022-12-06 00:10:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:44,820 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 00:10:44,850 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 00:10:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:45,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:10:45,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:45,142 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:10:45,142 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 00:10:45,150 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 00:10:45,175 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 00:10:45,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:45,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319904957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:45,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:45,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 00:10:45,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972005291] [2022-12-06 00:10:45,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:45,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:10:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:10:45,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:10:45,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:10:45,178 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 00:10:45,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:45,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:10:45,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:45,640 INFO L130 PetriNetUnfolder]: 1935/3200 cut-off events. [2022-12-06 00:10:45,640 INFO L131 PetriNetUnfolder]: For 15166/15166 co-relation queries the response was YES. [2022-12-06 00:10:45,649 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 00:10:45,660 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 70 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2022-12-06 00:10:45,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 1074 flow [2022-12-06 00:10:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 00:10:45,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28292682926829266 [2022-12-06 00:10:45,662 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 830 flow. Second operand 5 states and 58 transitions. [2022-12-06 00:10:45,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 1074 flow [2022-12-06 00:10:45,699 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 00:10:45,700 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,700 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 00:10:45,701 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2022-12-06 00:10:45,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:45,701 INFO L89 Accepts]: Start accepts. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:45,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:45,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,782 INFO L130 PetriNetUnfolder]: 387/960 cut-off events. [2022-12-06 00:10:45,782 INFO L131 PetriNetUnfolder]: For 4334/4364 co-relation queries the response was YES. [2022-12-06 00:10:45,787 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 00:10:45,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 00:10:45,796 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:45,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 00:10:45,797 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 930 flow [2022-12-06 00:10:45,797 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 00:10:45,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:45,797 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 00:10:45,806 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 00:10:46,006 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 00:10:46,006 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 00:10:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1096053303, now seen corresponding path program 1 times [2022-12-06 00:10:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:46,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380152197] [2022-12-06 00:10:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:46,145 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 00:10:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380152197] [2022-12-06 00:10:46,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380152197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936829188] [2022-12-06 00:10:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:46,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:46,148 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 00:10:46,174 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 00:10:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:46,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:10:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:46,377 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 00:10:46,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:46,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936829188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:46,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:46,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 00:10:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288344619] [2022-12-06 00:10:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:46,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:10:46,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:10:46,380 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 00:10:46,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:46,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:10:46,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:47,019 INFO L130 PetriNetUnfolder]: 3164/5127 cut-off events. [2022-12-06 00:10:47,019 INFO L131 PetriNetUnfolder]: For 26848/26848 co-relation queries the response was YES. [2022-12-06 00:10:47,031 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 00:10:47,052 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 93 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-12-06 00:10:47,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1519 flow [2022-12-06 00:10:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:10:47,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-06 00:10:47,054 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 930 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:10:47,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1519 flow [2022-12-06 00:10:47,093 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 00:10:47,095 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,095 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 00:10:47,095 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2022-12-06 00:10:47,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:47,096 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:47,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:47,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,306 INFO L130 PetriNetUnfolder]: 655/1607 cut-off events. [2022-12-06 00:10:47,307 INFO L131 PetriNetUnfolder]: For 7970/8022 co-relation queries the response was YES. [2022-12-06 00:10:47,314 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 00:10:47,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 00:10:47,330 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:47,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:10:47,330 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 1217 flow [2022-12-06 00:10:47,331 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 00:10:47,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:47,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 00:10:47,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 00:10:47,543 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 00:10:47,544 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 00:10:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash 842607351, now seen corresponding path program 2 times [2022-12-06 00:10:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:47,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478455763] [2022-12-06 00:10:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:48,244 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 00:10:48,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478455763] [2022-12-06 00:10:48,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478455763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181106770] [2022-12-06 00:10:48,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:10:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:48,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:48,248 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 00:10:48,271 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 00:10:48,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:10:48,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:10:48,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 00:10:48,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:48,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:48,543 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 00:10:48,608 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 00:10:48,719 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 00:10:48,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:48,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181106770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:48,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:48,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 00:10:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046182602] [2022-12-06 00:10:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:48,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:10:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:10:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:10:48,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:10:48,720 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 00:10:48,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:48,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:10:48,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:49,544 INFO L130 PetriNetUnfolder]: 3545/5714 cut-off events. [2022-12-06 00:10:49,544 INFO L131 PetriNetUnfolder]: For 39178/39178 co-relation queries the response was YES. [2022-12-06 00:10:49,559 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 00:10:49,582 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 159 selfloop transitions, 23 changer transitions 0/182 dead transitions. [2022-12-06 00:10:49,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 2287 flow [2022-12-06 00:10:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-06 00:10:49,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3201219512195122 [2022-12-06 00:10:49,583 INFO L175 Difference]: Start difference. First operand has 89 places, 98 transitions, 1217 flow. Second operand 8 states and 105 transitions. [2022-12-06 00:10:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 2287 flow [2022-12-06 00:10:49,643 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 00:10:49,646 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,646 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 00:10:49,647 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2022-12-06 00:10:49,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:49,647 INFO L89 Accepts]: Start accepts. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:49,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:49,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,826 INFO L130 PetriNetUnfolder]: 736/1804 cut-off events. [2022-12-06 00:10:49,826 INFO L131 PetriNetUnfolder]: For 12027/12069 co-relation queries the response was YES. [2022-12-06 00:10:49,833 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 00:10:49,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 00:10:49,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:49,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:10:49,846 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 1474 flow [2022-12-06 00:10:49,846 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 00:10:49,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:49,847 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 00:10:49,854 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 00:10:50,053 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 00:10:50,053 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 00:10:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1365045397, now seen corresponding path program 3 times [2022-12-06 00:10:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:50,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133136096] [2022-12-06 00:10:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:51,214 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 00:10:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:51,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133136096] [2022-12-06 00:10:51,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133136096] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853922610] [2022-12-06 00:10:51,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:10:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:51,220 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 00:10:51,223 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 00:10:51,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:10:51,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:10:51,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:10:51,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:51,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:51,538 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 00:10:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:51,597 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 00:10:51,748 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 00:10:51,749 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 00:10:51,751 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 00:10:51,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:10:51,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853922610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:51,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:10:51,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-06 00:10:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947912671] [2022-12-06 00:10:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:51,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:10:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:10:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:10:51,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:10:51,754 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 00:10:51,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:51,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:10:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:52,825 INFO L130 PetriNetUnfolder]: 3628/5831 cut-off events. [2022-12-06 00:10:52,825 INFO L131 PetriNetUnfolder]: For 53784/53784 co-relation queries the response was YES. [2022-12-06 00:10:52,841 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 00:10:52,859 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 157 selfloop transitions, 27 changer transitions 0/184 dead transitions. [2022-12-06 00:10:52,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 184 transitions, 2316 flow [2022-12-06 00:10:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:10:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:10:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-06 00:10:52,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31097560975609756 [2022-12-06 00:10:52,860 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 1474 flow. Second operand 8 states and 102 transitions. [2022-12-06 00:10:52,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 184 transitions, 2316 flow [2022-12-06 00:10:52,941 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 00:10:52,944 INFO L231 Difference]: Finished difference. Result has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:52,944 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 00:10:52,945 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2022-12-06 00:10:52,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:52,945 INFO L89 Accepts]: Start accepts. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:52,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:52,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:52,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:52,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:53,128 INFO L130 PetriNetUnfolder]: 752/1839 cut-off events. [2022-12-06 00:10:53,129 INFO L131 PetriNetUnfolder]: For 11649/11693 co-relation queries the response was YES. [2022-12-06 00:10:53,136 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 00:10:53,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:53,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 00:10:53,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:53,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:10:53,150 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 121 transitions, 1631 flow [2022-12-06 00:10:53,150 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 00:10:53,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:53,150 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 00:10:53,157 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 00:10:53,357 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 00:10:53,357 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 00:10:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1009844971, now seen corresponding path program 4 times [2022-12-06 00:10:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:53,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896880643] [2022-12-06 00:10:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:54,334 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 00:10:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896880643] [2022-12-06 00:10:54,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896880643] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:54,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988073436] [2022-12-06 00:10:54,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 00:10:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:54,336 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 00:10:54,338 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 00:10:54,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 00:10:54,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:10:54,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 00:10:54,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:54,562 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 00:10:54,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:10:54,626 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 00:10:54,868 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:10:54,869 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 00:10:54,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:54,893 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 00:10:57,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:57,148 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 00:10:57,299 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 00:10:57,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:57,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:57,747 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 00:10:57,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:10:57,778 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 00:10:57,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 118 treesize of output 94 [2022-12-06 00:11:00,205 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 00:11:00,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988073436] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:11:00,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:11:00,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 00:11:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634395646] [2022-12-06 00:11:00,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:11:00,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:11:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:11:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:11:00,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:00,207 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 00:11:00,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:00,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:03,631 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 00:11:06,457 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 00:11:31,435 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 00:11:59,623 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 00:12:23,259 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 00:12:24,828 INFO L130 PetriNetUnfolder]: 5463/8764 cut-off events. [2022-12-06 00:12:24,829 INFO L131 PetriNetUnfolder]: For 88456/88456 co-relation queries the response was YES. [2022-12-06 00:12:24,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58587 conditions, 8764 events. 5463/8764 cut-off events. For 88456/88456 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 53059 event pairs, 1097 based on Foata normal form. 736/7810 useless extension candidates. Maximal degree in co-relation 58050. Up to 3318 conditions per place. [2022-12-06 00:12:24,883 INFO L137 encePairwiseOnDemand]: 18/41 looper letters, 329 selfloop transitions, 127 changer transitions 271/727 dead transitions. [2022-12-06 00:12:24,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 727 transitions, 8641 flow [2022-12-06 00:12:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-06 00:12:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-12-06 00:12:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 559 transitions. [2022-12-06 00:12:24,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18676912796525225 [2022-12-06 00:12:24,889 INFO L175 Difference]: Start difference. First operand has 110 places, 121 transitions, 1631 flow. Second operand 73 states and 559 transitions. [2022-12-06 00:12:24,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 727 transitions, 8641 flow [2022-12-06 00:12:25,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 727 transitions, 8570 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 00:12:25,013 INFO L231 Difference]: Finished difference. Result has 216 places, 234 transitions, 3926 flow [2022-12-06 00:12:25,014 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=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=3926, PETRI_PLACES=216, PETRI_TRANSITIONS=234} [2022-12-06 00:12:25,014 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 182 predicate places. [2022-12-06 00:12:25,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:25,014 INFO L89 Accepts]: Start accepts. Operand has 216 places, 234 transitions, 3926 flow [2022-12-06 00:12:25,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:25,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:25,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 234 transitions, 3926 flow [2022-12-06 00:12:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 234 transitions, 3926 flow [2022-12-06 00:12:25,355 INFO L130 PetriNetUnfolder]: 765/1841 cut-off events. [2022-12-06 00:12:25,355 INFO L131 PetriNetUnfolder]: For 65727/66073 co-relation queries the response was YES. [2022-12-06 00:12:25,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16594 conditions, 1841 events. 765/1841 cut-off events. For 65727/66073 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 12972 event pairs, 93 based on Foata normal form. 16/1565 useless extension candidates. Maximal degree in co-relation 16472. Up to 684 conditions per place. [2022-12-06 00:12:25,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 234 transitions, 3926 flow [2022-12-06 00:12:25,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-06 00:12:25,396 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 00:12:30,958 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 00:12:31,184 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 00:12:31,269 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 00:12:31,429 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 [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 00:12:31,694 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 [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 00:12:32,011 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 00:12:36,149 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 00:12:36,424 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 00:12:36,663 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 00:12:37,021 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 [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] [2022-12-06 00:12:37,251 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 [1146] L52-2-->L98-2: Formula: (and (< v_~q3_back~0_196 v_~n3~0_130) |v_thread3_#t~short18#1_216| (not (< |v_thread1Thread1of1ForFork0_~i~0#1_100| v_~N~0_117)) (< v_~q1_back~0_289 v_~n1~0_146) (= (select (select |v_#memory_int_472| v_~q1~0.base_165) (+ v_~q1~0.offset_164 (* v_~q1_back~0_289 4))) 0) (<= 0 v_~q3_back~0_196) (not (= (ite (and (< v_~q2_front~0_200 v_~q2_back~0_225) (< v_~q2_front~0_200 v_~n2~0_150) (<= 0 v_~q2_front~0_200)) 1 0) 0)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_67| 0)) (= |v_thread3Thread1of1ForFork2_~t~0#1_81| (+ |v_thread3Thread1of1ForFork2_~t~0#1_82| |v_thread3Thread1of1ForFork2_~k~0#1_67|)) (<= 0 v_~q1_back~0_289) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread3Thread1of1ForFork2_~k~0#1_67| (select (select |v_#memory_int_472| v_~q2~0.base_144) (+ v_~q2~0.offset_144 (* v_~q2_front~0_200 4)))) (= (+ v_~q2_front~0_200 1) v_~q2_front~0_199) (= (ite |v_thread3_#t~short18#1_215| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_#res#1.base_23| 0) (= v_~q3_back~0_195 (+ v_~q3_back~0_196 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= (+ (select (select |v_#memory_int_472| v_~q3~0.base_138) (+ v_~q3~0.offset_138 (* 4 v_~q3_back~0_196))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_67|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) |v_thread1_#t~short8#1_154| (= |v_thread1Thread1of1ForFork0_#res#1.offset_23| 0) (= (+ v_~q1_back~0_289 1) v_~q1_back~0_288) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| 0)) (= (ite |v_thread1_#t~short8#1_153| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|)) InVars {~q1~0.offset=v_~q1~0.offset_164, ~n2~0=v_~n2~0_150, ~n3~0=v_~n3~0_130, ~q2~0.offset=v_~q2~0.offset_144, ~n1~0=v_~n1~0_146, ~q2_front~0=v_~q2_front~0_200, ~N~0=v_~N~0_117, ~q3~0.offset=v_~q3~0.offset_138, ~q3_back~0=v_~q3_back~0_196, ~q1_back~0=v_~q1_back~0_289, ~q1~0.base=v_~q1~0.base_165, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_472|, ~q3~0.base=v_~q3~0.base_138, ~q2~0.base=v_~q2~0.base_144, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_82|, ~q2_back~0=v_~q2_back~0_225} OutVars{~n3~0=v_~n3~0_130, ~q2~0.offset=v_~q2~0.offset_144, ~n1~0=v_~n1~0_146, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_49|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_49|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_29|, ~q3_back~0=v_~q3_back~0_195, ~q1_back~0=v_~q1_back~0_288, ~q1~0.base=v_~q1~0.base_165, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94|, ~q3~0.base=v_~q3~0.base_138, ~q2~0.base=v_~q2~0.base_144, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_29|, ~q2_back~0=v_~q2_back~0_225, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_67|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_23|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_47|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, ~q1~0.offset=v_~q1~0.offset_164, ~n2~0=v_~n2~0_150, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_23|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_47|, ~q2_front~0=v_~q2_front~0_199, ~N~0=v_~N~0_117, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_49|, ~q3~0.offset=v_~q3~0.offset_138, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_472|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_81|} AuxVars[|v_thread3_#t~short18#1_216|, |v_thread1_#t~short8#1_154|, |v_thread3_#t~short18#1_215|, |v_thread1_#t~short8#1_153|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, 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, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q3_back~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:12:37,866 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 [1147] L52-2-->thread3EXIT: Formula: (and (< v_~q3_back~0_200 v_~n3~0_132) (= |v_thread3Thread1of1ForFork2_#res#1.base_21| 0) (= (+ v_~q1_back~0_293 1) v_~q1_back~0_292) |v_thread3_#t~short18#1_220| (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_21|) (< v_~q1_back~0_293 v_~n1~0_148) (= (+ v_~q3_back~0_200 1) v_~q3_back~0_199) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (<= |v_thread3Thread1of1ForFork2_~k~0#1_69| 0) (= |v_thread3Thread1of1ForFork2_~t~0#1_85| (+ |v_thread3Thread1of1ForFork2_~t~0#1_86| |v_thread3Thread1of1ForFork2_~k~0#1_69|)) (<= 0 v_~q3_back~0_200) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= (ite |v_thread1_#t~short8#1_157| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= (+ (select (select |v_#memory_int_474| v_~q3~0.base_140) (+ (* 4 v_~q3_back~0_200) v_~q3~0.offset_140)) 1) |v_thread3Thread1of1ForFork2_~k~0#1_69|) (= (select (select |v_#memory_int_474| v_~q2~0.base_146) (+ v_~q2~0.offset_146 (* v_~q2_front~0_204 4))) |v_thread3Thread1of1ForFork2_~k~0#1_69|) (= (ite |v_thread3_#t~short18#1_219| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_25| 0) (<= 0 v_~q1_back~0_293) (= (+ v_~q2_front~0_204 1) v_~q2_front~0_203) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96| 0)) (not (= (ite (and (< v_~q2_front~0_204 v_~n2~0_152) (< v_~q2_front~0_204 v_~q2_back~0_227) (<= 0 v_~q2_front~0_204)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_25| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55| 0)) |v_thread1_#t~short8#1_158| (not (< |v_thread1Thread1of1ForFork0_~i~0#1_102| v_~N~0_119)) (= (select (select |v_#memory_int_474| v_~q1~0.base_167) (+ (* v_~q1_back~0_293 4) v_~q1~0.offset_166)) 0)) InVars {~q1~0.offset=v_~q1~0.offset_166, ~n2~0=v_~n2~0_152, ~n3~0=v_~n3~0_132, ~q2~0.offset=v_~q2~0.offset_146, ~n1~0=v_~n1~0_148, ~q2_front~0=v_~q2_front~0_204, ~N~0=v_~N~0_119, ~q3~0.offset=v_~q3~0.offset_140, ~q3_back~0=v_~q3_back~0_200, ~q1_back~0=v_~q1_back~0_293, ~q1~0.base=v_~q1~0.base_167, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, #memory_int=|v_#memory_int_474|, ~q3~0.base=v_~q3~0.base_140, ~q2~0.base=v_~q2~0.base_146, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_86|, ~q2_back~0=v_~q2_back~0_227} OutVars{~n3~0=v_~n3~0_132, ~q2~0.offset=v_~q2~0.offset_146, ~n1~0=v_~n1~0_148, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_51|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_51|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_31|, ~q3_back~0=v_~q3_back~0_199, ~q1_back~0=v_~q1_back~0_292, ~q1~0.base=v_~q1~0.base_167, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_96|, ~q3~0.base=v_~q3~0.base_140, ~q2~0.base=v_~q2~0.base_146, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_31|, ~q2_back~0=v_~q2_back~0_227, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_69|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_25|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_49|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_55|, ~q1~0.offset=v_~q1~0.offset_166, ~n2~0=v_~n2~0_152, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_25|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_55|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_49|, ~q2_front~0=v_~q2_front~0_203, ~N~0=v_~N~0_119, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_51|, ~q3~0.offset=v_~q3~0.offset_140, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_21|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_21|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, #memory_int=|v_#memory_int_474|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_85|} AuxVars[|v_thread3_#t~short18#1_220|, |v_thread1_#t~short8#1_158|, |v_thread1_#t~short8#1_157|, |v_thread3_#t~short18#1_219|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, 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, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q3_back~0, thread3Thread1of1ForFork2_#res#1.offset, ~q1_back~0, thread3Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork2_~t~0#1, thread3Thread1of1ForFork2_~k~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:12:38,577 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 00:12:38,893 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 [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] [2022-12-06 00:12:39,079 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 00:12:39,430 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 00:12:40,364 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 00:12:47,292 INFO L203 LiptonReduction]: Total number of compositions: 16 [2022-12-06 00:12:47,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22279 [2022-12-06 00:12:47,293 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 226 transitions, 4112 flow [2022-12-06 00:12:47,293 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 00:12:47,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:47,293 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 00:12:47,301 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 00:12:47,495 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 00:12:47,496 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 00:12:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -526103172, now seen corresponding path program 1 times [2022-12-06 00:12:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:47,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527209772] [2022-12-06 00:12:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:48,709 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 00:12:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:48,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527209772] [2022-12-06 00:12:48,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527209772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:12:48,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801126259] [2022-12-06 00:12:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:48,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:12:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:12:48,712 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 00:12:48,725 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 00:12:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:48,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:12:48,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:12:49,197 INFO L321 Elim1Store]: treesize reduction 9, result has 83.6 percent of original size [2022-12-06 00:12:49,197 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 65 treesize of output 62 [2022-12-06 00:12:49,308 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 00:12:49,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:12:49,586 INFO L321 Elim1Store]: treesize reduction 8, result has 97.0 percent of original size [2022-12-06 00:12:49,586 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 85 treesize of output 285 [2022-12-06 00:13:05,471 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 00:13:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801126259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:13:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:13:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-12-06 00:13:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450350723] [2022-12-06 00:13:05,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:13:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:13:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:13:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-12-06 00:13:05,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:13:05,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 226 transitions, 4112 flow. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 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 00:13:05,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:05,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:13:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:09,587 INFO L130 PetriNetUnfolder]: 5636/9510 cut-off events. [2022-12-06 00:13:09,587 INFO L131 PetriNetUnfolder]: For 369786/369786 co-relation queries the response was YES. [2022-12-06 00:13:09,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86693 conditions, 9510 events. 5636/9510 cut-off events. For 369786/369786 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 62464 event pairs, 1590 based on Foata normal form. 6/8852 useless extension candidates. Maximal degree in co-relation 86514. Up to 3563 conditions per place. [2022-12-06 00:13:09,758 INFO L137 encePairwiseOnDemand]: 34/61 looper letters, 479 selfloop transitions, 63 changer transitions 84/626 dead transitions. [2022-12-06 00:13:09,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 626 transitions, 11302 flow [2022-12-06 00:13:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 00:13:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 00:13:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 340 transitions. [2022-12-06 00:13:09,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17418032786885246 [2022-12-06 00:13:09,761 INFO L175 Difference]: Start difference. First operand has 186 places, 226 transitions, 4112 flow. Second operand 32 states and 340 transitions. [2022-12-06 00:13:09,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 626 transitions, 11302 flow [2022-12-06 00:13:11,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 626 transitions, 9556 flow, removed 866 selfloop flow, removed 17 redundant places. [2022-12-06 00:13:11,849 INFO L231 Difference]: Finished difference. Result has 211 places, 250 transitions, 3825 flow [2022-12-06 00:13:11,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3360, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3825, PETRI_PLACES=211, PETRI_TRANSITIONS=250} [2022-12-06 00:13:11,849 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 177 predicate places. [2022-12-06 00:13:11,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:11,849 INFO L89 Accepts]: Start accepts. Operand has 211 places, 250 transitions, 3825 flow [2022-12-06 00:13:11,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:11,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:11,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 250 transitions, 3825 flow [2022-12-06 00:13:11,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 250 transitions, 3825 flow [2022-12-06 00:13:12,221 INFO L130 PetriNetUnfolder]: 1066/2653 cut-off events. [2022-12-06 00:13:12,221 INFO L131 PetriNetUnfolder]: For 83585/84001 co-relation queries the response was YES. [2022-12-06 00:13:12,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21378 conditions, 2653 events. 1066/2653 cut-off events. For 83585/84001 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 21283 event pairs, 139 based on Foata normal form. 26/2287 useless extension candidates. Maximal degree in co-relation 21306. Up to 987 conditions per place. [2022-12-06 00:13:12,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 250 transitions, 3825 flow [2022-12-06 00:13:12,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 1178 [2022-12-06 00:13:12,267 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 00:13:12,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1162] L98-2-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_512| v_~q2~0.base_174))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_45| 0) |v_thread3_#t~short18#1_270| (= (+ v_~q2_back~0_278 1) v_~q2_back~0_277) (= |v_thread3Thread1of1ForFork2_#res#1.base_31| 0) (not (= (ite (and (< v_~q2_front~0_242 v_~q2_back~0_278) (<= 0 v_~q2_front~0_242) (< v_~q2_front~0_242 v_~n2~0_180)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_230 v_~n1~0_168) (< v_~q1_front~0_230 v_~q1_back~0_322) (<= 0 v_~q1_front~0_230)) 1 0) 0)) |v_thread2_#t~short13#1_293| (= |v_thread3Thread1of1ForFork2_~k~0#1_87| (select .cse0 (+ (* v_~q2_front~0_242 4) v_~q2~0.offset_174))) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|) (<= 0 v_~q3_back~0_238) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= (+ v_~q2_front~0_242 1) v_~q2_front~0_241) (= (+ v_~q1_front~0_230 1) v_~q1_front~0_229) (= (select (select |v_#memory_int_512| v_~q1~0.base_187) (+ v_~q1~0.offset_186 (* v_~q1_front~0_230 4))) |v_thread2Thread1of1ForFork1_~j~0#1_133|) (= |v_thread3Thread1of1ForFork2_~t~0#1_121| (+ |v_thread3Thread1of1ForFork2_~k~0#1_87| |v_thread3Thread1of1ForFork2_~t~0#1_122|)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73| (ite |v_thread3_#t~short18#1_269| 1 0)) (= (+ v_~q3_back~0_238 1) v_~q3_back~0_237) (= (+ (select .cse0 (+ v_~q2~0.offset_174 (* 4 v_~q2_back~0_278))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_133|) (<= |v_thread2Thread1of1ForFork1_~j~0#1_133| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_45|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_31|) (= |v_thread3Thread1of1ForFork2_~k~0#1_87| (+ (select (select |v_#memory_int_512| v_~q3~0.base_160) (+ v_~q3~0.offset_160 (* 4 v_~q3_back~0_238))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite |v_thread2_#t~short13#1_294| 1 0)) (= |v_thread2Thread1of1ForFork1_~s~0#1_143| (+ |v_thread2Thread1of1ForFork1_~s~0#1_144| |v_thread2Thread1of1ForFork1_~j~0#1_133|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_87| 0) (< v_~q3_back~0_238 v_~n3~0_152) (< v_~q2_back~0_278 v_~n2~0_180))) InVars {~q1~0.offset=v_~q1~0.offset_186, ~n2~0=v_~n2~0_180, ~q1_front~0=v_~q1_front~0_230, ~n3~0=v_~n3~0_152, ~q2~0.offset=v_~q2~0.offset_174, ~n1~0=v_~n1~0_168, ~q2_front~0=v_~q2_front~0_242, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_144|, ~q3~0.offset=v_~q3~0.offset_160, ~q3_back~0=v_~q3_back~0_238, ~q1_back~0=v_~q1_back~0_322, ~q1~0.base=v_~q1~0.base_187, #memory_int=|v_#memory_int_512|, ~q3~0.base=v_~q3~0.base_160, ~q2~0.base=v_~q2~0.base_174, ~q2_back~0=v_~q2_back~0_278, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_122|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_73|, ~q1_front~0=v_~q1_front~0_229, ~n3~0=v_~n3~0_152, ~q2~0.offset=v_~q2~0.offset_174, ~n1~0=v_~n1~0_168, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_69|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_69|, ~q3_back~0=v_~q3_back~0_237, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_61|, ~q1_back~0=v_~q1_back~0_322, ~q1~0.base=v_~q1~0.base_187, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_61|, ~q3~0.base=v_~q3~0.base_160, ~q2~0.base=v_~q2~0.base_174, ~q2_back~0=v_~q2_back~0_277, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_87|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_67|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_133|, ~q1~0.offset=v_~q1~0.offset_186, ~n2~0=v_~n2~0_180, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_67|, ~q2_front~0=v_~q2_front~0_241, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_143|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_69|, ~q3~0.offset=v_~q3~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_45|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_31|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_73|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_85|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_31|, #memory_int=|v_#memory_int_512|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_121|} AuxVars[|v_thread2_#t~short13#1_293|, |v_thread2_#t~short13#1_294|, |v_thread3_#t~short18#1_270|, |v_thread3_#t~short18#1_269|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, ~q1_front~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, thread2Thread1of1ForFork1_#t~mem10#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, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork2_#res#1.base, 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 00:13:13,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1160] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_508| v_~q2~0.base_170))) (and (= |v_thread3Thread1of1ForFork2_~k~0#1_85| (+ (select (select |v_#memory_int_508| v_~q3~0.base_158) (+ v_~q3~0.offset_158 (* 4 v_~q3_back~0_234))) 1)) |v_thread3_#t~short18#1_266| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= v_~q2_back~0_269 (+ v_~q2_back~0_270 1)) (= (+ (select .cse0 (+ (* 4 v_~q2_back~0_270) v_~q2~0.offset_170)) 1) |v_thread2Thread1of1ForFork1_~j~0#1_129|) (= (ite |v_thread3_#t~short18#1_265| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= |v_thread3Thread1of1ForFork2_~t~0#1_117| (+ |v_thread3Thread1of1ForFork2_~k~0#1_85| |v_thread3Thread1of1ForFork2_~t~0#1_118|)) |v_thread2_#t~short13#1_283| (= |v_thread2Thread1of1ForFork1_~s~0#1_135| (+ |v_thread2Thread1of1ForFork1_~s~0#1_136| |v_thread2Thread1of1ForFork1_~j~0#1_129|)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= (select .cse0 (+ (* v_~q2_front~0_238 4) v_~q2~0.offset_170)) |v_thread3Thread1of1ForFork2_~k~0#1_85|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| (ite |v_thread2_#t~short13#1_284| 1 0)) (not (= (ite (and (< v_~q2_front~0_238 v_~n2~0_176) (< v_~q2_front~0_238 v_~q2_back~0_269) (<= 0 v_~q2_front~0_238)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_41| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71| 0)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_85| 0)) (= (+ v_~q2_front~0_238 1) v_~q2_front~0_237) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_41|) (<= |v_thread2Thread1of1ForFork1_~j~0#1_129| 0) (<= 0 v_~q3_back~0_234) (= (+ v_~q3_back~0_234 1) v_~q3_back~0_233) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|) (< v_~q2_back~0_270 v_~n2~0_176) (< v_~q3_back~0_234 v_~n3~0_150))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_129|, ~n2~0=v_~n2~0_176, ~n3~0=v_~n3~0_150, ~q2~0.offset=v_~q2~0.offset_170, ~q2_front~0=v_~q2_front~0_238, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_136|, ~q3~0.offset=v_~q3~0.offset_158, ~q3_back~0=v_~q3_back~0_234, #memory_int=|v_#memory_int_508|, ~q3~0.base=v_~q3~0.base_158, ~q2~0.base=v_~q2~0.base_170, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_118|, ~q2_back~0=v_~q2_back~0_270} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_69|, ~n3~0=v_~n3~0_150, ~q2~0.offset=v_~q2~0.offset_170, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_67|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_67|, ~q3_back~0=v_~q3_back~0_233, ~q3~0.base=v_~q3~0.base_158, ~q2~0.base=v_~q2~0.base_170, ~q2_back~0=v_~q2_back~0_269, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_85|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_65|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_129|, ~n2~0=v_~n2~0_176, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_65|, ~q2_front~0=v_~q2_front~0_237, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_67|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_135|, ~q3~0.offset=v_~q3~0.offset_158, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_41|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_69|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_81|, #memory_int=|v_#memory_int_508|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_117|} AuxVars[|v_thread3_#t~short18#1_265|, |v_thread3_#t~short18#1_266|, |v_thread2_#t~short13#1_284|, |v_thread2_#t~short13#1_283|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#res#1.offset, 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_#res#1.base, 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 00:13:13,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1099] L147-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50| (ite (not (= v_~r~0_In_3 0)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62|)) InVars {~r~0=v_~r~0_In_3} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62|, ~r~0=v_~r~0_In_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem38#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 00:13:13,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1155] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_498| v_~q2~0.base_160))) (and (= (+ (select .cse0 (+ v_~q2~0.offset_160 (* 4 v_~q2_back~0_250))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_119|) |v_thread3_#t~short18#1_245| (< v_~q1_back~0_309 v_~n1~0_160) |v_thread2_#t~short13#1_263| (<= 0 v_~q3_back~0_218) (= (ite |v_thread3_#t~short18#1_246| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100| 0)) (= |v_thread2Thread1of1ForFork1_~s~0#1_115| (+ |v_thread2Thread1of1ForFork1_~s~0#1_116| |v_thread2Thread1of1ForFork1_~j~0#1_119|)) (= |v_thread3Thread1of1ForFork2_~t~0#1_101| (+ |v_thread3Thread1of1ForFork2_~k~0#1_77| |v_thread3Thread1of1ForFork2_~t~0#1_102|)) (= (+ v_~q1_back~0_309 1) v_~q1_back~0_308) (< v_~q2_back~0_250 v_~n2~0_166) (<= 0 v_~q1_back~0_309) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_29| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= (+ (select (select |v_#memory_int_498| v_~q3~0.base_150) (+ v_~q3~0.offset_150 (* 4 v_~q3_back~0_218))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_77|) (= (select (select |v_#memory_int_498| v_~q1~0.base_179) (+ v_~q1~0.offset_178 (* v_~q1_back~0_309 4))) 0) (< v_~q3_back~0_218 v_~n3~0_142) (= |v_thread1Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| (ite |v_thread1_#t~short8#1_172| 1 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_31|) (not (= (ite (and (< v_~q2_front~0_222 v_~n2~0_166) (<= 0 v_~q2_front~0_222) (< v_~q2_front~0_222 v_~q2_back~0_249)) 1 0) 0)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_119| 0) (= (+ v_~q3_back~0_218 1) v_~q3_back~0_217) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite |v_thread2_#t~short13#1_264| 1 0)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_77| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_31| 0) (= (+ v_~q2_front~0_222 1) v_~q2_front~0_221) (= (+ v_~q2_back~0_250 1) v_~q2_back~0_249) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| 0)) |v_thread1_#t~short8#1_171| (not (< |v_thread1Thread1of1ForFork0_~i~0#1_106| v_~N~0_125)) (= |v_thread3Thread1of1ForFork2_~k~0#1_77| (select .cse0 (+ (* v_~q2_front~0_222 4) v_~q2~0.offset_160))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|))) InVars {~q1~0.offset=v_~q1~0.offset_178, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_119|, ~n2~0=v_~n2~0_166, ~n3~0=v_~n3~0_142, ~q2~0.offset=v_~q2~0.offset_160, ~n1~0=v_~n1~0_160, ~q2_front~0=v_~q2_front~0_222, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_116|, ~q3~0.offset=v_~q3~0.offset_150, ~q3_back~0=v_~q3_back~0_218, ~q1_back~0=v_~q1_back~0_309, ~q1~0.base=v_~q1~0.base_179, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_498|, ~q3~0.base=v_~q3~0.base_150, ~q2~0.base=v_~q2~0.base_160, ~q2_back~0=v_~q2_back~0_250, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_102|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_59|, ~n3~0=v_~n3~0_142, ~q2~0.offset=v_~q2~0.offset_160, ~n1~0=v_~n1~0_160, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_31|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_59|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_59|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_35|, ~q3_back~0=v_~q3_back~0_217, ~q1_back~0=v_~q1_back~0_308, ~q1~0.base=v_~q1~0.base_179, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_39|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|, ~q3~0.base=v_~q3~0.base_150, ~q2~0.base=v_~q2~0.base_160, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_35|, ~q2_back~0=v_~q2_back~0_249, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_77|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_29|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_57|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|, ~q1~0.offset=v_~q1~0.offset_178, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_119|, ~n2~0=v_~n2~0_166, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_57|, ~q2_front~0=v_~q2_front~0_221, ~N~0=v_~N~0_125, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_59|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_115|, ~q3~0.offset=v_~q3~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_31|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_59|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_498|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_101|} AuxVars[|v_thread3_#t~short18#1_245|, |v_thread2_#t~short13#1_263|, |v_thread1_#t~short8#1_172|, |v_thread2_#t~short13#1_264|, |v_thread1_#t~short8#1_171|, |v_thread3_#t~short18#1_246|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork0_#t~short8#1, ~q3_back~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread1Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, 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_#res#1.base, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#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 00:13:14,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1162] L98-2-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_512| v_~q2~0.base_174))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_45| 0) |v_thread3_#t~short18#1_270| (= (+ v_~q2_back~0_278 1) v_~q2_back~0_277) (= |v_thread3Thread1of1ForFork2_#res#1.base_31| 0) (not (= (ite (and (< v_~q2_front~0_242 v_~q2_back~0_278) (<= 0 v_~q2_front~0_242) (< v_~q2_front~0_242 v_~n2~0_180)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_230 v_~n1~0_168) (< v_~q1_front~0_230 v_~q1_back~0_322) (<= 0 v_~q1_front~0_230)) 1 0) 0)) |v_thread2_#t~short13#1_293| (= |v_thread3Thread1of1ForFork2_~k~0#1_87| (select .cse0 (+ (* v_~q2_front~0_242 4) v_~q2~0.offset_174))) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|) (<= 0 v_~q3_back~0_238) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= (+ v_~q2_front~0_242 1) v_~q2_front~0_241) (= (+ v_~q1_front~0_230 1) v_~q1_front~0_229) (= (select (select |v_#memory_int_512| v_~q1~0.base_187) (+ v_~q1~0.offset_186 (* v_~q1_front~0_230 4))) |v_thread2Thread1of1ForFork1_~j~0#1_133|) (= |v_thread3Thread1of1ForFork2_~t~0#1_121| (+ |v_thread3Thread1of1ForFork2_~k~0#1_87| |v_thread3Thread1of1ForFork2_~t~0#1_122|)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73| (ite |v_thread3_#t~short18#1_269| 1 0)) (= (+ v_~q3_back~0_238 1) v_~q3_back~0_237) (= (+ (select .cse0 (+ v_~q2~0.offset_174 (* 4 v_~q2_back~0_278))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_133|) (<= |v_thread2Thread1of1ForFork1_~j~0#1_133| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_45|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73| 0)) (= 0 |v_thread3Thread1of1ForFork2_#res#1.offset_31|) (= |v_thread3Thread1of1ForFork2_~k~0#1_87| (+ (select (select |v_#memory_int_512| v_~q3~0.base_160) (+ v_~q3~0.offset_160 (* 4 v_~q3_back~0_238))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite |v_thread2_#t~short13#1_294| 1 0)) (= |v_thread2Thread1of1ForFork1_~s~0#1_143| (+ |v_thread2Thread1of1ForFork1_~s~0#1_144| |v_thread2Thread1of1ForFork1_~j~0#1_133|)) (<= |v_thread3Thread1of1ForFork2_~k~0#1_87| 0) (< v_~q3_back~0_238 v_~n3~0_152) (< v_~q2_back~0_278 v_~n2~0_180))) InVars {~q1~0.offset=v_~q1~0.offset_186, ~n2~0=v_~n2~0_180, ~q1_front~0=v_~q1_front~0_230, ~n3~0=v_~n3~0_152, ~q2~0.offset=v_~q2~0.offset_174, ~n1~0=v_~n1~0_168, ~q2_front~0=v_~q2_front~0_242, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_144|, ~q3~0.offset=v_~q3~0.offset_160, ~q3_back~0=v_~q3_back~0_238, ~q1_back~0=v_~q1_back~0_322, ~q1~0.base=v_~q1~0.base_187, #memory_int=|v_#memory_int_512|, ~q3~0.base=v_~q3~0.base_160, ~q2~0.base=v_~q2~0.base_174, ~q2_back~0=v_~q2_back~0_278, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_122|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_73|, ~q1_front~0=v_~q1_front~0_229, ~n3~0=v_~n3~0_152, ~q2~0.offset=v_~q2~0.offset_174, ~n1~0=v_~n1~0_168, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_69|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_69|, ~q3_back~0=v_~q3_back~0_237, thread2Thread1of1ForFork1_#t~post11#1=|v_thread2Thread1of1ForFork1_#t~post11#1_61|, ~q1_back~0=v_~q1_back~0_322, ~q1~0.base=v_~q1~0.base_187, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_61|, ~q3~0.base=v_~q3~0.base_160, ~q2~0.base=v_~q2~0.base_174, ~q2_back~0=v_~q2_back~0_277, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_87|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_67|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_133|, ~q1~0.offset=v_~q1~0.offset_186, ~n2~0=v_~n2~0_180, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_73|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_67|, ~q2_front~0=v_~q2_front~0_241, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_143|, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_69|, ~q3~0.offset=v_~q3~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_45|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_31|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_73|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_85|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_31|, #memory_int=|v_#memory_int_512|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_121|} AuxVars[|v_thread2_#t~short13#1_293|, |v_thread2_#t~short13#1_294|, |v_thread3_#t~short18#1_270|, |v_thread3_#t~short18#1_269|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, ~q1_front~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, ~q3_back~0, thread2Thread1of1ForFork1_#t~post11#1, thread2Thread1of1ForFork1_#t~mem10#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, thread2Thread1of1ForFork1_~s~0#1, thread3Thread1of1ForFork2_#t~mem17#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork2_#res#1.base, 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 00:13:15,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1160] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_508| v_~q2~0.base_170))) (and (= |v_thread3Thread1of1ForFork2_~k~0#1_85| (+ (select (select |v_#memory_int_508| v_~q3~0.base_158) (+ v_~q3~0.offset_158 (* 4 v_~q3_back~0_234))) 1)) |v_thread3_#t~short18#1_266| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= v_~q2_back~0_269 (+ v_~q2_back~0_270 1)) (= (+ (select .cse0 (+ (* 4 v_~q2_back~0_270) v_~q2~0.offset_170)) 1) |v_thread2Thread1of1ForFork1_~j~0#1_129|) (= (ite |v_thread3_#t~short18#1_265| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= |v_thread3Thread1of1ForFork2_~t~0#1_117| (+ |v_thread3Thread1of1ForFork2_~k~0#1_85| |v_thread3Thread1of1ForFork2_~t~0#1_118|)) |v_thread2_#t~short13#1_283| (= |v_thread2Thread1of1ForFork1_~s~0#1_135| (+ |v_thread2Thread1of1ForFork1_~s~0#1_136| |v_thread2Thread1of1ForFork1_~j~0#1_129|)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= (select .cse0 (+ (* v_~q2_front~0_238 4) v_~q2~0.offset_170)) |v_thread3Thread1of1ForFork2_~k~0#1_85|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| (ite |v_thread2_#t~short13#1_284| 1 0)) (not (= (ite (and (< v_~q2_front~0_238 v_~n2~0_176) (< v_~q2_front~0_238 v_~q2_back~0_269) (<= 0 v_~q2_front~0_238)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_41| 0) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71| 0)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_85| 0)) (= (+ v_~q2_front~0_238 1) v_~q2_front~0_237) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_41|) (<= |v_thread2Thread1of1ForFork1_~j~0#1_129| 0) (<= 0 v_~q3_back~0_234) (= (+ v_~q3_back~0_234 1) v_~q3_back~0_233) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|) (< v_~q2_back~0_270 v_~n2~0_176) (< v_~q3_back~0_234 v_~n3~0_150))) InVars {thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_129|, ~n2~0=v_~n2~0_176, ~n3~0=v_~n3~0_150, ~q2~0.offset=v_~q2~0.offset_170, ~q2_front~0=v_~q2_front~0_238, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_136|, ~q3~0.offset=v_~q3~0.offset_158, ~q3_back~0=v_~q3_back~0_234, #memory_int=|v_#memory_int_508|, ~q3~0.base=v_~q3~0.base_158, ~q2~0.base=v_~q2~0.base_170, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_118|, ~q2_back~0=v_~q2_back~0_270} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_69|, ~n3~0=v_~n3~0_150, ~q2~0.offset=v_~q2~0.offset_170, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_67|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_67|, ~q3_back~0=v_~q3_back~0_233, ~q3~0.base=v_~q3~0.base_158, ~q2~0.base=v_~q2~0.base_170, ~q2_back~0=v_~q2_back~0_269, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_85|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_65|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_129|, ~n2~0=v_~n2~0_176, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_71|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_65|, ~q2_front~0=v_~q2_front~0_237, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_67|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_135|, ~q3~0.offset=v_~q3~0.offset_158, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_41|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_69|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_81|, #memory_int=|v_#memory_int_508|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_117|} AuxVars[|v_thread3_#t~short18#1_265|, |v_thread3_#t~short18#1_266|, |v_thread2_#t~short13#1_284|, |v_thread2_#t~short13#1_283|] AssignedVars[thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#res#1.offset, 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_#res#1.base, 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 00:13:15,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1099] L147-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50| (ite (not (= v_~r~0_In_3 0)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62|)) InVars {~r~0=v_~r~0_In_3} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_62|, ~r~0=v_~r~0_In_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_50|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem38#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 00:13:15,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1155] L81-->L98-2: Formula: (let ((.cse0 (select |v_#memory_int_498| v_~q2~0.base_160))) (and (= (+ (select .cse0 (+ v_~q2~0.offset_160 (* 4 v_~q2_back~0_250))) 1) |v_thread2Thread1of1ForFork1_~j~0#1_119|) |v_thread3_#t~short18#1_245| (< v_~q1_back~0_309 v_~n1~0_160) |v_thread2_#t~short13#1_263| (<= 0 v_~q3_back~0_218) (= (ite |v_thread3_#t~short18#1_246| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100| 0)) (= |v_thread2Thread1of1ForFork1_~s~0#1_115| (+ |v_thread2Thread1of1ForFork1_~s~0#1_116| |v_thread2Thread1of1ForFork1_~j~0#1_119|)) (= |v_thread3Thread1of1ForFork2_~t~0#1_101| (+ |v_thread3Thread1of1ForFork2_~k~0#1_77| |v_thread3Thread1of1ForFork2_~t~0#1_102|)) (= (+ v_~q1_back~0_309 1) v_~q1_back~0_308) (< v_~q2_back~0_250 v_~n2~0_166) (<= 0 v_~q1_back~0_309) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_29| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= (+ (select (select |v_#memory_int_498| v_~q3~0.base_150) (+ v_~q3~0.offset_150 (* 4 v_~q3_back~0_218))) 1) |v_thread3Thread1of1ForFork2_~k~0#1_77|) (= (select (select |v_#memory_int_498| v_~q1~0.base_179) (+ v_~q1~0.offset_178 (* v_~q1_back~0_309 4))) 0) (< v_~q3_back~0_218 v_~n3~0_142) (= |v_thread1Thread1of1ForFork0_#res#1.base_29| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| (ite |v_thread1_#t~short8#1_172| 1 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_31|) (not (= (ite (and (< v_~q2_front~0_222 v_~n2~0_166) (<= 0 v_~q2_front~0_222) (< v_~q2_front~0_222 v_~q2_back~0_249)) 1 0) 0)) (<= |v_thread2Thread1of1ForFork1_~j~0#1_119| 0) (= (+ v_~q3_back~0_218 1) v_~q3_back~0_217) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite |v_thread2_#t~short13#1_264| 1 0)) (not (<= |v_thread3Thread1of1ForFork2_~k~0#1_77| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_31| 0) (= (+ v_~q2_front~0_222 1) v_~q2_front~0_221) (= (+ v_~q2_back~0_250 1) v_~q2_back~0_249) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| 0)) |v_thread1_#t~short8#1_171| (not (< |v_thread1Thread1of1ForFork0_~i~0#1_106| v_~N~0_125)) (= |v_thread3Thread1of1ForFork2_~k~0#1_77| (select .cse0 (+ (* v_~q2_front~0_222 4) v_~q2~0.offset_160))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|))) InVars {~q1~0.offset=v_~q1~0.offset_178, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_119|, ~n2~0=v_~n2~0_166, ~n3~0=v_~n3~0_142, ~q2~0.offset=v_~q2~0.offset_160, ~n1~0=v_~n1~0_160, ~q2_front~0=v_~q2_front~0_222, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_116|, ~q3~0.offset=v_~q3~0.offset_150, ~q3_back~0=v_~q3_back~0_218, ~q1_back~0=v_~q1_back~0_309, ~q1~0.base=v_~q1~0.base_179, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_498|, ~q3~0.base=v_~q3~0.base_150, ~q2~0.base=v_~q2~0.base_160, ~q2_back~0=v_~q2_back~0_250, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_102|} OutVars{thread2Thread1of1ForFork1_#t~short13#1=|v_thread2Thread1of1ForFork1_#t~short13#1_59|, ~n3~0=v_~n3~0_142, ~q2~0.offset=v_~q2~0.offset_160, ~n1~0=v_~n1~0_160, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_31|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread3Thread1of1ForFork2_#t~post16#1=|v_thread3Thread1of1ForFork2_#t~post16#1_59|, thread3Thread1of1ForFork2_#t~mem15#1=|v_thread3Thread1of1ForFork2_#t~mem15#1_59|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_35|, ~q3_back~0=v_~q3_back~0_217, ~q1_back~0=v_~q1_back~0_308, ~q1~0.base=v_~q1~0.base_179, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_39|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_100|, ~q3~0.base=v_~q3~0.base_150, ~q2~0.base=v_~q2~0.base_160, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_35|, ~q2_back~0=v_~q2_back~0_249, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_77|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_29|, thread3Thread1of1ForFork2_#t~post19#1=|v_thread3Thread1of1ForFork2_#t~post19#1_57|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_63|, ~q1~0.offset=v_~q1~0.offset_178, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_119|, ~n2~0=v_~n2~0_166, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_29|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread3Thread1of1ForFork2_#t~short18#1=|v_thread3Thread1of1ForFork2_#t~short18#1_57|, ~q2_front~0=v_~q2_front~0_221, ~N~0=v_~N~0_125, thread3Thread1of1ForFork2_#t~mem17#1=|v_thread3Thread1of1ForFork2_#t~mem17#1_59|, thread2Thread1of1ForFork1_~s~0#1=|v_thread2Thread1of1ForFork1_~s~0#1_115|, ~q3~0.offset=v_~q3~0.offset_150, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_31|, thread2Thread1of1ForFork1_#t~post14#1=|v_thread2Thread1of1ForFork1_#t~post14#1_59|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_498|, thread3Thread1of1ForFork2_~t~0#1=|v_thread3Thread1of1ForFork2_~t~0#1_101|} AuxVars[|v_thread3_#t~short18#1_245|, |v_thread2_#t~short13#1_263|, |v_thread1_#t~short8#1_172|, |v_thread2_#t~short13#1_264|, |v_thread1_#t~short8#1_171|, |v_thread3_#t~short18#1_246|] AssignedVars[thread2Thread1of1ForFork1_#t~short13#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post16#1, thread3Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork0_#t~short8#1, ~q3_back~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread3Thread1of1ForFork2_~k~0#1, thread1Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork2_#t~post19#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, 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_#res#1.base, thread2Thread1of1ForFork1_#t~post14#1, thread2Thread1of1ForFork1_#t~mem12#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 00:13:17,117 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 00:13:17,600 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 [1176] L56-->L56: Formula: (and (= v_~q3_front~0_191 (+ v_~q3_front~0_192 1)) (= 2 (select (select |v_#memory_int_551| v_~q1~0.base_207) (+ v_~q1~0.offset_206 (* v_~q1_back~0_357 4)))) (= (ite |v_thread1_#t~short2#1_210| 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138|) (= (+ |v_thread1Thread1of1ForFork0_~l~0#1_60| v_~r~0_136) v_~r~0_135) (< v_~q1_back~0_357 v_~n1~0_188) |v_thread1_#t~short2#1_209| (= |v_thread1Thread1of1ForFork0_~i~0#1_155| (+ |v_thread1Thread1of1ForFork0_~i~0#1_156| 1)) (= |v_thread1Thread1of1ForFork0_~l~0#1_60| (select (select |v_#memory_int_551| v_~q3~0.base_185) (+ v_~q3~0.offset_185 (* v_~q3_front~0_192 4)))) (<= 0 v_~q1_back~0_357) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_138| 0)) (not (= (ite (and (<= 0 v_~q3_front~0_192) (< v_~q3_front~0_192 v_~q3_back~0_279) (< v_~q3_front~0_192 v_~n3~0_176)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_138|) (= (+ v_~q1_back~0_357 1) v_~q1_back~0_356) (< |v_thread1Thread1of1ForFork0_~i~0#1_155| v_~N~0_145)) InVars {~q1~0.offset=v_~q1~0.offset_206, ~n3~0=v_~n3~0_176, ~n1~0=v_~n1~0_188, ~N~0=v_~N~0_145, ~q3~0.offset=v_~q3~0.offset_185, ~q3_front~0=v_~q3_front~0_192, ~q3_back~0=v_~q3_back~0_279, ~q1_back~0=v_~q1_back~0_357, ~q1~0.base=v_~q1~0.base_207, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_551|, ~q3~0.base=v_~q3~0.base_185, ~r~0=v_~r~0_136} OutVars{thread1Thread1of1ForFork0_~l~0#1=|v_thread1Thread1of1ForFork0_~l~0#1_60|, ~q1~0.offset=v_~q1~0.offset_206, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_56|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_49|, ~n3~0=v_~n3~0_176, ~n1~0=v_~n1~0_188, ~N~0=v_~N~0_145, ~q3~0.offset=v_~q3~0.offset_185, ~q3_front~0=v_~q3_front~0_191, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138|, ~q3_back~0=v_~q3_back~0_279, ~q1_back~0=v_~q1_back~0_356, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_51|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_56|, ~q1~0.base=v_~q1~0.base_207, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_138|, #memory_int=|v_#memory_int_551|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_49|, ~q3~0.base=v_~q3~0.base_185, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_58|, ~r~0=v_~r~0_135} AuxVars[|v_thread1_#t~short2#1_210|, |v_thread1_#t~short2#1_209|] 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 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE105 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE532 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE168 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE540 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE121 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,601 WARN L322 ript$VariableManager]: TermVariable LBE484 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE19 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE526 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE525 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE514 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE524 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE493 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE184 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,602 WARN L322 ript$VariableManager]: TermVariable LBE194 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:13:17,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:13:17,803 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 00:13:17,804 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread3_#t~short18#1_151 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:13:17,807 INFO L158 Benchmark]: Toolchain (without parser) took 209631.50ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 925.9MB). Free memory was 160.9MB in the beginning and 479.4MB in the end (delta: -318.5MB). Peak memory consumption was 674.7MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,807 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:13:17,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 184.5MB. Free memory was 160.3MB in the beginning and 146.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.16ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 144.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,808 INFO L158 Benchmark]: Boogie Preprocessor took 59.02ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,808 INFO L158 Benchmark]: RCFGBuilder took 955.99ms. Allocated memory is still 184.5MB. Free memory was 142.0MB in the beginning and 100.6MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,808 INFO L158 Benchmark]: TraceAbstraction took 208252.81ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 925.9MB). Free memory was 100.0MB in the beginning and 479.4MB in the end (delta: -379.3MB). Peak memory consumption was 613.9MB. Max. memory is 8.0GB. [2022-12-06 00:13:17,809 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.12ms. Allocated memory is still 184.5MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 184.5MB. Free memory was 160.3MB in the beginning and 146.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.16ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 144.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.02ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 955.99ms. Allocated memory is still 184.5MB. Free memory was 142.0MB in the beginning and 100.6MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 208252.81ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 925.9MB). Free memory was 100.0MB in the beginning and 479.4MB in the end (delta: -379.3MB). Peak memory consumption was 613.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 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: 102, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 61, dependent conditional: 0, dependent unconditional: 61, 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: 17, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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.5s, 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.0s, 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.3s, 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.4s, 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.8s, 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.4s, 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: 8.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: 21.9s, 193 PlacesBefore, 186 PlacesAfterwards, 234 TransitionsBefore, 226 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 55, 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: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 55, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 76, Positive conditional cache size: 57, 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 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread3_#t~short18#1_151 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread3_#t~short18#1_151 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:13:17,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...