/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/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:27:05,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:27:05,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:27:05,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:27:05,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:27:05,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:27:05,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:27:05,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:27:05,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:27:05,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:27:05,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:27:05,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:27:05,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:27:05,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:27:05,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:27:05,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:27:05,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:27:05,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:27:05,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:27:05,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:27:05,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:27:05,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:27:05,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:27:05,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:27:05,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:27:05,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:27:05,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:27:05,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:27:05,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:27:05,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:27:05,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:27:05,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:27:05,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:27:05,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:27:05,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:27:05,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:27:05,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:27:05,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:27:05,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:27:05,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:27:05,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:27:05,650 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 04:27:05,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:27:05,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:27:05,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:27:05,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:27:05,684 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:27:05,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:27:05,685 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:27:05,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:27:05,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:27:05,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:27:05,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:27:05,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:27:05,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:27:05,686 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:27:05,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:27:05,687 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:27:05,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:27:05,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:27:05,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:27:05,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:27:05,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:27:05,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:27:05,688 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:27:05,689 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 04:27:06,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:27:06,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:27:06,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:27:06,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:27:06,142 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:27:06,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2022-12-06 04:27:07,202 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:27:07,404 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:27:07,404 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2022-12-06 04:27:07,417 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043d2fa93/451863f871f444f4b0f669e3e090b391/FLAGa6df82c3a [2022-12-06 04:27:07,426 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043d2fa93/451863f871f444f4b0f669e3e090b391 [2022-12-06 04:27:07,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:27:07,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:27:07,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:27:07,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:27:07,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:27:07,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:07,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3142f2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07, skipping insertion in model container [2022-12-06 04:27:07,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:07,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:27:07,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:27:07,613 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-12-06 04:27:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:27:07,816 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:27:07,829 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-12-06 04:27:07,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:07,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:07,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:27:07,938 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:27:07,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07 WrapperNode [2022-12-06 04:27:07,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:27:07,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:27:07,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:27:07,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:27:07,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:07,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,004 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-12-06 04:27:08,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:27:08,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:27:08,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:27:08,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:27:08,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:27:08,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:27:08,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:27:08,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:27:08,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (1/1) ... [2022-12-06 04:27:08,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:27:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:27:08,092 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 04:27:08,109 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 04:27:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:27:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:27:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:27:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:27:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:27:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:27:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:27:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:27:08,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:27:08,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:27:08,146 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 04:27:08,397 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:27:08,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:27:08,784 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:27:08,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:27:08,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:27:08,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:27:08 BoogieIcfgContainer [2022-12-06 04:27:08,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:27:08,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:27:08,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:27:08,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:27:08,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:27:07" (1/3) ... [2022-12-06 04:27:08,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85202ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:27:08, skipping insertion in model container [2022-12-06 04:27:08,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:07" (2/3) ... [2022-12-06 04:27:08,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85202ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:27:08, skipping insertion in model container [2022-12-06 04:27:08,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:27:08" (3/3) ... [2022-12-06 04:27:08,975 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2022-12-06 04:27:08,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:27:08,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:27:08,992 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:27:09,042 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:27:09,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:27:09,116 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:27:09,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:09,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:27:09,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:27:09,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 04:27:09,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:09,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:27:09,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 04:27:09,168 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 04:27:09,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:09,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:27:09,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 04:27:09,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 1240 [2022-12-06 04:27:15,260 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 04:27:15,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:27:15,276 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;@11d4b3ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:27:15,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:27:15,280 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:27:15,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:15,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:15,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:15,281 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 04:27:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 511435063, now seen corresponding path program 1 times [2022-12-06 04:27:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:15,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320937328] [2022-12-06 04:27:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:15,466 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 04:27:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320937328] [2022-12-06 04:27:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320937328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:27:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444223240] [2022-12-06 04:27:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:27:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:15,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:27:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:27:15,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:27:15,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:15,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:15,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:27:15,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:15,634 INFO L130 PetriNetUnfolder]: 567/868 cut-off events. [2022-12-06 04:27:15,635 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:27:15,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 868 events. 567/868 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3580 event pairs, 567 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1768. Up to 865 conditions per place. [2022-12-06 04:27:15,670 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:27:15,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 85 flow [2022-12-06 04:27:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:27:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:27:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:27:15,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:27:15,679 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:27:15,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 85 flow [2022-12-06 04:27:15,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:27:15,682 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:27:15,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 04:27:15,685 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:27:15,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:15,686 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:27:15,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:15,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:15,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:27:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:27:15,708 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:27:15,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:15,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:27:15,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:27:15,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 04:27:15,919 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:15,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 04:27:15,920 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:27:15,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:15,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:15,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:15,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:27:15,921 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 04:27:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1862809867, now seen corresponding path program 1 times [2022-12-06 04:27:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:15,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484670895] [2022-12-06 04:27:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:16,208 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 04:27:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:16,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484670895] [2022-12-06 04:27:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484670895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:16,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:16,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:27:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132545511] [2022-12-06 04:27:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:27:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:27:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:27:16,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:27:16,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:27:16,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:16,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:27:16,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:16,352 INFO L130 PetriNetUnfolder]: 527/867 cut-off events. [2022-12-06 04:27:16,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:16,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 867 events. 527/867 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4163 event pairs, 95 based on Foata normal form. 16/882 useless extension candidates. Maximal degree in co-relation 1711. Up to 687 conditions per place. [2022-12-06 04:27:16,358 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:27:16,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 134 flow [2022-12-06 04:27:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:27:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:27:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:27:16,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 04:27:16,360 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:27:16,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 134 flow [2022-12-06 04:27:16,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:27:16,362 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 04:27:16,363 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:27:16,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:16,363 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:16,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:16,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,367 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:27:16,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:27:16,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 04:27:16,370 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:16,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:27:16,372 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:27:16,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:27:16,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:16,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:27:16,372 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 04:27:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1912529838, now seen corresponding path program 1 times [2022-12-06 04:27:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:16,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577078999] [2022-12-06 04:27:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:16,500 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 04:27:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:16,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577078999] [2022-12-06 04:27:16,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577078999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:16,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:16,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:27:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620546219] [2022-12-06 04:27:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:16,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:27:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:27:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:27:16,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:27:16,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:16,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:16,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:27:16,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:16,744 INFO L130 PetriNetUnfolder]: 979/1563 cut-off events. [2022-12-06 04:27:16,744 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 04:27:16,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 1563 events. 979/1563 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7596 event pairs, 157 based on Foata normal form. 60/1622 useless extension candidates. Maximal degree in co-relation 3325. Up to 733 conditions per place. [2022-12-06 04:27:16,749 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 33 selfloop transitions, 4 changer transitions 5/43 dead transitions. [2022-12-06 04:27:16,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 191 flow [2022-12-06 04:27:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:27:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:27:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:27:16,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:27:16,750 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:27:16,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 191 flow [2022-12-06 04:27:16,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:27:16,751 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:27:16,752 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:27:16,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:16,752 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:16,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:16,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,757 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:27:16,757 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 04:27:16,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 34 events. 3/34 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2022-12-06 04:27:16,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 04:27:16,801 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:16,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:27:16,802 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 76 flow [2022-12-06 04:27:16,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:16,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:16,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:16,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:27:16,802 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 04:27:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -841077995, now seen corresponding path program 1 times [2022-12-06 04:27:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:16,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068403790] [2022-12-06 04:27:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:16,923 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 04:27:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068403790] [2022-12-06 04:27:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068403790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:16,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:16,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:27:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974873397] [2022-12-06 04:27:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:27:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:27:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:27:16,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:27:16,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 04:27:16,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:16,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:27:16,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:17,066 INFO L130 PetriNetUnfolder]: 528/842 cut-off events. [2022-12-06 04:27:17,067 INFO L131 PetriNetUnfolder]: For 390/390 co-relation queries the response was YES. [2022-12-06 04:27:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 842 events. 528/842 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3575 event pairs, 306 based on Foata normal form. 9/846 useless extension candidates. Maximal degree in co-relation 2069. Up to 718 conditions per place. [2022-12-06 04:27:17,071 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:27:17,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 164 flow [2022-12-06 04:27:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:27:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:27:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:27:17,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:27:17,072 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 76 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:27:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 164 flow [2022-12-06 04:27:17,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 151 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:27:17,074 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:27:17,074 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:27:17,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:17,075 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:17,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:17,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,081 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:27:17,081 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-06 04:27:17,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 3/34 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2022-12-06 04:27:17,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:27:17,185 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:17,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 04:27:17,186 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 75 flow [2022-12-06 04:27:17,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 04:27:17,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:17,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:17,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:27:17,186 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 04:27:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -304547430, now seen corresponding path program 1 times [2022-12-06 04:27:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:17,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159394212] [2022-12-06 04:27:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:17,316 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 04:27:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159394212] [2022-12-06 04:27:17,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159394212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:17,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:17,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:27:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838353855] [2022-12-06 04:27:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:17,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:27:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:27:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:27:17,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:27:17,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:27:17,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:17,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:27:17,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:17,591 INFO L130 PetriNetUnfolder]: 1024/1672 cut-off events. [2022-12-06 04:27:17,591 INFO L131 PetriNetUnfolder]: For 734/734 co-relation queries the response was YES. [2022-12-06 04:27:17,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 1672 events. 1024/1672 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8816 event pairs, 298 based on Foata normal form. 90/1762 useless extension candidates. Maximal degree in co-relation 3688. Up to 618 conditions per place. [2022-12-06 04:27:17,596 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 3 changer transitions 20/52 dead transitions. [2022-12-06 04:27:17,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 244 flow [2022-12-06 04:27:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:27:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:27:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:27:17,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 04:27:17,598 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 75 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:27:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 244 flow [2022-12-06 04:27:17,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:27:17,599 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 88 flow [2022-12-06 04:27:17,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2022-12-06 04:27:17,600 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 04:27:17,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:17,600 INFO L89 Accepts]: Start accepts. Operand has 38 places, 22 transitions, 88 flow [2022-12-06 04:27:17,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:17,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:17,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 88 flow [2022-12-06 04:27:17,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 22 transitions, 88 flow [2022-12-06 04:27:17,607 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-06 04:27:17,607 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2022-12-06 04:27:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 37 events. 0/37 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-06 04:27:17,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 88 flow [2022-12-06 04:27:17,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 04:27:17,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [621] $Ultimate##0-->L814: Formula: (and (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_32 2) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] and [579] $Ultimate##0-->L759: Formula: (and (= v_~y~0_18 v_~__unbuffered_p0_EAX~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_18} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-06 04:27:17,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:27:17,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 04:27:17,667 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 91 flow [2022-12-06 04:27:17,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:27:17,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:17,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:17,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:27:17,668 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 04:27:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1001895717, now seen corresponding path program 1 times [2022-12-06 04:27:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:17,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685573860] [2022-12-06 04:27:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:18,653 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 04:27:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:18,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685573860] [2022-12-06 04:27:18,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685573860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:18,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:18,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:27:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455507419] [2022-12-06 04:27:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:18,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:27:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:27:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:27:18,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:27:18,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 04:27:18,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:18,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:27:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:18,944 INFO L130 PetriNetUnfolder]: 651/1040 cut-off events. [2022-12-06 04:27:18,944 INFO L131 PetriNetUnfolder]: For 1164/1175 co-relation queries the response was YES. [2022-12-06 04:27:18,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1040 events. 651/1040 cut-off events. For 1164/1175 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4554 event pairs, 280 based on Foata normal form. 2/1042 useless extension candidates. Maximal degree in co-relation 2532. Up to 982 conditions per place. [2022-12-06 04:27:18,951 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 30 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2022-12-06 04:27:18,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 218 flow [2022-12-06 04:27:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:27:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:27:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:27:18,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:27:18,952 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 91 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:27:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 218 flow [2022-12-06 04:27:18,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 202 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 04:27:18,955 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:18,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 04:27:18,956 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 04:27:18,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:18,956 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:18,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:18,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:18,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:18,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:18,972 INFO L130 PetriNetUnfolder]: 11/79 cut-off events. [2022-12-06 04:27:18,972 INFO L131 PetriNetUnfolder]: For 47/49 co-relation queries the response was YES. [2022-12-06 04:27:18,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 79 events. 11/79 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 347 event pairs, 2 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 166. Up to 23 conditions per place. [2022-12-06 04:27:18,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:18,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:27:19,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:19,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:27:19,006 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 125 flow [2022-12-06 04:27:19,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 04:27:19,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:19,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:27:19,007 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 04:27:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 780429723, now seen corresponding path program 1 times [2022-12-06 04:27:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:19,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789443929] [2022-12-06 04:27:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:19,195 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 04:27:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:19,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789443929] [2022-12-06 04:27:19,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789443929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:19,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:19,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:27:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585021108] [2022-12-06 04:27:19,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:19,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:27:19,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:27:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:27:19,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:27:19,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:27:19,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:19,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:27:19,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:19,379 INFO L130 PetriNetUnfolder]: 370/648 cut-off events. [2022-12-06 04:27:19,379 INFO L131 PetriNetUnfolder]: For 591/598 co-relation queries the response was YES. [2022-12-06 04:27:19,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 648 events. 370/648 cut-off events. For 591/598 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2821 event pairs, 69 based on Foata normal form. 38/685 useless extension candidates. Maximal degree in co-relation 1768. Up to 560 conditions per place. [2022-12-06 04:27:19,382 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-06 04:27:19,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 241 flow [2022-12-06 04:27:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:27:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:27:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:27:19,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:27:19,396 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 125 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:27:19,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 241 flow [2022-12-06 04:27:19,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:27:19,398 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-06 04:27:19,399 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 04:27:19,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:19,399 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:19,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:19,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,438 INFO L130 PetriNetUnfolder]: 59/201 cut-off events. [2022-12-06 04:27:19,438 INFO L131 PetriNetUnfolder]: For 151/158 co-relation queries the response was YES. [2022-12-06 04:27:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 201 events. 59/201 cut-off events. For 151/158 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1083 event pairs, 20 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 458. Up to 110 conditions per place. [2022-12-06 04:27:19,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:27:19,443 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:19,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 04:27:19,446 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 151 flow [2022-12-06 04:27:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 04:27:19,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:19,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:19,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:27:19,447 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 04:27:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash 688180894, now seen corresponding path program 1 times [2022-12-06 04:27:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293941391] [2022-12-06 04:27:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:20,742 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 04:27:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:20,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293941391] [2022-12-06 04:27:20,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293941391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:20,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:20,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:27:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997592591] [2022-12-06 04:27:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:27:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:27:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:27:20,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:27:20,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:20,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:20,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:27:20,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:20,994 INFO L130 PetriNetUnfolder]: 358/629 cut-off events. [2022-12-06 04:27:20,994 INFO L131 PetriNetUnfolder]: For 663/669 co-relation queries the response was YES. [2022-12-06 04:27:21,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 629 events. 358/629 cut-off events. For 663/669 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2689 event pairs, 124 based on Foata normal form. 6/635 useless extension candidates. Maximal degree in co-relation 1980. Up to 473 conditions per place. [2022-12-06 04:27:21,036 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2022-12-06 04:27:21,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 305 flow [2022-12-06 04:27:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:27:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:27:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 04:27:21,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 04:27:21,037 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 151 flow. Second operand 4 states and 40 transitions. [2022-12-06 04:27:21,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 305 flow [2022-12-06 04:27:21,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:27:21,040 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 04:27:21,042 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 04:27:21,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:21,042 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:21,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:21,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,062 INFO L130 PetriNetUnfolder]: 59/192 cut-off events. [2022-12-06 04:27:21,062 INFO L131 PetriNetUnfolder]: For 173/175 co-relation queries the response was YES. [2022-12-06 04:27:21,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 192 events. 59/192 cut-off events. For 173/175 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 979 event pairs, 20 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 444. Up to 109 conditions per place. [2022-12-06 04:27:21,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 04:27:21,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:21,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 04:27:21,109 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 183 flow [2022-12-06 04:27:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:21,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:21,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:21,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:27:21,110 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 04:27:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -328241868, now seen corresponding path program 1 times [2022-12-06 04:27:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:21,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771843917] [2022-12-06 04:27:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:21,243 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 04:27:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:21,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771843917] [2022-12-06 04:27:21,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771843917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:21,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:21,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:27:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561879540] [2022-12-06 04:27:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:21,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:27:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:27:21,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:27:21,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:27:21,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:27:21,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:21,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:27:21,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:21,327 INFO L130 PetriNetUnfolder]: 144/298 cut-off events. [2022-12-06 04:27:21,327 INFO L131 PetriNetUnfolder]: For 340/342 co-relation queries the response was YES. [2022-12-06 04:27:21,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 298 events. 144/298 cut-off events. For 340/342 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1219 event pairs, 19 based on Foata normal form. 39/334 useless extension candidates. Maximal degree in co-relation 962. Up to 133 conditions per place. [2022-12-06 04:27:21,329 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2022-12-06 04:27:21,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 346 flow [2022-12-06 04:27:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:27:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:27:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:27:21,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2022-12-06 04:27:21,330 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 183 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:27:21,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 346 flow [2022-12-06 04:27:21,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 335 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:27:21,333 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-06 04:27:21,334 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 04:27:21,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:21,334 INFO L89 Accepts]: Start accepts. Operand has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:21,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:21,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,350 INFO L130 PetriNetUnfolder]: 33/135 cut-off events. [2022-12-06 04:27:21,350 INFO L131 PetriNetUnfolder]: For 181/199 co-relation queries the response was YES. [2022-12-06 04:27:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 135 events. 33/135 cut-off events. For 181/199 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 581 event pairs, 4 based on Foata normal form. 7/140 useless extension candidates. Maximal degree in co-relation 395. Up to 66 conditions per place. [2022-12-06 04:27:21,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 04:27:21,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:27:21,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:27:21,354 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 216 flow [2022-12-06 04:27:21,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:27:21,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:21,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:21,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:27:21,354 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 04:27:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash -335177607, now seen corresponding path program 1 times [2022-12-06 04:27:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:21,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844924694] [2022-12-06 04:27:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:27:21,519 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 04:27:21,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:27:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844924694] [2022-12-06 04:27:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844924694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:27:21,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:27:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:27:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109802883] [2022-12-06 04:27:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:27:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:27:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:27:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:27:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:27:21,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:27:21,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:21,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:27:21,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:27:21,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:27:21,632 INFO L130 PetriNetUnfolder]: 105/217 cut-off events. [2022-12-06 04:27:21,632 INFO L131 PetriNetUnfolder]: For 306/307 co-relation queries the response was YES. [2022-12-06 04:27:21,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 217 events. 105/217 cut-off events. For 306/307 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 832 event pairs, 14 based on Foata normal form. 17/231 useless extension candidates. Maximal degree in co-relation 785. Up to 83 conditions per place. [2022-12-06 04:27:21,634 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 10 changer transitions 10/50 dead transitions. [2022-12-06 04:27:21,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 363 flow [2022-12-06 04:27:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:27:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:27:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 04:27:21,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 04:27:21,635 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 216 flow. Second operand 5 states and 49 transitions. [2022-12-06 04:27:21,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 363 flow [2022-12-06 04:27:21,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 322 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 04:27:21,638 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 169 flow [2022-12-06 04:27:21,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2022-12-06 04:27:21,638 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 04:27:21,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:27:21,639 INFO L89 Accepts]: Start accepts. Operand has 48 places, 29 transitions, 169 flow [2022-12-06 04:27:21,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:27:21,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:21,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 29 transitions, 169 flow [2022-12-06 04:27:21,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 29 transitions, 169 flow [2022-12-06 04:27:21,649 INFO L130 PetriNetUnfolder]: 11/47 cut-off events. [2022-12-06 04:27:21,649 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 04:27:21,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 47 events. 11/47 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 95 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2022-12-06 04:27:21,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 29 transitions, 169 flow [2022-12-06 04:27:21,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 04:27:24,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L797: Formula: (let ((.cse9 (= (mod v_~x$w_buff1_used~0_501 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd2~0_229 256) 0)) (.cse15 (= (mod v_~x$r_buff0_thd2~0_236 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_510 256) 0))) (let ((.cse11 (not .cse16)) (.cse10 (not .cse15)) (.cse13 (and .cse4 .cse15)) (.cse14 (and .cse15 .cse9)) (.cse0 (= (mod v_~weak$$choice2~0_102 256) 0)) (.cse6 (select |v_#memory_int_616| |v_~#x~0.base_265|))) (let ((.cse8 (select .cse6 |v_~#x~0.offset_265|)) (.cse5 (= (mod v_~x$w_buff1_used~0_500 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_509 256) 0)) (.cse1 (not .cse0)) (.cse7 (or .cse13 .cse14 .cse16)) (.cse12 (and .cse11 .cse10))) (and (= v_P1Thread1of1ForFork1_~arg.base_45 |v_P1Thread1of1ForFork1_#in~arg.base_45|) (= v_~weak$$choice0~0_69 |v_P1Thread1of1ForFork1_#t~nondet6_98|) (= v_~y~0_74 1) (or (and .cse0 (= |v_P1_#t~ite13_90| |v_P1_#t~mem12_93|) (= v_~__unbuffered_p1_EAX~0_160 |v_P1_#t~mem12_93|)) (and (= |v_P1_#t~ite13_90| v_~x$mem_tmp~0_76) .cse1 (= |v_P1Thread1of1ForFork1_#t~mem12_98| |v_P1_#t~mem12_93|))) (= |v_P1Thread1of1ForFork1_#in~arg.offset_45| v_P1Thread1of1ForFork1_~arg.offset_45) (= (ite .cse1 v_~x$r_buff1_thd2~0_229 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd2~0_235 256) 0))) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse3))) v_~x$r_buff1_thd2~0_229 0)) v_~x$r_buff1_thd2~0_228) (= v_~x$flush_delayed~0_90 0) (= |v_#memory_int_615| (store |v_#memory_int_616| |v_~#x~0.base_265| (store .cse6 |v_~#x~0.offset_265| |v_P1_#t~ite13_90|))) (or (and (= v_~__unbuffered_p1_EAX~0_160 |v_P1_#t~mem9_85|) .cse7 (= .cse8 |v_P1_#t~mem9_85|)) (and (or (not .cse9) .cse10) .cse11 (= v_~__unbuffered_p1_EAX~0_160 (ite .cse12 v_~x$w_buff0~0_246 v_~x$w_buff1~0_258)) (or (not .cse4) .cse10) (= |v_P1Thread1of1ForFork1_#t~mem9_98| |v_P1_#t~mem9_85|))) (= v_~x$mem_tmp~0_76 .cse8) (= v_~__unbuffered_p1_EAX$read_delayed~0_108 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_109 |v_~#x~0.offset_265|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_109 |v_~#x~0.base_265|) (= (ite .cse1 v_~x$w_buff1_used~0_501 (ite (or .cse2 .cse13 .cse14) v_~x$w_buff1_used~0_501 0)) v_~x$w_buff1_used~0_500) (= v_~x$w_buff0~0_246 v_~x$w_buff0~0_245) (= (ite .cse1 v_~x$r_buff0_thd2~0_236 (ite (or .cse2 .cse13 (and .cse5 .cse15)) v_~x$r_buff0_thd2~0_236 (ite (and .cse10 (not .cse2)) 0 v_~x$r_buff0_thd2~0_236))) v_~x$r_buff0_thd2~0_235) (= (ite .cse1 v_~x$w_buff0_used~0_510 (ite .cse7 v_~x$w_buff0_used~0_510 (ite .cse12 0 v_~x$w_buff0_used~0_510))) v_~x$w_buff0_used~0_509) (= v_~weak$$choice2~0_102 |v_P1Thread1of1ForFork1_#t~nondet7_98|) (= v_~x$w_buff1~0_258 v_~x$w_buff1~0_257))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_246, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_98|, ~#x~0.offset=|v_~#x~0.offset_265|, ~x$w_buff1~0=v_~x$w_buff1~0_258, P1Thread1of1ForFork1_#t~mem12=|v_P1Thread1of1ForFork1_#t~mem12_98|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_501, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_98|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_236, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_45|, #memory_int=|v_#memory_int_616|, ~#x~0.base=|v_~#x~0.base_265|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_45|, P1Thread1of1ForFork1_#t~mem9=|v_P1Thread1of1ForFork1_#t~mem9_98|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_245, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_108, ~x$mem_tmp~0=v_~x$mem_tmp~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_160, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_45|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_109, ~y~0=v_~y~0_74, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_51|, ~#x~0.offset=|v_~#x~0.offset_265|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_45, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_51|, ~x$w_buff1~0=v_~x$w_buff1~0_257, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_109, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_228, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_500, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_51|, P1Thread1of1ForFork1_#t~ite13=|v_P1Thread1of1ForFork1_#t~ite13_51|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_235, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_509, ~weak$$choice0~0=v_~weak$$choice0~0_69, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_45, #memory_int=|v_#memory_int_615|, ~#x~0.base=|v_~#x~0.base_265|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_45|, ~weak$$choice2~0=v_~weak$$choice2~0_102} AuxVars[|v_P1_#t~mem9_85|, |v_P1_#t~mem12_93|, |v_P1_#t~ite13_90|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~y~0, P1Thread1of1ForFork1_#t~mem8, P1Thread1of1ForFork1_#t~mem9, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P1Thread1of1ForFork1_#t~mem12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite10, P1Thread1of1ForFork1_#t~ite13, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0] and [655] $Ultimate##0-->L821: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd3~0_94 256) 0))) (let ((.cse2 (= (mod v_~x$r_buff1_thd3~0_88 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_521 256) 0)) (.cse9 (not .cse6)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_530 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_531 256) 0))) (let ((.cse8 (not .cse7)) (.cse0 (select |v_#memory_int_647| |v_~#x~0.base_279|)) (.cse10 (and .cse9 .cse11)) (.cse4 (not .cse1)) (.cse5 (not .cse2))) (and (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_13|) (let ((.cse3 (= |v_P2Thread1of1ForFork2_#t~mem17_46| |v_P2_#t~mem17_56|))) (or (and (= |v_P2_#t~ite19_49| |v_P2_#t~ite18_53|) (or (and (= (select .cse0 |v_~#x~0.offset_279|) |v_P2_#t~mem17_56|) (or .cse1 .cse2) (= |v_P2_#t~ite18_53| |v_P2_#t~mem17_56|)) (and .cse3 (= |v_P2_#t~ite18_53| v_~x$w_buff1~0_270) .cse4 .cse5)) (or .cse6 .cse7)) (and .cse8 .cse3 .cse9 (= |v_P2_#t~ite19_49| v_~x$w_buff0~0_258) (= |v_P2_#t~ite18_53| |v_P2Thread1of1ForFork2_#t~ite18_46|)))) (= v_~x$r_buff0_thd3~0_93 (ite .cse10 0 v_~x$r_buff0_thd3~0_94)) (= v_~y~0_82 2) (= v_~x$w_buff0_used~0_530 (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_531)) (= (store |v_#memory_int_647| |v_~#x~0.base_279| (store .cse0 |v_~#x~0.offset_279| |v_P2_#t~ite19_49|)) |v_#memory_int_646|) (= (ite (or .cse10 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_521) v_~x$w_buff1_used~0_520) (= v_~x$r_buff1_thd3~0_87 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_520 256) 0)) .cse5) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_93 256) 0)))) 0 v_~x$r_buff1_thd3~0_88)) (= |v_P2Thread1of1ForFork2_#in~arg.base_13| v_P2Thread1of1ForFork2_~arg.base_13))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_258, P2Thread1of1ForFork2_#t~mem17=|v_P2Thread1of1ForFork2_#t~mem17_46|, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, ~#x~0.offset=|v_~#x~0.offset_279|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_521, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_531, #memory_int=|v_#memory_int_647|, ~#x~0.base=|v_~#x~0.base_279|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_46|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, ~#x~0.offset=|v_~#x~0.offset_279|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_520, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_93, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_530, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, #memory_int=|v_#memory_int_646|, ~#x~0.base=|v_~#x~0.base_279|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, ~y~0=v_~y~0_82, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_25|} AuxVars[|v_P2_#t~ite18_53|, |v_P2_#t~mem17_56|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork2_#t~mem17, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, P2Thread1of1ForFork2_#t~ite18, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~ite19] [2022-12-06 04:27:26,504 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:27:26,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4867 [2022-12-06 04:27:26,505 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 185 flow [2022-12-06 04:27:26,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:27:26,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:27:26,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:26,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:27:26,508 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 04:27:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:27:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2001663754, now seen corresponding path program 1 times [2022-12-06 04:27:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:27:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476966500] [2022-12-06 04:27:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:27:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:27:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:27:26,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:27:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:27:26,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:27:26,768 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:27:26,768 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:27:26,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:27:26,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:27:26,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:27:26,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:27:26,770 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:27:26,779 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:27:26,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:27:26,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:27:26 BasicIcfg [2022-12-06 04:27:26,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:27:26,877 INFO L158 Benchmark]: Toolchain (without parser) took 19447.85ms. Allocated memory was 187.7MB in the beginning and 588.3MB in the end (delta: 400.6MB). Free memory was 146.5MB in the beginning and 357.0MB in the end (delta: -210.6MB). Peak memory consumption was 190.6MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,877 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:27:26,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.30ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 119.7MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.39ms. Allocated memory is still 187.7MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,878 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 187.7MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,878 INFO L158 Benchmark]: RCFGBuilder took 909.74ms. Allocated memory is still 187.7MB. Free memory was 115.5MB in the beginning and 160.3MB in the end (delta: -44.7MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,879 INFO L158 Benchmark]: TraceAbstraction took 17909.44ms. Allocated memory was 187.7MB in the beginning and 588.3MB in the end (delta: 400.6MB). Free memory was 159.8MB in the beginning and 357.0MB in the end (delta: -197.3MB). Peak memory consumption was 202.8MB. Max. memory is 8.0GB. [2022-12-06 04:27:26,881 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.30ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 119.7MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.39ms. Allocated memory is still 187.7MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 187.7MB. Free memory was 117.6MB in the beginning and 115.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 909.74ms. Allocated memory is still 187.7MB. Free memory was 115.5MB in the beginning and 160.3MB in the end (delta: -44.7MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17909.44ms. Allocated memory was 187.7MB in the beginning and 588.3MB in the end (delta: 400.6MB). Free memory was 159.8MB in the beginning and 357.0MB in the end (delta: -197.3MB). Peak memory consumption was 202.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 118 PlacesBefore, 30 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 846, independent: 796, independent conditional: 796, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 846, independent: 796, independent conditional: 0, independent unconditional: 796, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 846, independent: 796, independent conditional: 0, independent unconditional: 796, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 846, independent: 796, independent conditional: 0, independent unconditional: 796, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 742, independent: 710, independent conditional: 0, independent unconditional: 710, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 742, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 411, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 846, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 742, unknown conditional: 0, unknown unconditional: 742] , Statistics on independence cache: Total cache size (in pairs): 1027, Positive cache size: 995, Positive conditional cache size: 0, Positive unconditional cache size: 995, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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, 27 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 3, independent unconditional: 30, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 8, independent unconditional: 37, dependent: 17, dependent conditional: 9, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 86, independent conditional: 24, independent unconditional: 62, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 37, independent conditional: 37, 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: 45, independent: 37, independent conditional: 10, independent unconditional: 27, 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: 45, independent: 37, independent conditional: 4, independent unconditional: 33, 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: 45, independent: 37, independent conditional: 4, independent unconditional: 33, 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: 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: 0, independent conditional: 0, independent unconditional: 0, 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: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 80, Positive conditional cache size: 2, Positive unconditional cache size: 78, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 160 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): 109, Positive cache size: 80, Positive conditional cache size: 2, Positive unconditional cache size: 78, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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, 33 TransitionsBefore, 33 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, 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: 8, independent: 3, independent conditional: 2, independent unconditional: 1, 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: 8, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 8, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 82, Positive conditional cache size: 3, Positive unconditional cache size: 79, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 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] , 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: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 83, Positive conditional cache size: 3, Positive unconditional cache size: 80, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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.9s, 48 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 31, independent conditional: 26, independent unconditional: 5, 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: 46, independent: 31, independent conditional: 26, independent unconditional: 5, 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: 13, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 119, Positive conditional cache size: 13, Positive unconditional cache size: 106, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2000, ((void *)0), P0, ((void *)0))=-1, t2000={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2001; [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2001, ((void *)0), P1, ((void *)0))=0, t2000={7:0}, t2001={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 [L796] 2 y = 1 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 \read(x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L842] 0 pthread_t t2002; [L843] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2002, ((void *)0), P2, ((void *)0))=1, t2000={7:0}, t2001={8:0}, t2002={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L813] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 \read(x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 __unbuffered_p0_EAX = y [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 \read(x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 \read(x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 2 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:27:26,922 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...