/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:28:36,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:28:36,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:28:37,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:28:37,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:28:37,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:28:37,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:28:37,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:28:37,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:28:37,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:28:37,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:28:37,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:28:37,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:28:37,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:28:37,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:28:37,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:28:37,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:28:37,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:28:37,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:28:37,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:28:37,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:28:37,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:28:37,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:28:37,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:28:37,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:28:37,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:28:37,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:28:37,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:28:37,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:28:37,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:28:37,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:28:37,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:28:37,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:28:37,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:28:37,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:28:37,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:28:37,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:28:37,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:28:37,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:28:37,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:28:37,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:28:37,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:28:37,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:28:37,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:28:37,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:28:37,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:28:37,088 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:28:37,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:28:37,088 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:28:37,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:28:37,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:28:37,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:28:37,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:28:37,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:28:37,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:28:37,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:28:37,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:28:37,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:28:37,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:28:37,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:28:37,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:28:37,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:28:37,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:28:37,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:28:37,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:28:37,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:28:37,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:28:37,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:28:37,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:28:37,417 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:28:37,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-06 05:28:38,540 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:28:38,776 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:28:38,776 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-06 05:28:38,781 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b1f89fe/12d8bb07992540b08041a6653297782a/FLAG58b670b1c [2022-12-06 05:28:38,793 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b1f89fe/12d8bb07992540b08041a6653297782a [2022-12-06 05:28:38,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:28:38,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:28:38,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:28:38,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:28:38,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:28:38,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:28:38" (1/1) ... [2022-12-06 05:28:38,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8afe0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:38, skipping insertion in model container [2022-12-06 05:28:38,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:28:38" (1/1) ... [2022-12-06 05:28:38,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:28:38,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:28:38,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:38,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:38,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:38,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:38,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:38,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:38,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:38,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:38,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:38,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,003 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-horseshoe.wvr.c[3424,3437] [2022-12-06 05:28:39,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:28:39,018 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:28:39,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:39,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:39,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:39,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:39,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:28:39,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:28:39,045 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-horseshoe.wvr.c[3424,3437] [2022-12-06 05:28:39,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:28:39,062 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:28:39,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39 WrapperNode [2022-12-06 05:28:39,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:28:39,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:28:39,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:28:39,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:28:39,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,108 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-06 05:28:39,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:28:39,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:28:39,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:28:39,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:28:39,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:28:39,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:28:39,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:28:39,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:28:39,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (1/1) ... [2022-12-06 05:28:39,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:28:39,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:28:39,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:28:39,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:28:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:28:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:28:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:28:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:28:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:28:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:28:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:28:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:28:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:28:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:28:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:28:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:28:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:28:39,223 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:28:39,384 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:28:39,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:28:39,710 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:28:39,891 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:28:39,892 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 05:28:39,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:28:39 BoogieIcfgContainer [2022-12-06 05:28:39,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:28:39,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:28:39,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:28:39,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:28:39,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:28:38" (1/3) ... [2022-12-06 05:28:39,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaed03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:28:39, skipping insertion in model container [2022-12-06 05:28:39,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:28:39" (2/3) ... [2022-12-06 05:28:39,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaed03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:28:39, skipping insertion in model container [2022-12-06 05:28:39,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:28:39" (3/3) ... [2022-12-06 05:28:39,901 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-12-06 05:28:39,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:28:39,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:28:39,917 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:28:39,998 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:28:40,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 05:28:40,117 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-06 05:28:40,118 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:28:40,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 05:28:40,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 05:28:40,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-06 05:28:40,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:40,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 05:28:40,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 380 flow [2022-12-06 05:28:40,217 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-06 05:28:40,217 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:28:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 18/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 112 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 05:28:40,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 05:28:40,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-06 05:28:47,827 INFO L203 LiptonReduction]: Total number of compositions: 152 [2022-12-06 05:28:47,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:28:47,844 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;@3fb57026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:28:47,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:28:47,850 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 05:28:47,850 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:28:47,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:47,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:47,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 717820976, now seen corresponding path program 1 times [2022-12-06 05:28:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:47,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820119669] [2022-12-06 05:28:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:48,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820119669] [2022-12-06 05:28:48,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820119669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:48,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:48,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:28:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100466135] [2022-12-06 05:28:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:48,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 05:28:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 05:28:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 05:28:48,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 05:28:48,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:48,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:48,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 05:28:48,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:48,261 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2022-12-06 05:28:48,261 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 05:28:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1460 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2022-12-06 05:28:48,270 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-06 05:28:48,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2022-12-06 05:28:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 05:28:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 05:28:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-12-06 05:28:48,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 05:28:48,282 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 31 transitions. [2022-12-06 05:28:48,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 120 flow [2022-12-06 05:28:48,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:28:48,288 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2022-12-06 05:28:48,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-06 05:28:48,294 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2022-12-06 05:28:48,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:48,295 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 60 flow [2022-12-06 05:28:48,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:48,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:48,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 60 flow [2022-12-06 05:28:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 60 flow [2022-12-06 05:28:48,306 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 05:28:48,307 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:28:48,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 5/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2022-12-06 05:28:48,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 27 transitions, 60 flow [2022-12-06 05:28:48,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 05:28:48,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:48,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 05:28:48,374 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 27 transitions, 60 flow [2022-12-06 05:28:48,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:48,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:48,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] [2022-12-06 05:28:48,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:28:48,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1478642962, now seen corresponding path program 1 times [2022-12-06 05:28:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213074494] [2022-12-06 05:28:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:48,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213074494] [2022-12-06 05:28:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213074494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:48,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:28:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51668363] [2022-12-06 05:28:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:48,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:48,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:48,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:48,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:48,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 05:28:48,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:48,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:48,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 05:28:48,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:48,761 INFO L130 PetriNetUnfolder]: 310/461 cut-off events. [2022-12-06 05:28:48,762 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:28:48,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 461 events. 310/461 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1498 event pairs, 162 based on Foata normal form. 16/327 useless extension candidates. Maximal degree in co-relation 149. Up to 430 conditions per place. [2022-12-06 05:28:48,764 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2022-12-06 05:28:48,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 39 transitions, 161 flow [2022-12-06 05:28:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:28:48,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:28:48,768 INFO L175 Difference]: Start difference. First operand has 26 places, 27 transitions, 60 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:28:48,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 39 transitions, 161 flow [2022-12-06 05:28:48,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 161 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:28:48,770 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 78 flow [2022-12-06 05:28:48,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-06 05:28:48,771 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-06 05:28:48,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:48,771 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 78 flow [2022-12-06 05:28:48,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:48,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:48,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 78 flow [2022-12-06 05:28:48,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 78 flow [2022-12-06 05:28:48,780 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-06 05:28:48,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:28:48,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 35 events. 8/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 46. Up to 9 conditions per place. [2022-12-06 05:28:48,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 78 flow [2022-12-06 05:28:48,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 05:28:50,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:50,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1304 [2022-12-06 05:28:50,075 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 74 flow [2022-12-06 05:28:50,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:50,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:50,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:50,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:28:50,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -794323104, now seen corresponding path program 1 times [2022-12-06 05:28:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:50,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989137186] [2022-12-06 05:28:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989137186] [2022-12-06 05:28:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989137186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467861374] [2022-12-06 05:28:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:50,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 05:28:50,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:50,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:50,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 05:28:50,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:50,428 INFO L130 PetriNetUnfolder]: 352/531 cut-off events. [2022-12-06 05:28:50,428 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 05:28:50,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 531 events. 352/531 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1872 event pairs, 189 based on Foata normal form. 24/391 useless extension candidates. Maximal degree in co-relation 1265. Up to 428 conditions per place. [2022-12-06 05:28:50,432 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 23 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2022-12-06 05:28:50,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 186 flow [2022-12-06 05:28:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:28:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:28:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 05:28:50,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2022-12-06 05:28:50,435 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 74 flow. Second operand 5 states and 52 transitions. [2022-12-06 05:28:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 186 flow [2022-12-06 05:28:50,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 178 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:28:50,438 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 88 flow [2022-12-06 05:28:50,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 05:28:50,439 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-06 05:28:50,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:50,439 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 88 flow [2022-12-06 05:28:50,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:50,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:50,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 88 flow [2022-12-06 05:28:50,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 88 flow [2022-12-06 05:28:50,448 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-06 05:28:50,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:28:50,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 50 events. 16/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 3 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2022-12-06 05:28:50,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 88 flow [2022-12-06 05:28:50,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 05:28:50,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:50,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 05:28:50,728 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 84 flow [2022-12-06 05:28:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:50,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:50,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:50,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:28:50,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2020795779, now seen corresponding path program 1 times [2022-12-06 05:28:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:50,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187303504] [2022-12-06 05:28:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187303504] [2022-12-06 05:28:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187303504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:52,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 05:28:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013798524] [2022-12-06 05:28:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:52,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:28:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:28:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:28:52,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 05:28:52,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 84 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:52,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:52,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 05:28:52,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:52,520 INFO L130 PetriNetUnfolder]: 328/511 cut-off events. [2022-12-06 05:28:52,521 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 05:28:52,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 511 events. 328/511 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1791 event pairs, 49 based on Foata normal form. 6/367 useless extension candidates. Maximal degree in co-relation 1364. Up to 434 conditions per place. [2022-12-06 05:28:52,524 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 52 selfloop transitions, 18 changer transitions 2/74 dead transitions. [2022-12-06 05:28:52,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 74 transitions, 368 flow [2022-12-06 05:28:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:28:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:28:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-06 05:28:52,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2022-12-06 05:28:52,526 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 84 flow. Second operand 9 states and 95 transitions. [2022-12-06 05:28:52,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 74 transitions, 368 flow [2022-12-06 05:28:52,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 350 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:52,531 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 220 flow [2022-12-06 05:28:52,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2022-12-06 05:28:52,532 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2022-12-06 05:28:52,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:52,532 INFO L89 Accepts]: Start accepts. Operand has 43 places, 44 transitions, 220 flow [2022-12-06 05:28:52,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:52,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:52,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 44 transitions, 220 flow [2022-12-06 05:28:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 220 flow [2022-12-06 05:28:52,554 INFO L130 PetriNetUnfolder]: 63/148 cut-off events. [2022-12-06 05:28:52,555 INFO L131 PetriNetUnfolder]: For 67/79 co-relation queries the response was YES. [2022-12-06 05:28:52,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 148 events. 63/148 cut-off events. For 67/79 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 561 event pairs, 12 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 376. Up to 74 conditions per place. [2022-12-06 05:28:52,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 44 transitions, 220 flow [2022-12-06 05:28:52,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 05:28:52,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:28:52,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:28:52,799 WARN L322 ript$VariableManager]: TermVariable LBE389 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:52,799 WARN L322 ript$VariableManager]: TermVariable LBE152 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:52,962 WARN L322 ript$VariableManager]: TermVariable LBE389 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:28:52,962 WARN L322 ript$VariableManager]: TermVariable LBE152 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:29:00,382 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:29:00,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7851 [2022-12-06 05:29:00,383 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 224 flow [2022-12-06 05:29:00,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:00,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:00,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:00,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:29:00,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1103019991, now seen corresponding path program 1 times [2022-12-06 05:29:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:00,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101488769] [2022-12-06 05:29:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101488769] [2022-12-06 05:29:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101488769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:00,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:00,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:29:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329120067] [2022-12-06 05:29:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:29:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:29:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:29:00,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 05:29:00,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:00,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:00,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 05:29:00,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:00,663 INFO L130 PetriNetUnfolder]: 445/657 cut-off events. [2022-12-06 05:29:00,663 INFO L131 PetriNetUnfolder]: For 850/869 co-relation queries the response was YES. [2022-12-06 05:29:00,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 657 events. 445/657 cut-off events. For 850/869 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2330 event pairs, 77 based on Foata normal form. 16/473 useless extension candidates. Maximal degree in co-relation 2319. Up to 519 conditions per place. [2022-12-06 05:29:00,669 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 42 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2022-12-06 05:29:00,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 360 flow [2022-12-06 05:29:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:29:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:29:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:29:00,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 05:29:00,673 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 224 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:29:00,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 360 flow [2022-12-06 05:29:00,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 312 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:00,680 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 196 flow [2022-12-06 05:29:00,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=3, PETRI_FLOW=196, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 05:29:00,682 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-06 05:29:00,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:00,682 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 196 flow [2022-12-06 05:29:00,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:00,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:00,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 196 flow [2022-12-06 05:29:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 196 flow [2022-12-06 05:29:00,700 INFO L130 PetriNetUnfolder]: 49/134 cut-off events. [2022-12-06 05:29:00,700 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-06 05:29:00,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 134 events. 49/134 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 521 event pairs, 5 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 223. Up to 39 conditions per place. [2022-12-06 05:29:00,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 196 flow [2022-12-06 05:29:00,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-06 05:29:00,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [889] $Ultimate##0-->L121-3: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (select (select |v_#memory_int_308| v_~q1~0.base_120) (+ v_~q1~0.offset_120 (* v_~q1_front~0_125 4))) |v_thread2Thread1of1ForFork0_~j~0#1_65|) (= (+ v_~q2_back~0_163 1) v_~q2_back~0_162) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~q1_back~0_204) (< v_~q1_front~0_125 v_~n1~0_135)) 1 0) 0)) (= v_~s~0_95 (+ v_~s~0_96 |v_thread2Thread1of1ForFork0_~j~0#1_65|)) (= |v_thread2Thread1of1ForFork0_#res#1.base_27| 0) (= |v_ULTIMATE.start_main_#t~pre23#1_65| |v_#pthreadsForks_119|) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_65| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (= (+ (select (select |v_#memory_int_308| v_~q2~0.base_117) (+ v_~q2~0.offset_119 (* 4 v_~q2_back~0_163))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_65|) 1 0)) (= (store |v_#memory_int_308| |v_ULTIMATE.start_main_~#t3~0#1.base_67| (store (select |v_#memory_int_308| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) |v_ULTIMATE.start_main_~#t3~0#1.offset_67| |v_ULTIMATE.start_main_#t~pre23#1_65|)) |v_#memory_int_307|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_27| 0) (not (= (ite (and (<= 0 v_~q2_back~0_163) (< v_~q2_back~0_163 v_~n2~0_120)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_120, ~n2~0=v_~n2~0_120, ~q1_front~0=v_~q1_front~0_125, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, ~q2~0.offset=v_~q2~0.offset_119, ~n1~0=v_~n1~0_135, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, #pthreadsForks=|v_#pthreadsForks_119|, ~q1_back~0=v_~q1_back~0_204, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_308|, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_163, ~s~0=v_~s~0_96} OutVars{thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_31|, ~q1_front~0=v_~q1_front~0_124, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_27|, ~q2~0.offset=v_~q2~0.offset_119, ~n1~0=v_~n1~0_135, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_70|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_31|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_53|, #pthreadsForks=|v_#pthreadsForks_118|, ~q1_back~0=v_~q1_back~0_204, ~q1~0.base=v_~q1~0.base_120, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_162, ~s~0=v_~s~0_95, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_65|, ~q1~0.offset=v_~q1~0.offset_120, ~n2~0=v_~n2~0_120, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_23|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_23|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_27|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_65|, #memory_int=|v_#memory_int_307|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre23#1, #memory_int, ~q2_back~0, ~s~0] [2022-12-06 05:29:01,156 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:01,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 05:29:01,157 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 202 flow [2022-12-06 05:29:01,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:01,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:01,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:01,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:29:01,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1967514729, now seen corresponding path program 1 times [2022-12-06 05:29:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:01,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358578710] [2022-12-06 05:29:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:02,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358578710] [2022-12-06 05:29:02,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358578710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:02,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:02,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:29:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625745711] [2022-12-06 05:29:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:29:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:29:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:29:02,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 05:29:02,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:02,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:02,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 05:29:02,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:02,494 INFO L130 PetriNetUnfolder]: 419/648 cut-off events. [2022-12-06 05:29:02,494 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2022-12-06 05:29:02,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 648 events. 419/648 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2391 event pairs, 90 based on Foata normal form. 1/463 useless extension candidates. Maximal degree in co-relation 914. Up to 599 conditions per place. [2022-12-06 05:29:02,500 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 49 selfloop transitions, 8 changer transitions 2/61 dead transitions. [2022-12-06 05:29:02,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 401 flow [2022-12-06 05:29:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:29:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:29:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 05:29:02,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:29:02,501 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 202 flow. Second operand 5 states and 66 transitions. [2022-12-06 05:29:02,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 401 flow [2022-12-06 05:29:02,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 361 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:02,506 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 217 flow [2022-12-06 05:29:02,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2022-12-06 05:29:02,508 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2022-12-06 05:29:02,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:02,508 INFO L89 Accepts]: Start accepts. Operand has 43 places, 42 transitions, 217 flow [2022-12-06 05:29:02,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:02,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:02,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 42 transitions, 217 flow [2022-12-06 05:29:02,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 217 flow [2022-12-06 05:29:02,527 INFO L130 PetriNetUnfolder]: 62/162 cut-off events. [2022-12-06 05:29:02,528 INFO L131 PetriNetUnfolder]: For 136/140 co-relation queries the response was YES. [2022-12-06 05:29:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 162 events. 62/162 cut-off events. For 136/140 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 700 event pairs, 6 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 314. Up to 66 conditions per place. [2022-12-06 05:29:02,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 42 transitions, 217 flow [2022-12-06 05:29:02,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 05:29:02,547 WARN L322 ript$VariableManager]: TermVariable LBE389 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:29:02,547 WARN L322 ript$VariableManager]: TermVariable LBE152 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:29:02,704 WARN L322 ript$VariableManager]: TermVariable LBE389 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:29:02,704 WARN L322 ript$VariableManager]: TermVariable LBE152 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:29:02,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:02,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 05:29:02,800 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 211 flow [2022-12-06 05:29:02,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:02,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:02,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:02,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:29:02,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 161673733, now seen corresponding path program 1 times [2022-12-06 05:29:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:02,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401435112] [2022-12-06 05:29:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:02,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401435112] [2022-12-06 05:29:02,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401435112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:02,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:02,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381468752] [2022-12-06 05:29:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:02,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:29:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:29:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:29:02,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:29:02,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:02,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:02,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:29:02,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:03,122 INFO L130 PetriNetUnfolder]: 728/1092 cut-off events. [2022-12-06 05:29:03,123 INFO L131 PetriNetUnfolder]: For 1908/1944 co-relation queries the response was YES. [2022-12-06 05:29:03,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 1092 events. 728/1092 cut-off events. For 1908/1944 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4439 event pairs, 101 based on Foata normal form. 84/919 useless extension candidates. Maximal degree in co-relation 2513. Up to 416 conditions per place. [2022-12-06 05:29:03,131 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 50 selfloop transitions, 11 changer transitions 4/67 dead transitions. [2022-12-06 05:29:03,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 419 flow [2022-12-06 05:29:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:29:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:29:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 05:29:03,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 05:29:03,133 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 211 flow. Second operand 4 states and 73 transitions. [2022-12-06 05:29:03,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 419 flow [2022-12-06 05:29:03,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 404 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:29:03,143 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 215 flow [2022-12-06 05:29:03,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 05:29:03,144 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-12-06 05:29:03,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:03,144 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 215 flow [2022-12-06 05:29:03,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:03,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:03,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 215 flow [2022-12-06 05:29:03,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 215 flow [2022-12-06 05:29:03,170 INFO L130 PetriNetUnfolder]: 64/178 cut-off events. [2022-12-06 05:29:03,170 INFO L131 PetriNetUnfolder]: For 246/270 co-relation queries the response was YES. [2022-12-06 05:29:03,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 178 events. 64/178 cut-off events. For 246/270 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 749 event pairs, 5 based on Foata normal form. 4/137 useless extension candidates. Maximal degree in co-relation 392. Up to 80 conditions per place. [2022-12-06 05:29:03,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 215 flow [2022-12-06 05:29:03,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 05:29:03,174 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:03,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:29:03,176 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 215 flow [2022-12-06 05:29:03,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:03,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:03,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:03,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:29:03,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2067720560, now seen corresponding path program 1 times [2022-12-06 05:29:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:03,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528922338] [2022-12-06 05:29:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:04,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528922338] [2022-12-06 05:29:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528922338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586673089] [2022-12-06 05:29:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:04,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:04,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:04,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:04,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:04,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:04,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:04,718 INFO L130 PetriNetUnfolder]: 603/962 cut-off events. [2022-12-06 05:29:04,719 INFO L131 PetriNetUnfolder]: For 2154/2154 co-relation queries the response was YES. [2022-12-06 05:29:04,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 962 events. 603/962 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3938 event pairs, 210 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 2657. Up to 895 conditions per place. [2022-12-06 05:29:04,727 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 2 changer transitions 25/69 dead transitions. [2022-12-06 05:29:04,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 458 flow [2022-12-06 05:29:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-06 05:29:04,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 05:29:04,728 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 215 flow. Second operand 7 states and 75 transitions. [2022-12-06 05:29:04,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 458 flow [2022-12-06 05:29:04,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 406 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-06 05:29:04,735 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 187 flow [2022-12-06 05:29:04,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-06 05:29:04,737 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-06 05:29:04,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:04,737 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 187 flow [2022-12-06 05:29:04,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:04,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:04,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 187 flow [2022-12-06 05:29:04,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 187 flow [2022-12-06 05:29:04,761 INFO L130 PetriNetUnfolder]: 82/223 cut-off events. [2022-12-06 05:29:04,761 INFO L131 PetriNetUnfolder]: For 118/122 co-relation queries the response was YES. [2022-12-06 05:29:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 223 events. 82/223 cut-off events. For 118/122 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1030 event pairs, 8 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 614. Up to 74 conditions per place. [2022-12-06 05:29:04,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 187 flow [2022-12-06 05:29:04,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 05:29:04,765 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:04,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:29:04,767 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 187 flow [2022-12-06 05:29:04,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:04,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:04,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] [2022-12-06 05:29:04,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:29:04,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1321066874, now seen corresponding path program 1 times [2022-12-06 05:29:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439259513] [2022-12-06 05:29:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439259513] [2022-12-06 05:29:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439259513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:29:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802049481] [2022-12-06 05:29:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:29:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:29:04,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:29:04,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:29:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:05,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:29:05,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:29:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:05,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:29:05,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802049481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:05,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:29:05,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:29:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919236648] [2022-12-06 05:29:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:29:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:29:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:29:05,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 05:29:05,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:05,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:05,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 05:29:05,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:05,304 INFO L130 PetriNetUnfolder]: 1052/1630 cut-off events. [2022-12-06 05:29:05,305 INFO L131 PetriNetUnfolder]: For 1416/1416 co-relation queries the response was YES. [2022-12-06 05:29:05,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5787 conditions, 1630 events. 1052/1630 cut-off events. For 1416/1416 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7528 event pairs, 411 based on Foata normal form. 134/1251 useless extension candidates. Maximal degree in co-relation 5756. Up to 907 conditions per place. [2022-12-06 05:29:05,315 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 64 selfloop transitions, 2 changer transitions 4/72 dead transitions. [2022-12-06 05:29:05,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 475 flow [2022-12-06 05:29:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:29:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:29:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 05:29:05,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 05:29:05,317 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 187 flow. Second operand 4 states and 65 transitions. [2022-12-06 05:29:05,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 475 flow [2022-12-06 05:29:05,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 72 transitions, 449 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-06 05:29:05,321 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 179 flow [2022-12-06 05:29:05,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 05:29:05,322 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 05:29:05,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:05,322 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 179 flow [2022-12-06 05:29:05,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:05,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:05,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 179 flow [2022-12-06 05:29:05,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 179 flow [2022-12-06 05:29:05,340 INFO L130 PetriNetUnfolder]: 52/169 cut-off events. [2022-12-06 05:29:05,340 INFO L131 PetriNetUnfolder]: For 65/77 co-relation queries the response was YES. [2022-12-06 05:29:05,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 169 events. 52/169 cut-off events. For 65/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 734 event pairs, 4 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 238. Up to 50 conditions per place. [2022-12-06 05:29:05,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 179 flow [2022-12-06 05:29:05,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:05,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:05,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:29:05,344 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 179 flow [2022-12-06 05:29:05,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:05,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:05,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:05,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:29:05,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:29:05,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1449919355, now seen corresponding path program 1 times [2022-12-06 05:29:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:05,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729504661] [2022-12-06 05:29:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:06,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729504661] [2022-12-06 05:29:06,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729504661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:06,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:06,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599448243] [2022-12-06 05:29:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:06,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:06,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 05:29:06,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 179 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:06,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:06,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 05:29:06,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:07,286 INFO L130 PetriNetUnfolder]: 876/1358 cut-off events. [2022-12-06 05:29:07,286 INFO L131 PetriNetUnfolder]: For 1673/1721 co-relation queries the response was YES. [2022-12-06 05:29:07,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 1358 events. 876/1358 cut-off events. For 1673/1721 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6080 event pairs, 427 based on Foata normal form. 4/942 useless extension candidates. Maximal degree in co-relation 3576. Up to 1281 conditions per place. [2022-12-06 05:29:07,296 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 38 selfloop transitions, 9 changer transitions 26/75 dead transitions. [2022-12-06 05:29:07,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 449 flow [2022-12-06 05:29:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:29:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:29:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-06 05:29:07,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-06 05:29:07,297 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 179 flow. Second operand 8 states and 82 transitions. [2022-12-06 05:29:07,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 449 flow [2022-12-06 05:29:07,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 430 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:07,301 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 251 flow [2022-12-06 05:29:07,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 05:29:07,302 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2022-12-06 05:29:07,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:07,303 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 251 flow [2022-12-06 05:29:07,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:07,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:07,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 251 flow [2022-12-06 05:29:07,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 251 flow [2022-12-06 05:29:07,323 INFO L130 PetriNetUnfolder]: 57/190 cut-off events. [2022-12-06 05:29:07,323 INFO L131 PetriNetUnfolder]: For 106/116 co-relation queries the response was YES. [2022-12-06 05:29:07,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 190 events. 57/190 cut-off events. For 106/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 876 event pairs, 4 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 496. Up to 51 conditions per place. [2022-12-06 05:29:07,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 251 flow [2022-12-06 05:29:07,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 05:29:07,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:07,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [875] $Ultimate##0-->L70: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~q1_front~0_107 1) v_~q1_front~0_106) (= (select (select |v_#memory_int_245| v_~q1~0.base_92) (+ v_~q1~0.offset_92 (* v_~q1_front~0_107 4))) |v_thread2Thread1of1ForFork0_~j~0#1_57|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (and (< v_~q1_front~0_107 v_~n1~0_117) (< v_~q1_front~0_107 v_~q1_back~0_181) (<= 0 v_~q1_front~0_107)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|)) InVars {~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_107, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, #memory_int=|v_#memory_int_245|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_57|, ~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_106, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_19|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] [2022-12-06 05:29:07,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:29:07,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [898] L47-4-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_329| v_~q1~0.base_130))) (and (= (+ v_~q2_back~0_175 1) v_~q2_back~0_174) (= (ite (= (select .cse0 (+ v_~q1~0.offset_130 (* v_~q1_back~0_225 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_50| v_~N~0_91)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_34| 0) (= (+ v_~q1_front~0_137 1) v_~q1_front~0_136) (= |v_thread2Thread1of1ForFork0_#res#1.base_31| 0) (<= |v_thread2Thread1of1ForFork0_~j~0#1_71| 0) (not (= (ite (and (<= 0 v_~q2_back~0_175) (< v_~q2_back~0_175 v_~n2~0_128)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_34| 0) (not (= (ite (and (< v_~q1_front~0_137 v_~n1~0_145) (< v_~q1_front~0_137 v_~q1_back~0_224) (<= 0 v_~q1_front~0_137)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_31| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_71| v_~s~0_104) v_~s~0_103) (= (+ v_~q1_back~0_225 1) v_~q1_back~0_224) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|) (= (select .cse0 (+ v_~q1~0.offset_130 (* v_~q1_front~0_137 4))) |v_thread2Thread1of1ForFork0_~j~0#1_71|) (= (ite (= (+ (select (select |v_#memory_int_329| v_~q2~0.base_125) (+ v_~q2~0.offset_127 (* 4 v_~q2_back~0_175))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_71|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (not (= (ite (and (< v_~q1_back~0_225 v_~n1~0_145) (<= 0 v_~q1_back~0_225)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_130, ~n2~0=v_~n2~0_128, ~q1_front~0=v_~q1_front~0_137, ~q2~0.offset=v_~q2~0.offset_127, ~n1~0=v_~n1~0_145, ~N~0=v_~N~0_91, ~q1_back~0=v_~q1_back~0_225, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_50|, ~q1~0.base=v_~q1~0.base_130, #memory_int=|v_#memory_int_329|, ~q2~0.base=v_~q2~0.base_125, ~q2_back~0=v_~q2_back~0_175, ~s~0=v_~s~0_104} OutVars{thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_35|, ~q1_front~0=v_~q1_front~0_136, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_31|, ~q2~0.offset=v_~q2~0.offset_127, ~n1~0=v_~n1~0_145, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_35|, ~q1_back~0=v_~q1_back~0_224, ~q1~0.base=v_~q1~0.base_130, ~q2~0.base=v_~q2~0.base_125, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_34|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_34|, ~q2_back~0=v_~q2_back~0_174, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_54|, ~s~0=v_~s~0_103, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_71|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_42|, ~q1~0.offset=v_~q1~0.offset_130, ~n2~0=v_~n2~0_128, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_42|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_29|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_29|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_50|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|, #memory_int=|v_#memory_int_329|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~0#1, thread1Thread1of1ForFork2_#t~mem4#1, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, ~q2_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:13,863 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:29:13,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6561 [2022-12-06 05:29:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 269 flow [2022-12-06 05:29:13,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:13,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:13,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:29:13,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -888504779, now seen corresponding path program 1 times [2022-12-06 05:29:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770458496] [2022-12-06 05:29:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:15,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770458496] [2022-12-06 05:29:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770458496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:15,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:15,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445278098] [2022-12-06 05:29:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:15,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:15,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:15,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 05:29:15,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 269 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:15,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:15,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 05:29:15,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:15,676 INFO L130 PetriNetUnfolder]: 869/1343 cut-off events. [2022-12-06 05:29:15,676 INFO L131 PetriNetUnfolder]: For 1336/1387 co-relation queries the response was YES. [2022-12-06 05:29:15,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 1343 events. 869/1343 cut-off events. For 1336/1387 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5920 event pairs, 428 based on Foata normal form. 5/929 useless extension candidates. Maximal degree in co-relation 4732. Up to 1278 conditions per place. [2022-12-06 05:29:15,686 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 38 selfloop transitions, 3 changer transitions 26/69 dead transitions. [2022-12-06 05:29:15,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 497 flow [2022-12-06 05:29:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 05:29:15,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3203463203463203 [2022-12-06 05:29:15,687 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 269 flow. Second operand 7 states and 74 transitions. [2022-12-06 05:29:15,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 497 flow [2022-12-06 05:29:15,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 461 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:15,692 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 235 flow [2022-12-06 05:29:15,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2022-12-06 05:29:15,692 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 05:29:15,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:15,693 INFO L89 Accepts]: Start accepts. Operand has 53 places, 40 transitions, 235 flow [2022-12-06 05:29:15,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:15,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:15,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 40 transitions, 235 flow [2022-12-06 05:29:15,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 235 flow [2022-12-06 05:29:15,716 INFO L130 PetriNetUnfolder]: 72/218 cut-off events. [2022-12-06 05:29:15,716 INFO L131 PetriNetUnfolder]: For 156/166 co-relation queries the response was YES. [2022-12-06 05:29:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 218 events. 72/218 cut-off events. For 156/166 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 993 event pairs, 7 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 580. Up to 67 conditions per place. [2022-12-06 05:29:15,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 235 flow [2022-12-06 05:29:15,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:15,724 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:15,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:29:15,725 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 235 flow [2022-12-06 05:29:15,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:15,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:15,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:15,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:29:15,727 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -268484990, now seen corresponding path program 1 times [2022-12-06 05:29:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:15,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066050731] [2022-12-06 05:29:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:16,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066050731] [2022-12-06 05:29:16,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066050731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:16,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:16,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568707105] [2022-12-06 05:29:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:29:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:29:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:29:16,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:16,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:16,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:16,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:16,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:16,612 INFO L130 PetriNetUnfolder]: 853/1315 cut-off events. [2022-12-06 05:29:16,612 INFO L131 PetriNetUnfolder]: For 1343/1391 co-relation queries the response was YES. [2022-12-06 05:29:16,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1315 events. 853/1315 cut-off events. For 1343/1391 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5796 event pairs, 431 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 4622. Up to 1265 conditions per place. [2022-12-06 05:29:16,625 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 4 changer transitions 17/59 dead transitions. [2022-12-06 05:29:16,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 411 flow [2022-12-06 05:29:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:29:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:29:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 05:29:16,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2022-12-06 05:29:16,626 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 235 flow. Second operand 5 states and 59 transitions. [2022-12-06 05:29:16,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 411 flow [2022-12-06 05:29:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 377 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-06 05:29:16,629 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:16,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 05:29:16,630 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-06 05:29:16,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:16,630 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:16,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:16,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:16,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:16,652 INFO L130 PetriNetUnfolder]: 70/213 cut-off events. [2022-12-06 05:29:16,652 INFO L131 PetriNetUnfolder]: For 83/93 co-relation queries the response was YES. [2022-12-06 05:29:16,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 213 events. 70/213 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 966 event pairs, 7 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 546. Up to 67 conditions per place. [2022-12-06 05:29:16,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:16,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:16,655 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:16,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 05:29:16,656 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:16,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:16,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:16,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:16,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:29:16,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash 718580273, now seen corresponding path program 1 times [2022-12-06 05:29:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:16,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52139673] [2022-12-06 05:29:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:18,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52139673] [2022-12-06 05:29:18,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52139673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:18,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:18,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120066994] [2022-12-06 05:29:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:18,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:18,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 213 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:18,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:18,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:18,633 INFO L130 PetriNetUnfolder]: 866/1339 cut-off events. [2022-12-06 05:29:18,633 INFO L131 PetriNetUnfolder]: For 1087/1095 co-relation queries the response was YES. [2022-12-06 05:29:18,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 1339 events. 866/1339 cut-off events. For 1087/1095 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5893 event pairs, 424 based on Foata normal form. 5/930 useless extension candidates. Maximal degree in co-relation 4655. Up to 1278 conditions per place. [2022-12-06 05:29:18,642 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 37 selfloop transitions, 9 changer transitions 21/69 dead transitions. [2022-12-06 05:29:18,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 453 flow [2022-12-06 05:29:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 05:29:18,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2022-12-06 05:29:18,644 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 213 flow. Second operand 7 states and 73 transitions. [2022-12-06 05:29:18,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 453 flow [2022-12-06 05:29:18,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 438 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:18,649 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 283 flow [2022-12-06 05:29:18,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 05:29:18,650 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 05:29:18,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:18,650 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 283 flow [2022-12-06 05:29:18,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:18,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:18,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 283 flow [2022-12-06 05:29:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 283 flow [2022-12-06 05:29:18,674 INFO L130 PetriNetUnfolder]: 72/221 cut-off events. [2022-12-06 05:29:18,674 INFO L131 PetriNetUnfolder]: For 137/144 co-relation queries the response was YES. [2022-12-06 05:29:18,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 221 events. 72/221 cut-off events. For 137/144 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1010 event pairs, 6 based on Foata normal form. 2/162 useless extension candidates. Maximal degree in co-relation 600. Up to 67 conditions per place. [2022-12-06 05:29:18,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 283 flow [2022-12-06 05:29:18,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:18,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [902] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_77| (+ (select (select |v_#memory_int_349| v_~q2~0.base_135) (+ v_~q2~0.offset_137 (* 4 v_~q2_back~0_187))) 1)) 1 0)) (= (select (select |v_#memory_int_349| v_~q1~0.base_140) (+ (* v_~q1_front~0_153 4) v_~q1~0.offset_140)) |v_thread2Thread1of1ForFork0_~j~0#1_77|) (not (= (ite (and (< v_~q1_front~0_153 v_~n1~0_155) (< v_~q1_front~0_153 v_~q1_back~0_240) (<= 0 v_~q1_front~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_35| 0) (= v_~q1_front~0_152 (+ v_~q1_front~0_153 1)) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_77| v_~s~0_116) v_~s~0_115) (= (+ v_~q2_back~0_187 1) v_~q2_back~0_186) (<= |v_thread2Thread1of1ForFork0_~j~0#1_77| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_67| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_187) (< v_~q2_back~0_187 v_~n2~0_136)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|)) InVars {~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_136, ~q1_front~0=v_~q1_front~0_153, ~q1_back~0=v_~q1_back~0_240, ~q2~0.offset=v_~q2~0.offset_137, ~n1~0=v_~n1~0_155, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_349|, ~q2~0.base=v_~q2~0.base_135, ~q2_back~0=v_~q2_back~0_187, ~s~0=v_~s~0_116} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_77|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_39|, ~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_136, ~q1_front~0=v_~q1_front~0_152, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_35|, ~q2~0.offset=v_~q2~0.offset_137, ~n1~0=v_~n1~0_155, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_35|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_35|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_39|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_35|, ~q1_back~0=v_~q1_back~0_240, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_349|, ~q2~0.base=v_~q2~0.base_135, ~q2_back~0=v_~q2_back~0_186, ~s~0=v_~s~0_115} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:18,911 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:18,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 05:29:18,912 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 275 flow [2022-12-06 05:29:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:18,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:18,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:29:18,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -781079989, now seen corresponding path program 1 times [2022-12-06 05:29:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845395103] [2022-12-06 05:29:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845395103] [2022-12-06 05:29:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845395103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:20,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:20,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:29:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748377003] [2022-12-06 05:29:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:20,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:29:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:29:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:29:20,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:20,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:20,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:20,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:20,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:20,406 INFO L130 PetriNetUnfolder]: 863/1329 cut-off events. [2022-12-06 05:29:20,406 INFO L131 PetriNetUnfolder]: For 1360/1442 co-relation queries the response was YES. [2022-12-06 05:29:20,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 1329 events. 863/1329 cut-off events. For 1360/1442 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5867 event pairs, 429 based on Foata normal form. 5/916 useless extension candidates. Maximal degree in co-relation 4703. Up to 1281 conditions per place. [2022-12-06 05:29:20,416 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 3 changer transitions 17/62 dead transitions. [2022-12-06 05:29:20,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 452 flow [2022-12-06 05:29:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:29:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:29:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 05:29:20,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3279569892473118 [2022-12-06 05:29:20,418 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 275 flow. Second operand 6 states and 61 transitions. [2022-12-06 05:29:20,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 452 flow [2022-12-06 05:29:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 420 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 05:29:20,422 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 246 flow [2022-12-06 05:29:20,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:29:20,423 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 05:29:20,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:20,423 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 246 flow [2022-12-06 05:29:20,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:20,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:20,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 246 flow [2022-12-06 05:29:20,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 246 flow [2022-12-06 05:29:20,442 INFO L130 PetriNetUnfolder]: 55/184 cut-off events. [2022-12-06 05:29:20,442 INFO L131 PetriNetUnfolder]: For 101/111 co-relation queries the response was YES. [2022-12-06 05:29:20,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 184 events. 55/184 cut-off events. For 101/111 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 830 event pairs, 3 based on Foata normal form. 2/135 useless extension candidates. Maximal degree in co-relation 474. Up to 50 conditions per place. [2022-12-06 05:29:20,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 246 flow [2022-12-06 05:29:20,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:20,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:20,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:29:20,446 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 246 flow [2022-12-06 05:29:20,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:20,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:20,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:20,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:29:20,447 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1837855997, now seen corresponding path program 2 times [2022-12-06 05:29:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:20,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075338457] [2022-12-06 05:29:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:21,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075338457] [2022-12-06 05:29:21,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075338457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:21,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:21,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836578349] [2022-12-06 05:29:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:21,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:21,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:21,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:21,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 246 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:21,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:21,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:21,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:21,646 INFO L130 PetriNetUnfolder]: 870/1346 cut-off events. [2022-12-06 05:29:21,647 INFO L131 PetriNetUnfolder]: For 1273/1321 co-relation queries the response was YES. [2022-12-06 05:29:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4747 conditions, 1346 events. 870/1346 cut-off events. For 1273/1321 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5930 event pairs, 439 based on Foata normal form. 4/933 useless extension candidates. Maximal degree in co-relation 4713. Up to 1277 conditions per place. [2022-12-06 05:29:21,660 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 36 selfloop transitions, 3 changer transitions 31/72 dead transitions. [2022-12-06 05:29:21,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 483 flow [2022-12-06 05:29:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-06 05:29:21,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 05:29:21,662 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 246 flow. Second operand 7 states and 75 transitions. [2022-12-06 05:29:21,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 483 flow [2022-12-06 05:29:21,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 467 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 05:29:21,665 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 216 flow [2022-12-06 05:29:21,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2022-12-06 05:29:21,666 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2022-12-06 05:29:21,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:21,667 INFO L89 Accepts]: Start accepts. Operand has 56 places, 40 transitions, 216 flow [2022-12-06 05:29:21,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:21,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:21,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 40 transitions, 216 flow [2022-12-06 05:29:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 216 flow [2022-12-06 05:29:21,684 INFO L130 PetriNetUnfolder]: 53/171 cut-off events. [2022-12-06 05:29:21,684 INFO L131 PetriNetUnfolder]: For 97/103 co-relation queries the response was YES. [2022-12-06 05:29:21,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 171 events. 53/171 cut-off events. For 97/103 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 740 event pairs, 4 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 449. Up to 50 conditions per place. [2022-12-06 05:29:21,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 216 flow [2022-12-06 05:29:21,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:26,309 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:26,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4643 [2022-12-06 05:29:26,310 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 236 flow [2022-12-06 05:29:26,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:26,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:26,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:29:26,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -111666857, now seen corresponding path program 1 times [2022-12-06 05:29:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274635953] [2022-12-06 05:29:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274635953] [2022-12-06 05:29:27,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274635953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:27,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:27,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177431606] [2022-12-06 05:29:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:27,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:27,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:27,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 236 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:27,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:27,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:27,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:27,672 INFO L130 PetriNetUnfolder]: 923/1413 cut-off events. [2022-12-06 05:29:27,672 INFO L131 PetriNetUnfolder]: For 1310/1310 co-relation queries the response was YES. [2022-12-06 05:29:27,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5050 conditions, 1413 events. 923/1413 cut-off events. For 1310/1310 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6166 event pairs, 456 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 5014. Up to 1335 conditions per place. [2022-12-06 05:29:27,679 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 40 selfloop transitions, 7 changer transitions 28/77 dead transitions. [2022-12-06 05:29:27,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 525 flow [2022-12-06 05:29:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 05:29:27,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-06 05:29:27,681 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 236 flow. Second operand 7 states and 82 transitions. [2022-12-06 05:29:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 525 flow [2022-12-06 05:29:27,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 468 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-06 05:29:27,685 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 249 flow [2022-12-06 05:29:27,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-06 05:29:27,686 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-06 05:29:27,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:27,686 INFO L89 Accepts]: Start accepts. Operand has 52 places, 43 transitions, 249 flow [2022-12-06 05:29:27,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:27,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:27,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 249 flow [2022-12-06 05:29:27,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 249 flow [2022-12-06 05:29:27,707 INFO L130 PetriNetUnfolder]: 53/190 cut-off events. [2022-12-06 05:29:27,707 INFO L131 PetriNetUnfolder]: For 105/107 co-relation queries the response was YES. [2022-12-06 05:29:27,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 190 events. 53/190 cut-off events. For 105/107 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 890 event pairs, 5 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 487. Up to 52 conditions per place. [2022-12-06 05:29:27,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 249 flow [2022-12-06 05:29:27,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-06 05:29:27,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:27,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:27,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 05:29:27,807 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 247 flow [2022-12-06 05:29:27,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:27,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:27,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:27,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:29:27,807 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -68913047, now seen corresponding path program 1 times [2022-12-06 05:29:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207946945] [2022-12-06 05:29:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207946945] [2022-12-06 05:29:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207946945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:29,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:29,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392310568] [2022-12-06 05:29:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:29,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:29,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:29,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:29,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:29,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:29,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:29,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:29,617 INFO L130 PetriNetUnfolder]: 924/1428 cut-off events. [2022-12-06 05:29:29,617 INFO L131 PetriNetUnfolder]: For 1229/1229 co-relation queries the response was YES. [2022-12-06 05:29:29,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5078 conditions, 1428 events. 924/1428 cut-off events. For 1229/1229 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6315 event pairs, 460 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 5044. Up to 1357 conditions per place. [2022-12-06 05:29:29,626 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 38 selfloop transitions, 6 changer transitions 37/83 dead transitions. [2022-12-06 05:29:29,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 563 flow [2022-12-06 05:29:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:29:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:29:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-12-06 05:29:29,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-06 05:29:29,627 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 247 flow. Second operand 8 states and 87 transitions. [2022-12-06 05:29:29,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 563 flow [2022-12-06 05:29:29,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 523 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:29:29,632 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 274 flow [2022-12-06 05:29:29,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-12-06 05:29:29,632 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-12-06 05:29:29,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:29,632 INFO L89 Accepts]: Start accepts. Operand has 57 places, 45 transitions, 274 flow [2022-12-06 05:29:29,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:29,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:29,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 274 flow [2022-12-06 05:29:29,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 274 flow [2022-12-06 05:29:29,659 INFO L130 PetriNetUnfolder]: 54/198 cut-off events. [2022-12-06 05:29:29,659 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-06 05:29:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 198 events. 54/198 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 929 event pairs, 5 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 519. Up to 51 conditions per place. [2022-12-06 05:29:29,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 274 flow [2022-12-06 05:29:29,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:29:29,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:29:32,574 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:29:32,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2943 [2022-12-06 05:29:32,575 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 274 flow [2022-12-06 05:29:32,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:32,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:32,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:32,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:29:32,575 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -353553322, now seen corresponding path program 1 times [2022-12-06 05:29:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180716517] [2022-12-06 05:29:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180716517] [2022-12-06 05:29:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180716517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:33,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:29:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578527790] [2022-12-06 05:29:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:29:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:29:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:29:33,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 05:29:33,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:33,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:33,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 05:29:33,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:33,773 INFO L130 PetriNetUnfolder]: 921/1422 cut-off events. [2022-12-06 05:29:33,774 INFO L131 PetriNetUnfolder]: For 1172/1175 co-relation queries the response was YES. [2022-12-06 05:29:33,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 1422 events. 921/1422 cut-off events. For 1172/1175 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6204 event pairs, 416 based on Foata normal form. 1/984 useless extension candidates. Maximal degree in co-relation 5013. Up to 1350 conditions per place. [2022-12-06 05:29:33,782 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 47 selfloop transitions, 7 changer transitions 17/73 dead transitions. [2022-12-06 05:29:33,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 525 flow [2022-12-06 05:29:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:29:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:29:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 05:29:33,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-06 05:29:33,784 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 274 flow. Second operand 6 states and 74 transitions. [2022-12-06 05:29:33,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 525 flow [2022-12-06 05:29:33,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 475 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-06 05:29:33,789 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 255 flow [2022-12-06 05:29:33,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-06 05:29:33,789 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-06 05:29:33,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:33,790 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 255 flow [2022-12-06 05:29:33,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:33,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:33,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 255 flow [2022-12-06 05:29:33,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 255 flow [2022-12-06 05:29:33,815 INFO L130 PetriNetUnfolder]: 58/196 cut-off events. [2022-12-06 05:29:33,815 INFO L131 PetriNetUnfolder]: For 118/120 co-relation queries the response was YES. [2022-12-06 05:29:33,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 196 events. 58/196 cut-off events. For 118/120 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 903 event pairs, 4 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 522. Up to 50 conditions per place. [2022-12-06 05:29:33,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 255 flow [2022-12-06 05:29:33,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:29:33,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:33,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:29:36,923 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:36,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3133 [2022-12-06 05:29:36,923 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 269 flow [2022-12-06 05:29:36,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:36,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:36,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:36,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:29:36,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:36,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1304048014, now seen corresponding path program 1 times [2022-12-06 05:29:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:36,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464774358] [2022-12-06 05:29:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:37,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:37,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464774358] [2022-12-06 05:29:37,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464774358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:37,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:37,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:29:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746253712] [2022-12-06 05:29:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:29:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:29:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:29:37,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:37,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:37,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:37,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:37,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:38,116 INFO L130 PetriNetUnfolder]: 876/1357 cut-off events. [2022-12-06 05:29:38,116 INFO L131 PetriNetUnfolder]: For 1319/1323 co-relation queries the response was YES. [2022-12-06 05:29:38,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 1357 events. 876/1357 cut-off events. For 1319/1323 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6050 event pairs, 427 based on Foata normal form. 1/943 useless extension candidates. Maximal degree in co-relation 4821. Up to 1279 conditions per place. [2022-12-06 05:29:38,123 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 39 selfloop transitions, 9 changer transitions 26/76 dead transitions. [2022-12-06 05:29:38,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 531 flow [2022-12-06 05:29:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-06 05:29:38,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37327188940092165 [2022-12-06 05:29:38,128 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 269 flow. Second operand 7 states and 81 transitions. [2022-12-06 05:29:38,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 531 flow [2022-12-06 05:29:38,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 477 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 05:29:38,131 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 273 flow [2022-12-06 05:29:38,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-06 05:29:38,132 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-06 05:29:38,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:38,132 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 273 flow [2022-12-06 05:29:38,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:38,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:38,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 273 flow [2022-12-06 05:29:38,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 273 flow [2022-12-06 05:29:38,151 INFO L130 PetriNetUnfolder]: 58/201 cut-off events. [2022-12-06 05:29:38,151 INFO L131 PetriNetUnfolder]: For 125/128 co-relation queries the response was YES. [2022-12-06 05:29:38,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 201 events. 58/201 cut-off events. For 125/128 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 963 event pairs, 4 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 526. Up to 52 conditions per place. [2022-12-06 05:29:38,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 273 flow [2022-12-06 05:29:38,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 05:29:38,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:38,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:38,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 05:29:38,250 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 271 flow [2022-12-06 05:29:38,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:38,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:38,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:29:38,251 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash -191131649, now seen corresponding path program 1 times [2022-12-06 05:29:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:38,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459918204] [2022-12-06 05:29:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459918204] [2022-12-06 05:29:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459918204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:39,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:29:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670360190] [2022-12-06 05:29:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:29:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:29:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:29:39,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 05:29:39,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:39,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:39,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 05:29:39,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:39,650 INFO L130 PetriNetUnfolder]: 870/1360 cut-off events. [2022-12-06 05:29:39,650 INFO L131 PetriNetUnfolder]: For 1282/1287 co-relation queries the response was YES. [2022-12-06 05:29:39,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 1360 events. 870/1360 cut-off events. For 1282/1287 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6122 event pairs, 426 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 4764. Up to 1266 conditions per place. [2022-12-06 05:29:39,657 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 39 selfloop transitions, 7 changer transitions 29/77 dead transitions. [2022-12-06 05:29:39,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 535 flow [2022-12-06 05:29:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-06 05:29:39,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2022-12-06 05:29:39,665 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 271 flow. Second operand 7 states and 81 transitions. [2022-12-06 05:29:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 535 flow [2022-12-06 05:29:39,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 503 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 05:29:39,669 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 266 flow [2022-12-06 05:29:39,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 05:29:39,670 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2022-12-06 05:29:39,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:39,670 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 266 flow [2022-12-06 05:29:39,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:39,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:39,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 266 flow [2022-12-06 05:29:39,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 266 flow [2022-12-06 05:29:39,690 INFO L130 PetriNetUnfolder]: 56/197 cut-off events. [2022-12-06 05:29:39,690 INFO L131 PetriNetUnfolder]: For 144/147 co-relation queries the response was YES. [2022-12-06 05:29:39,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 197 events. 56/197 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 911 event pairs, 5 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 515. Up to 51 conditions per place. [2022-12-06 05:29:39,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 266 flow [2022-12-06 05:29:39,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:29:39,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [914] $Ultimate##0-->L121-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre23#1_98| |v_#pthreadsForks_185|) (= (store |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_100| (store (select |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_100|) |v_ULTIMATE.start_main_~#t3~0#1.offset_100| |v_ULTIMATE.start_main_#t~pre23#1_98|)) |v_#memory_int_409|) (= |v_thread2Thread1of1ForFork0_~j~0#1_87| (select (select |v_#memory_int_410| v_~q1~0.base_163) (+ (* v_~q1_front~0_173 4) v_~q1~0.offset_163))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|) (not (= (ite (and (<= 0 v_~q1_front~0_173) (< v_~q1_front~0_173 v_~n1~0_179) (< v_~q1_front~0_173 v_~q1_back~0_272)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_215 v_~n2~0_154) (<= 0 v_~q2_back~0_215)) 1 0) 0)) (= (+ v_~q2_back~0_215 1) v_~q2_back~0_214) (= |v_thread2Thread1of1ForFork0_#res#1.base_45| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_87| v_~s~0_144) v_~s~0_143) (= v_~q1_front~0_172 (+ v_~q1_front~0_173 1)) (= (+ |v_#pthreadsForks_185| 1) |v_#pthreadsForks_184|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_45| 0) (<= |v_thread2Thread1of1ForFork0_~j~0#1_87| 0) (= (ite (= (+ (select (select |v_#memory_int_410| v_~q2~0.base_157) (+ v_~q2~0.offset_159 (* 4 v_~q2_back~0_215))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_87|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| 0))) InVars {~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~q1_front~0=v_~q1_front~0_173, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_100|, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_179, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_100|, #pthreadsForks=|v_#pthreadsForks_185|, ~q1_back~0=v_~q1_back~0_272, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_410|, ~q2~0.base=v_~q2~0.base_157, ~q2_back~0=v_~q2_back~0_215, ~s~0=v_~s~0_144} OutVars{thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_49|, ~q1_front~0=v_~q1_front~0_172, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_100|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_45|, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_179, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_100|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_109|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_49|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_86|, #pthreadsForks=|v_#pthreadsForks_184|, ~q1_back~0=v_~q1_back~0_272, ~q1~0.base=v_~q1~0.base_163, ~q2~0.base=v_~q2~0.base_157, ~q2_back~0=v_~q2_back~0_214, ~s~0=v_~s~0_143, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_87|, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_41|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_45|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_98|, #memory_int=|v_#memory_int_409|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre23#1, #memory_int, ~q2_back~0, ~s~0] [2022-12-06 05:29:40,121 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:40,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 451 [2022-12-06 05:29:40,121 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 254 flow [2022-12-06 05:29:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:40,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:40,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:29:40,122 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 745224041, now seen corresponding path program 1 times [2022-12-06 05:29:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894046588] [2022-12-06 05:29:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894046588] [2022-12-06 05:29:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894046588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:40,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499508437] [2022-12-06 05:29:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:40,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:29:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:29:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:29:40,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:40,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:40,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:40,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:40,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:40,966 INFO L130 PetriNetUnfolder]: 862/1329 cut-off events. [2022-12-06 05:29:40,966 INFO L131 PetriNetUnfolder]: For 1197/1200 co-relation queries the response was YES. [2022-12-06 05:29:40,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 1329 events. 862/1329 cut-off events. For 1197/1200 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5807 event pairs, 434 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 4644. Up to 1277 conditions per place. [2022-12-06 05:29:40,974 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 4 changer transitions 20/62 dead transitions. [2022-12-06 05:29:40,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 441 flow [2022-12-06 05:29:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:29:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:29:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 05:29:40,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:29:40,975 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 254 flow. Second operand 5 states and 62 transitions. [2022-12-06 05:29:40,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 441 flow [2022-12-06 05:29:40,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 399 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 05:29:40,979 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:40,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 05:29:40,979 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-06 05:29:40,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:40,980 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:40,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:40,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:40,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 213 flow [2022-12-06 05:29:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:40,997 INFO L130 PetriNetUnfolder]: 55/187 cut-off events. [2022-12-06 05:29:40,997 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-06 05:29:40,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 187 events. 55/187 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 846 event pairs, 4 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 458. Up to 50 conditions per place. [2022-12-06 05:29:40,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:40,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:40,999 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:41,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:29:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 213 flow [2022-12-06 05:29:41,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:41,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:41,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:41,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:29:41,003 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1704283560, now seen corresponding path program 1 times [2022-12-06 05:29:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:41,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168325432] [2022-12-06 05:29:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168325432] [2022-12-06 05:29:41,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168325432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:41,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:41,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:29:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522085266] [2022-12-06 05:29:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:29:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:29:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:29:41,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:41,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 213 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:41,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:41,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:41,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:42,084 INFO L130 PetriNetUnfolder]: 869/1350 cut-off events. [2022-12-06 05:29:42,084 INFO L131 PetriNetUnfolder]: For 1096/1096 co-relation queries the response was YES. [2022-12-06 05:29:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 1350 events. 869/1350 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5981 event pairs, 433 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 4652. Up to 1274 conditions per place. [2022-12-06 05:29:42,090 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 37 selfloop transitions, 7 changer transitions 29/75 dead transitions. [2022-12-06 05:29:42,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 473 flow [2022-12-06 05:29:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-06 05:29:42,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:29:42,091 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 213 flow. Second operand 7 states and 80 transitions. [2022-12-06 05:29:42,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 473 flow [2022-12-06 05:29:42,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 455 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:29:42,095 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 251 flow [2022-12-06 05:29:42,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-06 05:29:42,095 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-06 05:29:42,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:42,095 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 251 flow [2022-12-06 05:29:42,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:42,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:42,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 251 flow [2022-12-06 05:29:42,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 251 flow [2022-12-06 05:29:42,113 INFO L130 PetriNetUnfolder]: 53/195 cut-off events. [2022-12-06 05:29:42,113 INFO L131 PetriNetUnfolder]: For 117/125 co-relation queries the response was YES. [2022-12-06 05:29:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 195 events. 53/195 cut-off events. For 117/125 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 912 event pairs, 5 based on Foata normal form. 3/150 useless extension candidates. Maximal degree in co-relation 496. Up to 52 conditions per place. [2022-12-06 05:29:42,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 251 flow [2022-12-06 05:29:42,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 05:29:42,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:42,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:42,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 05:29:42,196 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 249 flow [2022-12-06 05:29:42,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:42,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:42,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:42,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:29:42,196 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -231143766, now seen corresponding path program 1 times [2022-12-06 05:29:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:42,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590958295] [2022-12-06 05:29:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590958295] [2022-12-06 05:29:42,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590958295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:42,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:42,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:29:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237170605] [2022-12-06 05:29:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:42,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:29:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:29:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:29:42,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:42,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:42,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:42,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:42,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:43,153 INFO L130 PetriNetUnfolder]: 865/1352 cut-off events. [2022-12-06 05:29:43,153 INFO L131 PetriNetUnfolder]: For 1166/1166 co-relation queries the response was YES. [2022-12-06 05:29:43,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 1352 events. 865/1352 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6046 event pairs, 443 based on Foata normal form. 1/939 useless extension candidates. Maximal degree in co-relation 4731. Up to 1290 conditions per place. [2022-12-06 05:29:43,159 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 35 selfloop transitions, 2 changer transitions 32/71 dead transitions. [2022-12-06 05:29:43,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 489 flow [2022-12-06 05:29:43,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 05:29:43,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2022-12-06 05:29:43,160 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 249 flow. Second operand 7 states and 74 transitions. [2022-12-06 05:29:43,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 489 flow [2022-12-06 05:29:43,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 457 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 05:29:43,163 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 197 flow [2022-12-06 05:29:43,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-06 05:29:43,163 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2022-12-06 05:29:43,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:43,163 INFO L89 Accepts]: Start accepts. Operand has 54 places, 38 transitions, 197 flow [2022-12-06 05:29:43,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:43,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:43,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 197 flow [2022-12-06 05:29:43,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 197 flow [2022-12-06 05:29:43,175 INFO L130 PetriNetUnfolder]: 52/169 cut-off events. [2022-12-06 05:29:43,175 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 05:29:43,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 169 events. 52/169 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 737 event pairs, 4 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 433. Up to 50 conditions per place. [2022-12-06 05:29:43,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 197 flow [2022-12-06 05:29:43,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:43,178 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:43,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:29:43,178 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 197 flow [2022-12-06 05:29:43,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:43,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:43,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:29:43,179 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash -647957096, now seen corresponding path program 1 times [2022-12-06 05:29:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:43,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266438844] [2022-12-06 05:29:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:44,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:44,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266438844] [2022-12-06 05:29:44,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266438844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:44,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:44,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:29:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348191472] [2022-12-06 05:29:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:44,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:29:44,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:29:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:29:44,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 05:29:44,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:44,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:44,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 05:29:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:44,789 INFO L130 PetriNetUnfolder]: 874/1356 cut-off events. [2022-12-06 05:29:44,789 INFO L131 PetriNetUnfolder]: For 1321/1369 co-relation queries the response was YES. [2022-12-06 05:29:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 1356 events. 874/1356 cut-off events. For 1321/1369 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6003 event pairs, 433 based on Foata normal form. 4/944 useless extension candidates. Maximal degree in co-relation 4757. Up to 1274 conditions per place. [2022-12-06 05:29:44,795 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 41 selfloop transitions, 7 changer transitions 27/77 dead transitions. [2022-12-06 05:29:44,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 492 flow [2022-12-06 05:29:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:29:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:29:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-06 05:29:44,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:29:44,800 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 197 flow. Second operand 8 states and 84 transitions. [2022-12-06 05:29:44,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 492 flow [2022-12-06 05:29:44,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 446 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-06 05:29:44,803 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 247 flow [2022-12-06 05:29:44,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=247, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-06 05:29:44,804 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-06 05:29:44,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:44,804 INFO L89 Accepts]: Start accepts. Operand has 52 places, 44 transitions, 247 flow [2022-12-06 05:29:44,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:44,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:44,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 247 flow [2022-12-06 05:29:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 247 flow [2022-12-06 05:29:44,821 INFO L130 PetriNetUnfolder]: 53/191 cut-off events. [2022-12-06 05:29:44,821 INFO L131 PetriNetUnfolder]: For 109/117 co-relation queries the response was YES. [2022-12-06 05:29:44,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 191 events. 53/191 cut-off events. For 109/117 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 896 event pairs, 5 based on Foata normal form. 3/146 useless extension candidates. Maximal degree in co-relation 487. Up to 52 conditions per place. [2022-12-06 05:29:44,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 247 flow [2022-12-06 05:29:44,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-06 05:29:44,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:48,258 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:48,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3454 [2022-12-06 05:29:48,258 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 255 flow [2022-12-06 05:29:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:48,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:48,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:48,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:29:48,259 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 665124950, now seen corresponding path program 1 times [2022-12-06 05:29:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:48,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688265767] [2022-12-06 05:29:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:49,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688265767] [2022-12-06 05:29:49,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688265767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:49,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:49,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:29:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240048405] [2022-12-06 05:29:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:49,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:29:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:49,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:29:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:29:49,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:29:49,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:49,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:49,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:29:49,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:49,526 INFO L130 PetriNetUnfolder]: 874/1371 cut-off events. [2022-12-06 05:29:49,526 INFO L131 PetriNetUnfolder]: For 1292/1292 co-relation queries the response was YES. [2022-12-06 05:29:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 1371 events. 874/1371 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6156 event pairs, 437 based on Foata normal form. 1/959 useless extension candidates. Maximal degree in co-relation 4823. Up to 1293 conditions per place. [2022-12-06 05:29:49,533 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 39 selfloop transitions, 5 changer transitions 32/78 dead transitions. [2022-12-06 05:29:49,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 540 flow [2022-12-06 05:29:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:29:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:29:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-06 05:29:49,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:29:49,540 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 255 flow. Second operand 7 states and 80 transitions. [2022-12-06 05:29:49,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 540 flow [2022-12-06 05:29:49,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 501 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 05:29:49,544 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 259 flow [2022-12-06 05:29:49,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-06 05:29:49,545 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2022-12-06 05:29:49,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:49,545 INFO L89 Accepts]: Start accepts. Operand has 55 places, 44 transitions, 259 flow [2022-12-06 05:29:49,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:49,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:49,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 259 flow [2022-12-06 05:29:49,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 259 flow [2022-12-06 05:29:49,564 INFO L130 PetriNetUnfolder]: 53/197 cut-off events. [2022-12-06 05:29:49,564 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-12-06 05:29:49,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 197 events. 53/197 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 923 event pairs, 5 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 509. Up to 51 conditions per place. [2022-12-06 05:29:49,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 259 flow [2022-12-06 05:29:49,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:29:49,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:29:49,820 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:29:49,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 05:29:49,821 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 251 flow [2022-12-06 05:29:49,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:49,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:49,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:49,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:29:49,821 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1774454176, now seen corresponding path program 1 times [2022-12-06 05:29:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:49,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813709681] [2022-12-06 05:29:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:50,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813709681] [2022-12-06 05:29:50,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813709681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:50,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:50,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:29:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096977805] [2022-12-06 05:29:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:29:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:29:50,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:29:50,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 05:29:50,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:50,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:50,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 05:29:50,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:51,018 INFO L130 PetriNetUnfolder]: 861/1337 cut-off events. [2022-12-06 05:29:51,018 INFO L131 PetriNetUnfolder]: For 1119/1119 co-relation queries the response was YES. [2022-12-06 05:29:51,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 1337 events. 861/1337 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5864 event pairs, 439 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 4684. Up to 1279 conditions per place. [2022-12-06 05:29:51,026 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 34 selfloop transitions, 4 changer transitions 25/65 dead transitions. [2022-12-06 05:29:51,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 457 flow [2022-12-06 05:29:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:29:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:29:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 05:29:51,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-06 05:29:51,027 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 251 flow. Second operand 6 states and 66 transitions. [2022-12-06 05:29:51,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 457 flow [2022-12-06 05:29:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 417 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 05:29:51,031 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 201 flow [2022-12-06 05:29:51,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-06 05:29:51,032 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-06 05:29:51,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:51,032 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 201 flow [2022-12-06 05:29:51,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:51,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:51,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 201 flow [2022-12-06 05:29:51,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 201 flow [2022-12-06 05:29:51,047 INFO L130 PetriNetUnfolder]: 52/170 cut-off events. [2022-12-06 05:29:51,048 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 05:29:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 170 events. 52/170 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 734 event pairs, 4 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 434. Up to 50 conditions per place. [2022-12-06 05:29:51,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 201 flow [2022-12-06 05:29:51,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:29:55,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:55,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4692 [2022-12-06 05:29:55,724 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 197 flow [2022-12-06 05:29:55,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:55,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:55,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:29:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:29:55,724 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:29:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash 796008709, now seen corresponding path program 1 times [2022-12-06 05:29:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:55,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665083004] [2022-12-06 05:29:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:29:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:57,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665083004] [2022-12-06 05:29:57,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665083004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:57,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:57,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:29:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742105191] [2022-12-06 05:29:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:29:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:29:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:29:57,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 05:29:57,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 197 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:29:57,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:57,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 05:29:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:57,689 INFO L130 PetriNetUnfolder]: 940/1441 cut-off events. [2022-12-06 05:29:57,689 INFO L131 PetriNetUnfolder]: For 1307/1307 co-relation queries the response was YES. [2022-12-06 05:29:57,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 1441 events. 940/1441 cut-off events. For 1307/1307 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6337 event pairs, 305 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 5052. Up to 1342 conditions per place. [2022-12-06 05:29:57,695 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 48 selfloop transitions, 16 changer transitions 18/84 dead transitions. [2022-12-06 05:29:57,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 549 flow [2022-12-06 05:29:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:29:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:29:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-12-06 05:29:57,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-06 05:29:57,696 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 197 flow. Second operand 10 states and 94 transitions. [2022-12-06 05:29:57,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 549 flow [2022-12-06 05:29:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 505 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-06 05:29:57,699 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 325 flow [2022-12-06 05:29:57,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=325, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 05:29:57,700 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2022-12-06 05:29:57,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:57,700 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 325 flow [2022-12-06 05:29:57,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:57,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:57,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 325 flow [2022-12-06 05:29:57,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 325 flow [2022-12-06 05:29:57,725 INFO L130 PetriNetUnfolder]: 112/312 cut-off events. [2022-12-06 05:29:57,725 INFO L131 PetriNetUnfolder]: For 232/244 co-relation queries the response was YES. [2022-12-06 05:29:57,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 312 events. 112/312 cut-off events. For 232/244 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1651 event pairs, 5 based on Foata normal form. 2/219 useless extension candidates. Maximal degree in co-relation 934. Up to 107 conditions per place. [2022-12-06 05:29:57,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 325 flow [2022-12-06 05:29:57,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:29:57,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [875] $Ultimate##0-->L70: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~q1_front~0_107 1) v_~q1_front~0_106) (= (select (select |v_#memory_int_245| v_~q1~0.base_92) (+ v_~q1~0.offset_92 (* v_~q1_front~0_107 4))) |v_thread2Thread1of1ForFork0_~j~0#1_57|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (and (< v_~q1_front~0_107 v_~n1~0_117) (< v_~q1_front~0_107 v_~q1_back~0_181) (<= 0 v_~q1_front~0_107)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|)) InVars {~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_107, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, #memory_int=|v_#memory_int_245|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_57|, ~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_106, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_19|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:29:58,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [922] $Ultimate##0-->L121-3: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95| (ite (and (<= 0 v_~q1_front~0_189) (< v_~q1_front~0_189 v_~n1~0_191) (< v_~q1_front~0_189 v_~q1_back~0_288)) 1 0)) (= (+ |v_#pthreadsForks_213| 1) |v_#pthreadsForks_212|) (= (store |v_#memory_int_446| |v_ULTIMATE.start_main_~#t3~0#1.base_114| (store (select |v_#memory_int_446| |v_ULTIMATE.start_main_~#t3~0#1.base_114|) |v_ULTIMATE.start_main_~#t3~0#1.offset_114| |v_ULTIMATE.start_main_#t~pre23#1_112|)) |v_#memory_int_445|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select (select |v_#memory_int_446| v_~q1~0.base_175) (+ (* v_~q1_front~0_189 4) v_~q1~0.offset_175)) |v_thread2Thread1of1ForFork0_~j~0#1_97|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (= (+ v_~q1_front~0_189 1) v_~q1_front~0_188) (= |v_#pthreadsForks_213| |v_ULTIMATE.start_main_#t~pre23#1_112|)) InVars {~q1~0.offset=v_~q1~0.offset_175, #pthreadsForks=|v_#pthreadsForks_213|, ~q1_front~0=v_~q1_front~0_189, ~q1_back~0=v_~q1_back~0_288, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_114|, ~n1~0=v_~n1~0_191, ~q1~0.base=v_~q1~0.base_175, #memory_int=|v_#memory_int_446|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_114|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_97|, ~q1~0.offset=v_~q1~0.offset_175, ~q1_front~0=v_~q1_front~0_188, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_114|, ~n1~0=v_~n1~0_191, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_114|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_125|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_47|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_47|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_100|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_112|, #pthreadsForks=|v_#pthreadsForks_212|, ~q1_back~0=v_~q1_back~0_288, ~q1~0.base=v_~q1~0.base_175, #memory_int=|v_#memory_int_445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] [2022-12-06 05:29:58,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (not (= (ite (and (< v_~q2_back~0_239 v_~n2~0_168) (<= 0 v_~q2_back~0_239)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_55| 0) (= v_~s~0_167 (+ |v_thread2Thread1of1ForFork0_~j~0#1_99| v_~s~0_168)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_99| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= v_~q1_front~0_192 (+ v_~q1_front~0_193 1)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97| (ite (= (+ (select (select |v_#memory_int_449| v_~q2~0.base_173) (+ v_~q2~0.offset_175 (* 4 v_~q2_back~0_239))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_99|) 1 0)) (= (select (select |v_#memory_int_449| v_~q1~0.base_177) (+ (* v_~q1_front~0_193 4) v_~q1~0.offset_177)) |v_thread2Thread1of1ForFork0_~j~0#1_99|) (not (= (ite (and (<= 0 v_~q1_front~0_193) (< v_~q1_front~0_193 v_~q1_back~0_290) (< v_~q1_front~0_193 v_~n1~0_193)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= (+ v_~q2_back~0_239 1) v_~q2_back~0_238) (= |v_thread2Thread1of1ForFork0_#res#1.base_55| 0)) InVars {~q1~0.offset=v_~q1~0.offset_177, ~n2~0=v_~n2~0_168, ~q1_front~0=v_~q1_front~0_193, ~q1_back~0=v_~q1_back~0_290, ~q2~0.offset=v_~q2~0.offset_175, ~n1~0=v_~n1~0_193, ~q1~0.base=v_~q1~0.base_177, #memory_int=|v_#memory_int_449|, ~q2~0.base=v_~q2~0.base_173, ~q2_back~0=v_~q2_back~0_239, ~s~0=v_~s~0_168} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_99|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_59|, ~q1~0.offset=v_~q1~0.offset_177, ~n2~0=v_~n2~0_168, ~q1_front~0=v_~q1_front~0_192, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_55|, ~q2~0.offset=v_~q2~0.offset_175, ~n1~0=v_~n1~0_193, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_49|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_49|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_55|, ~q1_back~0=v_~q1_back~0_290, ~q1~0.base=v_~q1~0.base_177, #memory_int=|v_#memory_int_449|, ~q2~0.base=v_~q2~0.base_173, ~q2_back~0=v_~q2_back~0_238, ~s~0=v_~s~0_167} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:30:09,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [927] $Ultimate##0-->L121-3: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_57| 0) (not (= (ite (and (<= 0 v_~q2_back~0_247) (< v_~q2_back~0_247 v_~n2~0_178)) 1 0) 0)) (= |v_#pthreadsForks_237| |v_ULTIMATE.start_main_#t~pre23#1_119|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103| 0)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_103| 0) (= (ite (= (+ (select (select |v_#memory_int_480| v_~q2~0.base_181) (+ v_~q2~0.offset_183 (* 4 v_~q2_back~0_247))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_103|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (+ v_~q2_back~0_247 1) v_~q2_back~0_246) (= v_~s~0_175 (+ |v_thread2Thread1of1ForFork0_~j~0#1_103| v_~s~0_176)) (= |v_thread2Thread1of1ForFork0_~j~0#1_103| (select (select |v_#memory_int_480| v_~q1~0.base_193) (+ (* v_~q1_front~0_205 4) v_~q1~0.offset_193))) (= |v_thread2Thread1of1ForFork0_#res#1.offset_57| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= (+ v_~q1_front~0_205 1) v_~q1_front~0_204) (= (+ |v_#pthreadsForks_237| 1) |v_#pthreadsForks_236|) (= |v_#memory_int_479| (store |v_#memory_int_480| |v_ULTIMATE.start_main_~#t3~0#1.base_124| (store (select |v_#memory_int_480| |v_ULTIMATE.start_main_~#t3~0#1.base_124|) |v_ULTIMATE.start_main_~#t3~0#1.offset_121| |v_ULTIMATE.start_main_#t~pre23#1_119|))) (not (= (ite (and (< v_~q1_front~0_205 v_~n1~0_205) (< v_~q1_front~0_205 v_~q1_back~0_310) (<= 0 v_~q1_front~0_205)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_193, ~n2~0=v_~n2~0_178, ~q1_front~0=v_~q1_front~0_205, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_121|, ~q2~0.offset=v_~q2~0.offset_183, ~n1~0=v_~n1~0_205, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_124|, #pthreadsForks=|v_#pthreadsForks_237|, ~q1_back~0=v_~q1_back~0_310, ~q1~0.base=v_~q1~0.base_193, #memory_int=|v_#memory_int_480|, ~q2~0.base=v_~q2~0.base_181, ~q2_back~0=v_~q2_back~0_247, ~s~0=v_~s~0_176} OutVars{thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_61|, ~q1_front~0=v_~q1_front~0_204, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_57|, ~q2~0.offset=v_~q2~0.offset_183, ~n1~0=v_~n1~0_205, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_124|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_135|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_61|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_107|, #pthreadsForks=|v_#pthreadsForks_236|, ~q1_back~0=v_~q1_back~0_310, ~q1~0.base=v_~q1~0.base_193, ~q2~0.base=v_~q2~0.base_181, ~q2_back~0=v_~q2_back~0_246, ~s~0=v_~s~0_175, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_103|, ~q1~0.offset=v_~q1~0.offset_193, ~n2~0=v_~n2~0_178, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_53|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_53|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_57|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_119|, #memory_int=|v_#memory_int_479|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre23#1, #memory_int, ~q2_back~0, ~s~0] [2022-12-06 05:30:09,437 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:30:09,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11737 [2022-12-06 05:30:09,437 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 357 flow [2022-12-06 05:30:09,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:09,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:09,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:09,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:30:09,438 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash 38284737, now seen corresponding path program 1 times [2022-12-06 05:30:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:09,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028742501] [2022-12-06 05:30:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028742501] [2022-12-06 05:30:10,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028742501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:10,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:10,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:30:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875823228] [2022-12-06 05:30:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:10,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:30:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:30:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:30:10,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-06 05:30:10,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 357 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:10,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:10,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-06 05:30:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:11,101 INFO L130 PetriNetUnfolder]: 901/1418 cut-off events. [2022-12-06 05:30:11,102 INFO L131 PetriNetUnfolder]: For 1901/1931 co-relation queries the response was YES. [2022-12-06 05:30:11,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 1418 events. 901/1418 cut-off events. For 1901/1931 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6460 event pairs, 305 based on Foata normal form. 3/999 useless extension candidates. Maximal degree in co-relation 5407. Up to 1329 conditions per place. [2022-12-06 05:30:11,113 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 51 selfloop transitions, 8 changer transitions 28/89 dead transitions. [2022-12-06 05:30:11,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 680 flow [2022-12-06 05:30:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:30:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:30:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-06 05:30:11,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2022-12-06 05:30:11,115 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 357 flow. Second operand 8 states and 90 transitions. [2022-12-06 05:30:11,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 680 flow [2022-12-06 05:30:11,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 612 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 05:30:11,120 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 376 flow [2022-12-06 05:30:11,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2022-12-06 05:30:11,123 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2022-12-06 05:30:11,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:11,123 INFO L89 Accepts]: Start accepts. Operand has 62 places, 55 transitions, 376 flow [2022-12-06 05:30:11,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:11,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:11,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 55 transitions, 376 flow [2022-12-06 05:30:11,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 376 flow [2022-12-06 05:30:11,153 INFO L130 PetriNetUnfolder]: 120/325 cut-off events. [2022-12-06 05:30:11,153 INFO L131 PetriNetUnfolder]: For 302/355 co-relation queries the response was YES. [2022-12-06 05:30:11,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 325 events. 120/325 cut-off events. For 302/355 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1693 event pairs, 12 based on Foata normal form. 4/226 useless extension candidates. Maximal degree in co-relation 978. Up to 109 conditions per place. [2022-12-06 05:30:11,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 376 flow [2022-12-06 05:30:11,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 05:30:17,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [875] $Ultimate##0-->L70: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~q1_front~0_107 1) v_~q1_front~0_106) (= (select (select |v_#memory_int_245| v_~q1~0.base_92) (+ v_~q1~0.offset_92 (* v_~q1_front~0_107 4))) |v_thread2Thread1of1ForFork0_~j~0#1_57|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (and (< v_~q1_front~0_107 v_~n1~0_117) (< v_~q1_front~0_107 v_~q1_back~0_181) (<= 0 v_~q1_front~0_107)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|)) InVars {~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_107, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, #memory_int=|v_#memory_int_245|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_57|, ~q1~0.offset=v_~q1~0.offset_92, ~q1_front~0=v_~q1_front~0_106, ~q1_back~0=v_~q1_back~0_181, ~n1~0=v_~n1~0_117, ~q1~0.base=v_~q1~0.base_92, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_19|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] [2022-12-06 05:30:17,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:30:17,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] L47-4-->L70: Formula: (let ((.cse0 (select |v_#memory_int_523| v_~q1~0.base_217))) (and (= |v_thread1Thread1of1ForFork2_#res#1.base_64| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86| (ite (= (select .cse0 (+ v_~q1~0.offset_217 (* v_~q1_back~0_334 4))) 0) 1 0)) (= (+ v_~q1_back~0_334 1) v_~q1_back~0_333) (= v_~q1_front~0_224 (+ v_~q1_front~0_225 1)) (= (ite (and (< v_~q1_front~0_225 v_~n1~0_223) (<= 0 v_~q1_front~0_225) (< v_~q1_front~0_225 v_~q1_back~0_333)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (not (= (ite (and (< v_~q1_back~0_334 v_~n1~0_223) (<= 0 v_~q1_back~0_334)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_64| 0) (= (select .cse0 (+ v_~q1~0.offset_217 (* v_~q1_front~0_225 4))) |v_thread2Thread1of1ForFork0_~j~0#1_107|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_84| v_~N~0_161)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|))) InVars {~q1~0.offset=v_~q1~0.offset_217, ~q1_front~0=v_~q1_front~0_225, ~q1_back~0=v_~q1_back~0_334, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_84|, ~n1~0=v_~n1~0_223, ~q1~0.base=v_~q1~0.base_217, #memory_int=|v_#memory_int_523|, ~N~0=v_~N~0_161} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_107|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_72|, ~q1~0.offset=v_~q1~0.offset_217, ~q1_front~0=v_~q1_front~0_224, ~n1~0=v_~n1~0_223, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_72|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_57|, ~N~0=v_~N~0_161, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_57|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, ~q1_back~0=v_~q1_back~0_333, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_84|, ~q1~0.base=v_~q1~0.base_217, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|, #memory_int=|v_#memory_int_523|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_64|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_64|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1, thread1Thread1of1ForFork2_#t~mem4#1, ~q1_front~0, thread1Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:30:18,157 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:30:18,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7035 [2022-12-06 05:30:18,158 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 387 flow [2022-12-06 05:30:18,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:18,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:18,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:18,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:30:18,158 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1914972004, now seen corresponding path program 1 times [2022-12-06 05:30:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:18,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820769025] [2022-12-06 05:30:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:19,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820769025] [2022-12-06 05:30:19,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820769025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:19,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:19,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:30:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112213070] [2022-12-06 05:30:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:19,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:30:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:30:19,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:30:19,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:30:19,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:19,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:19,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:30:19,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:19,270 INFO L130 PetriNetUnfolder]: 887/1383 cut-off events. [2022-12-06 05:30:19,270 INFO L131 PetriNetUnfolder]: For 1899/1943 co-relation queries the response was YES. [2022-12-06 05:30:19,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 1383 events. 887/1383 cut-off events. For 1899/1943 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6310 event pairs, 294 based on Foata normal form. 3/966 useless extension candidates. Maximal degree in co-relation 5290. Up to 1329 conditions per place. [2022-12-06 05:30:19,276 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 50 selfloop transitions, 5 changer transitions 16/73 dead transitions. [2022-12-06 05:30:19,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 614 flow [2022-12-06 05:30:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:30:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:30:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 05:30:19,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 05:30:19,279 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 387 flow. Second operand 5 states and 65 transitions. [2022-12-06 05:30:19,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 614 flow [2022-12-06 05:30:19,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 566 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 05:30:19,299 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 376 flow [2022-12-06 05:30:19,299 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-06 05:30:19,300 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2022-12-06 05:30:19,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:19,300 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 376 flow [2022-12-06 05:30:19,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:19,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:19,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 376 flow [2022-12-06 05:30:19,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 376 flow [2022-12-06 05:30:19,321 INFO L130 PetriNetUnfolder]: 113/320 cut-off events. [2022-12-06 05:30:19,321 INFO L131 PetriNetUnfolder]: For 276/301 co-relation queries the response was YES. [2022-12-06 05:30:19,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 320 events. 113/320 cut-off events. For 276/301 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1740 event pairs, 4 based on Foata normal form. 5/235 useless extension candidates. Maximal degree in co-relation 949. Up to 99 conditions per place. [2022-12-06 05:30:19,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 376 flow [2022-12-06 05:30:19,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 05:30:19,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] [2022-12-06 05:30:19,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [785] L70-->L65-2: Formula: (and (= (+ v_~s~0_20 |v_thread2Thread1of1ForFork0_~j~0#1_31|) v_~s~0_19) (not (<= |v_thread2Thread1of1ForFork0_~j~0#1_31| 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_67) (< v_~q2_back~0_67 v_~n2~0_34)) 1 0) 0)) (= (+ v_~q2_back~0_67 1) v_~q2_back~0_66) (= (ite (= (+ (select (select |v_#memory_int_129| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* v_~q2_back~0_67 4))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_31|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_31|, ~n2~0=v_~n2~0_34, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_129|, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_67, ~s~0=v_~s~0_20} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_31|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_11|, ~n2~0=v_~n2~0_34, ~q2~0.offset=v_~q2~0.offset_43, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, #memory_int=|v_#memory_int_129|, ~q2~0.base=v_~q2~0.base_43, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_11|, ~q2_back~0=v_~q2_back~0_66, ~s~0=v_~s~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] [2022-12-06 05:30:19,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:30:19,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 05:30:19,682 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 392 flow [2022-12-06 05:30:19,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:19,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:19,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:19,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:30:19,682 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -426305958, now seen corresponding path program 1 times [2022-12-06 05:30:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:19,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371923548] [2022-12-06 05:30:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371923548] [2022-12-06 05:30:20,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371923548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:20,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:30:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944147833] [2022-12-06 05:30:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:20,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:30:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:30:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:30:20,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 05:30:20,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:20,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:20,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 05:30:20,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:20,914 INFO L130 PetriNetUnfolder]: 881/1374 cut-off events. [2022-12-06 05:30:20,914 INFO L131 PetriNetUnfolder]: For 1932/1976 co-relation queries the response was YES. [2022-12-06 05:30:20,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5329 conditions, 1374 events. 881/1374 cut-off events. For 1932/1976 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6247 event pairs, 301 based on Foata normal form. 3/959 useless extension candidates. Maximal degree in co-relation 5292. Up to 1318 conditions per place. [2022-12-06 05:30:20,921 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 50 selfloop transitions, 4 changer transitions 16/72 dead transitions. [2022-12-06 05:30:20,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 590 flow [2022-12-06 05:30:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:30:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:30:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 05:30:20,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2022-12-06 05:30:20,924 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 392 flow. Second operand 6 states and 67 transitions. [2022-12-06 05:30:20,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 590 flow [2022-12-06 05:30:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 553 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:30:20,929 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 345 flow [2022-12-06 05:30:20,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2022-12-06 05:30:20,929 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-12-06 05:30:20,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:20,930 INFO L89 Accepts]: Start accepts. Operand has 57 places, 52 transitions, 345 flow [2022-12-06 05:30:20,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:20,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:20,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 52 transitions, 345 flow [2022-12-06 05:30:20,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 345 flow [2022-12-06 05:30:20,958 INFO L130 PetriNetUnfolder]: 120/321 cut-off events. [2022-12-06 05:30:20,959 INFO L131 PetriNetUnfolder]: For 255/284 co-relation queries the response was YES. [2022-12-06 05:30:20,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 321 events. 120/321 cut-off events. For 255/284 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1677 event pairs, 3 based on Foata normal form. 4/224 useless extension candidates. Maximal degree in co-relation 966. Up to 105 conditions per place. [2022-12-06 05:30:20,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 345 flow [2022-12-06 05:30:20,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 05:30:20,963 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:20,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:30:20,963 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 345 flow [2022-12-06 05:30:20,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:20,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:20,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:20,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:30:20,964 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1643024882, now seen corresponding path program 1 times [2022-12-06 05:30:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:20,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191713977] [2022-12-06 05:30:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191713977] [2022-12-06 05:30:21,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191713977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:21,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:21,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:30:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755685462] [2022-12-06 05:30:21,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:21,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:30:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:30:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:30:21,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:30:21,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:21,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:21,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:30:21,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:22,275 INFO L130 PetriNetUnfolder]: 887/1373 cut-off events. [2022-12-06 05:30:22,276 INFO L131 PetriNetUnfolder]: For 1634/1664 co-relation queries the response was YES. [2022-12-06 05:30:22,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 1373 events. 887/1373 cut-off events. For 1634/1664 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6177 event pairs, 200 based on Foata normal form. 8/962 useless extension candidates. Maximal degree in co-relation 5232. Up to 1301 conditions per place. [2022-12-06 05:30:22,281 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 48 selfloop transitions, 19 changer transitions 15/84 dead transitions. [2022-12-06 05:30:22,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 636 flow [2022-12-06 05:30:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:30:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:30:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 05:30:22,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3346938775510204 [2022-12-06 05:30:22,282 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 345 flow. Second operand 7 states and 82 transitions. [2022-12-06 05:30:22,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 636 flow [2022-12-06 05:30:22,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 608 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 05:30:22,287 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 435 flow [2022-12-06 05:30:22,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=435, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-12-06 05:30:22,287 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2022-12-06 05:30:22,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:22,287 INFO L89 Accepts]: Start accepts. Operand has 59 places, 58 transitions, 435 flow [2022-12-06 05:30:22,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:22,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:22,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 435 flow [2022-12-06 05:30:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 58 transitions, 435 flow [2022-12-06 05:30:22,316 INFO L130 PetriNetUnfolder]: 115/326 cut-off events. [2022-12-06 05:30:22,316 INFO L131 PetriNetUnfolder]: For 258/275 co-relation queries the response was YES. [2022-12-06 05:30:22,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 326 events. 115/326 cut-off events. For 258/275 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1773 event pairs, 4 based on Foata normal form. 4/238 useless extension candidates. Maximal degree in co-relation 1007. Up to 95 conditions per place. [2022-12-06 05:30:22,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 58 transitions, 435 flow [2022-12-06 05:30:22,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 05:30:22,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [926] L47-4-->L121-3: Formula: (let ((.cse0 (select |v_#memory_int_476| v_~q1~0.base_191))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= (ite (= (select .cse0 (+ (* v_~q1_back~0_307 4) v_~q1~0.offset_191)) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_79| 0)) (= (+ v_~q1_back~0_307 1) v_~q1_back~0_306) (= (store |v_#memory_int_476| |v_ULTIMATE.start_main_~#t3~0#1.base_122| (store (select |v_#memory_int_476| |v_ULTIMATE.start_main_~#t3~0#1.base_122|) |v_ULTIMATE.start_main_~#t3~0#1.offset_119| |v_ULTIMATE.start_main_#t~pre23#1_117|)) |v_#memory_int_475|) (= v_~q1_front~0_200 (+ v_~q1_front~0_201 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_57| 0) (= |v_#pthreadsForks_232| (+ |v_#pthreadsForks_233| 1)) (= |v_#pthreadsForks_233| |v_ULTIMATE.start_main_#t~pre23#1_117|) (not (= (ite (and (< v_~q1_back~0_307 v_~n1~0_203) (<= 0 v_~q1_back~0_307)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_79| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|) (= (select .cse0 (+ v_~q1~0.offset_191 (* v_~q1_front~0_201 4))) |v_thread2Thread1of1ForFork0_~j~0#1_101|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (= (ite (and (<= 0 v_~q1_front~0_201) (< v_~q1_front~0_201 v_~n1~0_203) (< v_~q1_front~0_201 v_~q1_back~0_306)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= |v_thread1Thread1of1ForFork2_#res#1.base_57| 0) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_77| v_~N~0_142)))) InVars {~q1~0.offset=v_~q1~0.offset_191, ~q1_front~0=v_~q1_front~0_201, #pthreadsForks=|v_#pthreadsForks_233|, ~q1_back~0=v_~q1_back~0_307, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_77|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_119|, ~n1~0=v_~n1~0_203, ~q1~0.base=v_~q1~0.base_191, #memory_int=|v_#memory_int_476|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_122|, ~N~0=v_~N~0_142} OutVars{~q1_front~0=v_~q1_front~0_200, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_119|, ~n1~0=v_~n1~0_203, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_122|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_133|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_105|, #pthreadsForks=|v_#pthreadsForks_232|, ~q1_back~0=v_~q1_back~0_306, ~q1~0.base=v_~q1~0.base_191, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_57|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_57|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_79|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_101|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_65|, ~q1~0.offset=v_~q1~0.offset_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_65|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_51|, ~N~0=v_~N~0_142, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_51|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_117|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_77|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_79|, #memory_int=|v_#memory_int_475|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1, thread1Thread1of1ForFork2_#t~mem4#1, ~q1_front~0, thread1Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #pthreadsForks, ULTIMATE.start_main_#t~pre23#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [785] L70-->L65-2: Formula: (and (= (+ v_~s~0_20 |v_thread2Thread1of1ForFork0_~j~0#1_31|) v_~s~0_19) (not (<= |v_thread2Thread1of1ForFork0_~j~0#1_31| 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_67) (< v_~q2_back~0_67 v_~n2~0_34)) 1 0) 0)) (= (+ v_~q2_back~0_67 1) v_~q2_back~0_66) (= (ite (= (+ (select (select |v_#memory_int_129| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* v_~q2_back~0_67 4))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_31|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_31|, ~n2~0=v_~n2~0_34, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_129|, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_67, ~s~0=v_~s~0_20} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_31|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_11|, ~n2~0=v_~n2~0_34, ~q2~0.offset=v_~q2~0.offset_43, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, #memory_int=|v_#memory_int_129|, ~q2~0.base=v_~q2~0.base_43, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_11|, ~q2_back~0=v_~q2_back~0_66, ~s~0=v_~s~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] [2022-12-06 05:30:30,438 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:30:30,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8151 [2022-12-06 05:30:30,439 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 439 flow [2022-12-06 05:30:30,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:30,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:30,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:30,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:30:30,446 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -74842795, now seen corresponding path program 1 times [2022-12-06 05:30:30,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:30,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966436960] [2022-12-06 05:30:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:31,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966436960] [2022-12-06 05:30:31,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966436960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:31,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:31,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:30:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677578726] [2022-12-06 05:30:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:30:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:30:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:30:31,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 05:30:31,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 439 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:31,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:31,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 05:30:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:32,215 INFO L130 PetriNetUnfolder]: 909/1403 cut-off events. [2022-12-06 05:30:32,216 INFO L131 PetriNetUnfolder]: For 1954/1964 co-relation queries the response was YES. [2022-12-06 05:30:32,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1403 events. 909/1403 cut-off events. For 1954/1964 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6225 event pairs, 263 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 5461. Up to 1335 conditions per place. [2022-12-06 05:30:32,222 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 55 selfloop transitions, 4 changer transitions 25/86 dead transitions. [2022-12-06 05:30:32,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 712 flow [2022-12-06 05:30:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:30:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:30:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 05:30:32,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3166023166023166 [2022-12-06 05:30:32,223 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 439 flow. Second operand 7 states and 82 transitions. [2022-12-06 05:30:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 712 flow [2022-12-06 05:30:32,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 653 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 05:30:32,227 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 388 flow [2022-12-06 05:30:32,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-06 05:30:32,228 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2022-12-06 05:30:32,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:32,228 INFO L89 Accepts]: Start accepts. Operand has 60 places, 55 transitions, 388 flow [2022-12-06 05:30:32,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:32,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:32,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 388 flow [2022-12-06 05:30:32,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 388 flow [2022-12-06 05:30:32,251 INFO L130 PetriNetUnfolder]: 123/320 cut-off events. [2022-12-06 05:30:32,251 INFO L131 PetriNetUnfolder]: For 244/253 co-relation queries the response was YES. [2022-12-06 05:30:32,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 320 events. 123/320 cut-off events. For 244/253 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1623 event pairs, 6 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 963. Up to 99 conditions per place. [2022-12-06 05:30:32,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 388 flow [2022-12-06 05:30:32,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 05:30:32,254 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:32,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:30:32,255 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 388 flow [2022-12-06 05:30:32,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:32,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:32,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:32,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:30:32,255 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1405405651, now seen corresponding path program 1 times [2022-12-06 05:30:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:32,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55071189] [2022-12-06 05:30:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55071189] [2022-12-06 05:30:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55071189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:32,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:32,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:30:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513464592] [2022-12-06 05:30:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:32,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:30:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:30:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:30:32,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:30:32,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:32,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:32,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:30:32,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:32,477 INFO L130 PetriNetUnfolder]: 675/1072 cut-off events. [2022-12-06 05:30:32,478 INFO L131 PetriNetUnfolder]: For 1205/1205 co-relation queries the response was YES. [2022-12-06 05:30:32,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 1072 events. 675/1072 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4408 event pairs, 190 based on Foata normal form. 9/770 useless extension candidates. Maximal degree in co-relation 4020. Up to 1024 conditions per place. [2022-12-06 05:30:32,483 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 42 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2022-12-06 05:30:32,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 447 flow [2022-12-06 05:30:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:30:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:30:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 05:30:32,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 05:30:32,484 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 388 flow. Second operand 3 states and 45 transitions. [2022-12-06 05:30:32,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 447 flow [2022-12-06 05:30:32,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 402 flow, removed 15 selfloop flow, removed 9 redundant places. [2022-12-06 05:30:32,488 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-06 05:30:32,488 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2022-12-06 05:30:32,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:32,489 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:32,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:32,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,510 INFO L130 PetriNetUnfolder]: 78/242 cut-off events. [2022-12-06 05:30:32,510 INFO L131 PetriNetUnfolder]: For 98/100 co-relation queries the response was YES. [2022-12-06 05:30:32,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 242 events. 78/242 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1156 event pairs, 3 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 424. Up to 74 conditions per place. [2022-12-06 05:30:32,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 05:30:32,513 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:32,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 05:30:32,513 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 322 flow [2022-12-06 05:30:32,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:32,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:32,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:30:32,514 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2108620970, now seen corresponding path program 1 times [2022-12-06 05:30:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668324976] [2022-12-06 05:30:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:34,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668324976] [2022-12-06 05:30:34,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668324976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:34,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:30:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492988425] [2022-12-06 05:30:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:30:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:34,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:30:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:30:34,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 05:30:34,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 322 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:34,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:34,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 05:30:34,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:34,641 INFO L130 PetriNetUnfolder]: 714/1152 cut-off events. [2022-12-06 05:30:34,641 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2022-12-06 05:30:34,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 1152 events. 714/1152 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4967 event pairs, 337 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 4076. Up to 1072 conditions per place. [2022-12-06 05:30:34,645 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 48 selfloop transitions, 13 changer transitions 26/89 dead transitions. [2022-12-06 05:30:34,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 618 flow [2022-12-06 05:30:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:30:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:30:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2022-12-06 05:30:34,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 05:30:34,646 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 322 flow. Second operand 9 states and 90 transitions. [2022-12-06 05:30:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 618 flow [2022-12-06 05:30:34,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 594 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:30:34,649 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 385 flow [2022-12-06 05:30:34,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=385, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-06 05:30:34,650 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2022-12-06 05:30:34,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:34,650 INFO L89 Accepts]: Start accepts. Operand has 61 places, 58 transitions, 385 flow [2022-12-06 05:30:34,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:34,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:34,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 385 flow [2022-12-06 05:30:34,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 385 flow [2022-12-06 05:30:34,673 INFO L130 PetriNetUnfolder]: 81/251 cut-off events. [2022-12-06 05:30:34,673 INFO L131 PetriNetUnfolder]: For 155/162 co-relation queries the response was YES. [2022-12-06 05:30:34,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 251 events. 81/251 cut-off events. For 155/162 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1217 event pairs, 5 based on Foata normal form. 1/188 useless extension candidates. Maximal degree in co-relation 705. Up to 72 conditions per place. [2022-12-06 05:30:34,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 385 flow [2022-12-06 05:30:34,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 05:30:34,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (= (+ (select (select |v_#memory_int_577| v_~q2~0.base_223) (+ v_~q2~0.offset_227 (* 4 v_~q2_back~0_307))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_127|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (<= |v_thread2Thread1of1ForFork0_~j~0#1_127| 0) (= (select (select |v_#memory_int_577| v_~q1~0.base_241) (+ v_~q1~0.offset_241 (* v_~q1_front~0_251 4))) |v_thread2Thread1of1ForFork0_~j~0#1_127|) (not (= (ite (and (<= 0 v_~q1_front~0_251) (< v_~q1_front~0_251 v_~q1_back~0_363) (< v_~q1_front~0_251 v_~n1~0_241)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_70| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_70| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (= (+ v_~q2_back~0_307 1) v_~q2_back~0_306) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_127| v_~s~0_236) v_~s~0_235) (not (= (ite (and (< v_~q2_back~0_307 v_~n2~0_226) (<= 0 v_~q2_back~0_307)) 1 0) 0)) (= v_~q1_front~0_250 (+ v_~q1_front~0_251 1))) InVars {~q1~0.offset=v_~q1~0.offset_241, ~n2~0=v_~n2~0_226, ~q1_front~0=v_~q1_front~0_251, ~q1_back~0=v_~q1_back~0_363, ~q2~0.offset=v_~q2~0.offset_227, ~n1~0=v_~n1~0_241, ~q1~0.base=v_~q1~0.base_241, #memory_int=|v_#memory_int_577|, ~q2~0.base=v_~q2~0.base_223, ~q2_back~0=v_~q2_back~0_307, ~s~0=v_~s~0_236} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_127|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_81|, ~q1~0.offset=v_~q1~0.offset_241, ~n2~0=v_~n2~0_226, ~q1_front~0=v_~q1_front~0_250, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_70|, ~q2~0.offset=v_~q2~0.offset_227, ~n1~0=v_~n1~0_241, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_65|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_65|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_81|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_70|, ~q1_back~0=v_~q1_back~0_363, ~q1~0.base=v_~q1~0.base_241, #memory_int=|v_#memory_int_577|, ~q2~0.base=v_~q2~0.base_223, ~q2_back~0=v_~q2_back~0_306, ~s~0=v_~s~0_235} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:30:39,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:30:39,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [945] $Ultimate##0-->L121-3: Formula: (and (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_129| v_~s~0_240) v_~s~0_239) (= v_~q1_front~0_254 (+ v_~q1_front~0_255 1)) (not (= (ite (and (<= 0 v_~q2_back~0_311) (< v_~q2_back~0_311 v_~n2~0_228)) 1 0) 0)) (= (select (select |v_#memory_int_580| v_~q1~0.base_243) (+ (* v_~q1_front~0_255 4) v_~q1~0.offset_243)) |v_thread2Thread1of1ForFork0_~j~0#1_129|) (= (store |v_#memory_int_580| |v_ULTIMATE.start_main_~#t3~0#1.base_162| (store (select |v_#memory_int_580| |v_ULTIMATE.start_main_~#t3~0#1.base_162|) |v_ULTIMATE.start_main_~#t3~0#1.offset_155| |v_ULTIMATE.start_main_#t~pre23#1_153|)) |v_#memory_int_579|) (not (= (ite (and (<= 0 v_~q1_front~0_255) (< v_~q1_front~0_255 v_~n1~0_243) (< v_~q1_front~0_255 v_~q1_back~0_365)) 1 0) 0)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_129| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_72| 0) (= (+ v_~q2_back~0_311 1) v_~q2_back~0_310) (= (ite (= (+ (select (select |v_#memory_int_580| v_~q2~0.base_225) (+ v_~q2~0.offset_229 (* 4 v_~q2_back~0_311))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_129|) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (= |v_#pthreadsForks_287| |v_ULTIMATE.start_main_#t~pre23#1_153|) (= |v_thread2Thread1of1ForFork0_#res#1.base_72| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_135| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_135| 0)) (= (+ |v_#pthreadsForks_287| 1) |v_#pthreadsForks_286|)) InVars {~q1~0.offset=v_~q1~0.offset_243, ~n2~0=v_~n2~0_228, ~q1_front~0=v_~q1_front~0_255, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_155|, ~q2~0.offset=v_~q2~0.offset_229, ~n1~0=v_~n1~0_243, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_162|, #pthreadsForks=|v_#pthreadsForks_287|, ~q1_back~0=v_~q1_back~0_365, ~q1~0.base=v_~q1~0.base_243, #memory_int=|v_#memory_int_580|, ~q2~0.base=v_~q2~0.base_225, ~q2_back~0=v_~q2_back~0_311, ~s~0=v_~s~0_240} OutVars{thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_83|, ~q1_front~0=v_~q1_front~0_254, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_155|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_72|, ~q2~0.offset=v_~q2~0.offset_229, ~n1~0=v_~n1~0_243, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_162|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_172|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_83|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_141|, #pthreadsForks=|v_#pthreadsForks_286|, ~q1_back~0=v_~q1_back~0_365, ~q1~0.base=v_~q1~0.base_243, ~q2~0.base=v_~q2~0.base_225, ~q2_back~0=v_~q2_back~0_310, ~s~0=v_~s~0_239, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_129|, ~q1~0.offset=v_~q1~0.offset_243, ~n2~0=v_~n2~0_228, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_67|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_67|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_72|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_153|, #memory_int=|v_#memory_int_579|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre21#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ULTIMATE.start_main_#t~nondet22#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre23#1, #memory_int, ~q2_back~0, ~s~0] [2022-12-06 05:30:39,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|) (not (= (ite (and (< v_~q1_back~0_In_4 v_~n1~0_In_5) (<= 0 v_~q1_back~0_In_4)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_2)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (+ v_~q1_back~0_In_4 1) v_~q1_back~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_23| v_~q1~0.base_In_4) (+ v_~q1~0.offset_In_4 (* v_~q1_back~0_In_4 4))) 0) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|)) InVars {~q1~0.offset=v_~q1~0.offset_In_4, ~q1_back~0=v_~q1_back~0_In_4, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~n1~0=v_~n1~0_In_5, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, ~N~0=v_~N~0_In_2} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_4|, ~q1~0.offset=v_~q1~0.offset_In_4, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_4|, ~n1~0=v_~n1~0_In_5, ~N~0=v_~N~0_In_2, ~q1_back~0=v_~q1_back~0_Out_18, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~q1~0.base=v_~q1~0.base_In_4, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 05:30:39,661 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:30:39,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5011 [2022-12-06 05:30:39,661 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 407 flow [2022-12-06 05:30:39,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:39,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:39,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:30:39,662 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:30:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash -85153085, now seen corresponding path program 1 times [2022-12-06 05:30:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:39,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163463616] [2022-12-06 05:30:39,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:40,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163463616] [2022-12-06 05:30:40,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163463616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:40,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:40,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:30:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396390348] [2022-12-06 05:30:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:40,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:30:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:30:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:30:40,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 05:30:40,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:30:40,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:40,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 05:30:40,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:40,827 INFO L130 PetriNetUnfolder]: 707/1137 cut-off events. [2022-12-06 05:30:40,827 INFO L131 PetriNetUnfolder]: For 1183/1183 co-relation queries the response was YES. [2022-12-06 05:30:40,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1137 events. 707/1137 cut-off events. For 1183/1183 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4868 event pairs, 274 based on Foata normal form. 1/807 useless extension candidates. Maximal degree in co-relation 4103. Up to 1071 conditions per place. [2022-12-06 05:30:40,832 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 50 selfloop transitions, 5 changer transitions 26/83 dead transitions. [2022-12-06 05:30:40,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 667 flow [2022-12-06 05:30:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:30:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:30:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-06 05:30:40,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3088803088803089 [2022-12-06 05:30:40,840 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 407 flow. Second operand 7 states and 80 transitions. [2022-12-06 05:30:40,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 667 flow [2022-12-06 05:30:40,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 623 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-06 05:30:40,845 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 367 flow [2022-12-06 05:30:40,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2022-12-06 05:30:40,845 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2022-12-06 05:30:40,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:40,846 INFO L89 Accepts]: Start accepts. Operand has 63 places, 53 transitions, 367 flow [2022-12-06 05:30:40,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:40,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:40,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 367 flow [2022-12-06 05:30:40,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 367 flow [2022-12-06 05:30:40,870 INFO L130 PetriNetUnfolder]: 81/249 cut-off events. [2022-12-06 05:30:40,870 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 05:30:40,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 249 events. 81/249 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1165 event pairs, 3 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 715. Up to 75 conditions per place. [2022-12-06 05:30:40,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 367 flow [2022-12-06 05:30:40,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 05:30:40,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:30:40,878 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 16 out of bounds for length 16 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) 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 05:30:40,883 INFO L158 Benchmark]: Toolchain (without parser) took 122086.84ms. Allocated memory was 212.9MB in the beginning and 678.4MB in the end (delta: 465.6MB). Free memory was 190.3MB in the beginning and 266.1MB in the end (delta: -75.8MB). Peak memory consumption was 390.3MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,883 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 212.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:30:40,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.04ms. Allocated memory is still 212.9MB. Free memory was 189.8MB in the beginning and 177.2MB in the end (delta: 12.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.70ms. Allocated memory is still 212.9MB. Free memory was 176.7MB in the beginning and 174.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,884 INFO L158 Benchmark]: Boogie Preprocessor took 30.40ms. Allocated memory is still 212.9MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,884 INFO L158 Benchmark]: RCFGBuilder took 754.05ms. Allocated memory is still 212.9MB. Free memory was 172.5MB in the beginning and 140.0MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,884 INFO L158 Benchmark]: TraceAbstraction took 120986.30ms. Allocated memory was 212.9MB in the beginning and 678.4MB in the end (delta: 465.6MB). Free memory was 138.9MB in the beginning and 266.1MB in the end (delta: -127.2MB). Peak memory consumption was 338.9MB. Max. memory is 8.0GB. [2022-12-06 05:30:40,885 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.11ms. Allocated memory is still 212.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.04ms. Allocated memory is still 212.9MB. Free memory was 189.8MB in the beginning and 177.2MB in the end (delta: 12.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.70ms. Allocated memory is still 212.9MB. Free memory was 176.7MB in the beginning and 174.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.40ms. Allocated memory is still 212.9MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 754.05ms. Allocated memory is still 212.9MB. Free memory was 172.5MB in the beginning and 140.0MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 120986.30ms. Allocated memory was 212.9MB in the beginning and 678.4MB in the end (delta: 465.6MB). Free memory was 138.9MB in the beginning and 266.1MB in the end (delta: -127.2MB). Peak memory consumption was 338.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 173 PlacesBefore, 32 PlacesAfterwards, 181 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 112 TrivialYvCompositions, 29 ConcurrentYvCompositions, 11 ChoiceCompositions, 152 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 880, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 880, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 932, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 880, unknown conditional: 0, unknown unconditional: 880] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1414, Positive conditional cache size: 0, Positive unconditional cache size: 1414, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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.1s, 26 PlacesBefore, 26 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.3s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 32 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 154 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): 23, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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: 7.8s, 43 PlacesBefore, 40 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 20, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 20, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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.5s, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 10, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 40, independent conditional: 10, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 10, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 6, independent conditional: 0, independent unconditional: 6, 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: 46, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 51, Positive conditional cache size: 25, Positive unconditional cache size: 26, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 42 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 10, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 38, independent conditional: 10, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 10, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 33, independent conditional: 5, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 40, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 41 PlacesBefore, 41 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 20, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 40, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 40, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 40 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 40, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 49 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 58, independent conditional: 18, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, 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, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 64, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, 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, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, 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, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 72, Positive conditional cache size: 41, Positive unconditional cache size: 31, Negative cache size: 5, Negative conditional cache size: 1, 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.1s, 50 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 77, Positive conditional cache size: 46, Positive unconditional cache size: 31, Negative cache size: 5, Negative conditional cache size: 1, 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: 2.9s, 53 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 65, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 86, Positive conditional cache size: 55, Positive unconditional cache size: 31, Negative cache size: 5, Negative conditional cache size: 1, 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: 3.1s, 50 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 48, independent: 36, independent conditional: 4, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 91, Positive conditional cache size: 59, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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.1s, 50 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 96, Positive conditional cache size: 64, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 52 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 52, independent conditional: 20, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 101, Positive conditional cache size: 69, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 101, Positive conditional cache size: 69, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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.1s, 50 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 21, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 106, Positive conditional cache size: 74, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 106, Positive conditional cache size: 74, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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: 3.4s, 51 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 61, independent conditional: 21, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 61, independent conditional: 21, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 61, independent conditional: 21, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 56, independent conditional: 16, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 111, Positive conditional cache size: 79, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 57, independent conditional: 25, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 65, independent: 48, independent conditional: 16, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 120, Positive conditional cache size: 88, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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: 4.7s, 47 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 120, Positive conditional cache size: 88, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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: 11.7s, 54 PlacesBefore, 52 PlacesAfterwards, 52 TransitionsBefore, 50 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 162, independent conditional: 57, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 162, independent conditional: 57, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 162, independent conditional: 57, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 177, independent: 146, independent conditional: 41, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 136, Positive conditional cache size: 104, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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: 7.0s, 59 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 138, Positive conditional cache size: 106, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 102, independent conditional: 32, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 102, independent conditional: 32, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 102, independent conditional: 32, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 112, independent: 90, independent conditional: 20, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 150, Positive conditional cache size: 118, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 8, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 36, independent conditional: 8, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 8, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 40, independent: 36, independent conditional: 8, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 150, Positive conditional cache size: 118, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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.1s, 57 PlacesBefore, 55 PlacesAfterwards, 58 TransitionsBefore, 56 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 155, Positive conditional cache size: 123, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 50, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 155, Positive conditional cache size: 123, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 155, Positive conditional cache size: 123, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 1, 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: 5.0s, 60 PlacesBefore, 57 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 58, independent conditional: 10, independent unconditional: 48, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 157, Positive conditional cache size: 124, Positive unconditional cache size: 33, Negative cache size: 5, Negative conditional cache size: 1, 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: IndexOutOfBoundsException: Index 16 out of bounds for length 16 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 16 out of bounds for length 16: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:30:40,933 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...