/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:32:57,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:32:57,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:32:57,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:32:57,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:32:57,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:32:57,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:32:57,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:32:57,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:32:57,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:32:57,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:32:57,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:32:57,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:32:57,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:32:57,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:32:57,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:32:57,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:32:57,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:32:57,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:32:57,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:32:57,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:32:57,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:32:57,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:32:57,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:32:57,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:32:57,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:32:57,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:32:57,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:32:57,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:32:57,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:32:57,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:32:57,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:32:57,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:32:57,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:32:57,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:32:57,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:32:57,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:32:57,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:32:57,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:32:57,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:32:57,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:32:57,163 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:32:57,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:32:57,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:32:57,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:32:57,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:32:57,202 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:32:57,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:32:57,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:32:57,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:32:57,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:32:57,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:32:57,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:32:57,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:32:57,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:32:57,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:32:57,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:32:57,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:32:57,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:32:57,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:32:57,207 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 06:32:57,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:32:57,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:32:57,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:32:57,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:32:57,543 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:32:57,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2022-12-06 06:32:58,689 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:32:58,942 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:32:58,943 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2022-12-06 06:32:58,957 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dea03f8a/653ecae194de44768293fb783c37d3a7/FLAG8413a489c [2022-12-06 06:32:58,970 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dea03f8a/653ecae194de44768293fb783c37d3a7 [2022-12-06 06:32:58,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:32:58,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:32:58,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:32:58,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:32:58,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:32:58,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:32:58" (1/1) ... [2022-12-06 06:32:58,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42214ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:58, skipping insertion in model container [2022-12-06 06:32:58,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:32:58" (1/1) ... [2022-12-06 06:32:58,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:32:59,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:32:59,159 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/rfi006_power.oepc.i[994,1007] [2022-12-06 06:32:59,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:32:59,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:32:59,425 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/rfi006_power.oepc.i[994,1007] [2022-12-06 06:32:59,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:32:59,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:32:59,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:32:59,542 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:32:59,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59 WrapperNode [2022-12-06 06:32:59,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:32:59,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:32:59,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:32:59,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:32:59,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,622 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 06:32:59,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:32:59,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:32:59,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:32:59,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:32:59,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:32:59,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:32:59,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:32:59,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:32:59,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (1/1) ... [2022-12-06 06:32:59,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:32:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:32:59,707 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 06:32:59,729 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 06:32:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:32:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:32:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:32:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:32:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:32:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:32:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:32:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:32:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:32:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:32:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:32:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:32:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:32:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:32:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:32:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:32:59,751 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 06:32:59,960 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:32:59,962 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:33:00,355 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:33:00,665 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:33:00,666 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:33:00,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:33:00 BoogieIcfgContainer [2022-12-06 06:33:00,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:33:00,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:33:00,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:33:00,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:33:00,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:32:58" (1/3) ... [2022-12-06 06:33:00,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020a8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:33:00, skipping insertion in model container [2022-12-06 06:33:00,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:32:59" (2/3) ... [2022-12-06 06:33:00,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020a8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:33:00, skipping insertion in model container [2022-12-06 06:33:00,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:33:00" (3/3) ... [2022-12-06 06:33:00,681 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2022-12-06 06:33:00,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:33:00,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:33:00,698 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:33:00,788 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:33:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:33:00,896 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 06:33:00,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:00,903 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 49 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 06:33:00,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:33:00,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 06:33:00,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:33:00,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:33:00,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 06:33:00,991 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 06:33:00,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:33:00,992 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 40 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 06:33:00,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:33:00,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 06:33:21,718 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 575 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 06:34:21,082 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 06:34:21,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:34:21,105 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;@100a5c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:34:21,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:34:21,110 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 06:34:21,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:21,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:21,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:21,111 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 06:34:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -187539653, now seen corresponding path program 1 times [2022-12-06 06:34:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:21,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576106834] [2022-12-06 06:34:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:21,337 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 06:34:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:21,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576106834] [2022-12-06 06:34:21,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576106834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:21,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:21,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277459051] [2022-12-06 06:34:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:34:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:34:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:34:21,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:34:21,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 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 06:34:21,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:21,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:34:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:21,629 INFO L130 PetriNetUnfolder]: 407/638 cut-off events. [2022-12-06 06:34:21,630 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:34:21,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 638 events. 407/638 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2582 event pairs, 407 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 1294. Up to 631 conditions per place. [2022-12-06 06:34:21,639 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 06:34:21,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 81 flow [2022-12-06 06:34:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:34:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:34:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-12-06 06:34:21,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:34:21,651 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 22 transitions. [2022-12-06 06:34:21,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 81 flow [2022-12-06 06:34:21,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:34:21,655 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 06:34:21,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 06:34:21,660 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 06:34:21,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:21,661 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 06:34:21,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:21,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:21,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 06:34:21,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 06:34:21,670 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:34:21,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:21,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:34:21,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 06:34:21,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 06:34:21,845 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:21,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 06:34:21,850 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 06:34:21,851 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 06:34:21,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:21,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:21,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:34:21,852 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 06:34:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash 163006331, now seen corresponding path program 1 times [2022-12-06 06:34:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:21,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114074570] [2022-12-06 06:34:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:22,368 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 06:34:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:22,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114074570] [2022-12-06 06:34:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114074570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904536608] [2022-12-06 06:34:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:22,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:22,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:34:22,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 06:34:22,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:22,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:34:22,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:22,544 INFO L130 PetriNetUnfolder]: 367/634 cut-off events. [2022-12-06 06:34:22,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:22,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 634 events. 367/634 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2989 event pairs, 79 based on Foata normal form. 16/649 useless extension candidates. Maximal degree in co-relation 1234. Up to 453 conditions per place. [2022-12-06 06:34:22,550 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 06:34:22,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 130 flow [2022-12-06 06:34:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:34:22,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 06:34:22,551 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:34:22,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 130 flow [2022-12-06 06:34:22,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:22,553 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 06:34:22,554 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 06:34:22,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:22,554 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:22,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:22,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,561 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:34:22,561 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:22,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:34:22,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 06:34:22,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:22,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:34:22,564 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 06:34:22,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 06:34:22,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:22,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:22,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:34:22,565 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 06:34:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 758227704, now seen corresponding path program 1 times [2022-12-06 06:34:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:22,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763583048] [2022-12-06 06:34:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:22,810 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 06:34:22,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763583048] [2022-12-06 06:34:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763583048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293474487] [2022-12-06 06:34:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:22,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:22,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:34:22,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:22,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:22,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:34:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:23,071 INFO L130 PetriNetUnfolder]: 663/1008 cut-off events. [2022-12-06 06:34:23,071 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 06:34:23,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1008 events. 663/1008 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4080 event pairs, 147 based on Foata normal form. 4/1012 useless extension candidates. Maximal degree in co-relation 2260. Up to 949 conditions per place. [2022-12-06 06:34:23,080 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 06:34:23,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 145 flow [2022-12-06 06:34:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 06:34:23,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 06:34:23,081 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 32 transitions. [2022-12-06 06:34:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 145 flow [2022-12-06 06:34:23,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:23,083 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-06 06:34:23,084 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 06:34:23,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:23,084 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:23,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:23,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,094 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 06:34:23,094 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:34:23,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2022-12-06 06:34:23,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:34:23,183 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:23,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 06:34:23,184 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 67 flow [2022-12-06 06:34:23,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:23,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:23,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:23,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:34:23,185 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 06:34:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1886673222, now seen corresponding path program 1 times [2022-12-06 06:34:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:23,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443142057] [2022-12-06 06:34:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:23,372 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 06:34:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:23,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443142057] [2022-12-06 06:34:23,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443142057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:23,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:23,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428031052] [2022-12-06 06:34:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:23,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:23,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:34:23,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 67 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 06:34:23,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:23,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:34:23,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:23,650 INFO L130 PetriNetUnfolder]: 857/1338 cut-off events. [2022-12-06 06:34:23,650 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2022-12-06 06:34:23,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1338 events. 857/1338 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5946 event pairs, 459 based on Foata normal form. 40/1378 useless extension candidates. Maximal degree in co-relation 3092. Up to 837 conditions per place. [2022-12-06 06:34:23,657 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 06:34:23,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 165 flow [2022-12-06 06:34:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:34:23,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 06:34:23,659 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 67 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:34:23,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 165 flow [2022-12-06 06:34:23,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:23,661 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:34:23,661 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 06:34:23,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:23,662 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:23,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:23,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,669 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:34:23,670 INFO L131 PetriNetUnfolder]: For 19/25 co-relation queries the response was YES. [2022-12-06 06:34:23,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 28 events. 0/28 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 06:34:23,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:34:23,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:23,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:34:23,672 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 75 flow [2022-12-06 06:34:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 06:34:23,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:23,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:23,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:34:23,673 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 06:34:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1892249440, now seen corresponding path program 1 times [2022-12-06 06:34:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:23,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174408752] [2022-12-06 06:34:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:23,842 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 06:34:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174408752] [2022-12-06 06:34:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174408752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:23,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:23,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240477514] [2022-12-06 06:34:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:23,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:34:23,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:23,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:23,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:34:23,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:24,054 INFO L130 PetriNetUnfolder]: 662/1055 cut-off events. [2022-12-06 06:34:24,055 INFO L131 PetriNetUnfolder]: For 444/465 co-relation queries the response was YES. [2022-12-06 06:34:24,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1055 events. 662/1055 cut-off events. For 444/465 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4816 event pairs, 203 based on Foata normal form. 16/1069 useless extension candidates. Maximal degree in co-relation 2466. Up to 750 conditions per place. [2022-12-06 06:34:24,062 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 06:34:24,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 152 flow [2022-12-06 06:34:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 06:34:24,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 06:34:24,063 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 75 flow. Second operand 3 states and 31 transitions. [2022-12-06 06:34:24,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 152 flow [2022-12-06 06:34:24,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 147 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:24,066 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 06:34:24,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-06 06:34:24,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:24,067 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:24,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:24,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,074 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:34:24,074 INFO L131 PetriNetUnfolder]: For 21/27 co-relation queries the response was YES. [2022-12-06 06:34:24,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 28 events. 0/28 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-06 06:34:24,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 06:34:24,076 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:24,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:34:24,077 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 78 flow [2022-12-06 06:34:24,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:24,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:24,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:24,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:34:24,078 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 06:34:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1469812160, now seen corresponding path program 1 times [2022-12-06 06:34:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:24,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102951252] [2022-12-06 06:34:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:25,117 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 06:34:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:25,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102951252] [2022-12-06 06:34:25,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102951252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:25,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:25,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:34:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762996460] [2022-12-06 06:34:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:25,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:34:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:25,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:34:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:34:25,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:34:25,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:25,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:25,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:34:25,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:25,438 INFO L130 PetriNetUnfolder]: 543/909 cut-off events. [2022-12-06 06:34:25,438 INFO L131 PetriNetUnfolder]: For 437/449 co-relation queries the response was YES. [2022-12-06 06:34:25,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 909 events. 543/909 cut-off events. For 437/449 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4363 event pairs, 91 based on Foata normal form. 9/917 useless extension candidates. Maximal degree in co-relation 2162. Up to 667 conditions per place. [2022-12-06 06:34:25,445 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 36 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 06:34:25,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 229 flow [2022-12-06 06:34:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 06:34:25,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2022-12-06 06:34:25,447 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 78 flow. Second operand 5 states and 51 transitions. [2022-12-06 06:34:25,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 229 flow [2022-12-06 06:34:25,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:25,449 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 06:34:25,450 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-06 06:34:25,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:25,450 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:25,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:25,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,461 INFO L130 PetriNetUnfolder]: 3/50 cut-off events. [2022-12-06 06:34:25,462 INFO L131 PetriNetUnfolder]: For 52/58 co-relation queries the response was YES. [2022-12-06 06:34:25,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 50 events. 3/50 cut-off events. For 52/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 108. Up to 12 conditions per place. [2022-12-06 06:34:25,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 06:34:25,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:25,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 06:34:25,574 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 115 flow [2022-12-06 06:34:25,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:25,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:25,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:25,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:34:25,575 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 06:34:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -425399662, now seen corresponding path program 2 times [2022-12-06 06:34:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:25,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078531400] [2022-12-06 06:34:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:26,740 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 06:34:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078531400] [2022-12-06 06:34:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078531400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:26,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:26,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:34:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445773184] [2022-12-06 06:34:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:26,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:34:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:34:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:34:26,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:34:26,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:26,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:26,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:34:26,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:27,017 INFO L130 PetriNetUnfolder]: 639/1063 cut-off events. [2022-12-06 06:34:27,017 INFO L131 PetriNetUnfolder]: For 769/780 co-relation queries the response was YES. [2022-12-06 06:34:27,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1063 events. 639/1063 cut-off events. For 769/780 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5217 event pairs, 144 based on Foata normal form. 9/1069 useless extension candidates. Maximal degree in co-relation 2798. Up to 645 conditions per place. [2022-12-06 06:34:27,023 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 12 changer transitions 0/48 dead transitions. [2022-12-06 06:34:27,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 272 flow [2022-12-06 06:34:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:34:27,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 06:34:27,025 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 115 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:34:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 272 flow [2022-12-06 06:34:27,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:27,028 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-06 06:34:27,029 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 06:34:27,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:27,029 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:27,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:27,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,041 INFO L130 PetriNetUnfolder]: 7/78 cut-off events. [2022-12-06 06:34:27,041 INFO L131 PetriNetUnfolder]: For 72/79 co-relation queries the response was YES. [2022-12-06 06:34:27,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 78 events. 7/78 cut-off events. For 72/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 362 event pairs, 0 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 185. Up to 14 conditions per place. [2022-12-06 06:34:27,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:34:27,064 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:27,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:34:27,066 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 185 flow [2022-12-06 06:34:27,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:27,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:27,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:27,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:34:27,066 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 06:34:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -212362905, now seen corresponding path program 1 times [2022-12-06 06:34:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:27,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432707885] [2022-12-06 06:34:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:27,259 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 06:34:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:27,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432707885] [2022-12-06 06:34:27,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432707885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:27,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:27,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777921735] [2022-12-06 06:34:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:27,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:27,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:27,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:27,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:34:27,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 06:34:27,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:27,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:34:27,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:27,414 INFO L130 PetriNetUnfolder]: 412/732 cut-off events. [2022-12-06 06:34:27,414 INFO L131 PetriNetUnfolder]: For 787/793 co-relation queries the response was YES. [2022-12-06 06:34:27,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 732 events. 412/732 cut-off events. For 787/793 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3525 event pairs, 87 based on Foata normal form. 29/752 useless extension candidates. Maximal degree in co-relation 2208. Up to 599 conditions per place. [2022-12-06 06:34:27,419 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 43 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2022-12-06 06:34:27,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 360 flow [2022-12-06 06:34:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:34:27,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 06:34:27,420 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 185 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:34:27,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 360 flow [2022-12-06 06:34:27,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 345 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:27,424 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 201 flow [2022-12-06 06:34:27,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-06 06:34:27,424 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2022-12-06 06:34:27,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:27,425 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 201 flow [2022-12-06 06:34:27,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:27,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:27,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 201 flow [2022-12-06 06:34:27,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 201 flow [2022-12-06 06:34:27,453 INFO L130 PetriNetUnfolder]: 58/191 cut-off events. [2022-12-06 06:34:27,453 INFO L131 PetriNetUnfolder]: For 217/226 co-relation queries the response was YES. [2022-12-06 06:34:27,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 191 events. 58/191 cut-off events. For 217/226 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 996 event pairs, 16 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 497. Up to 93 conditions per place. [2022-12-06 06:34:27,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 201 flow [2022-12-06 06:34:27,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:34:27,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:34:27,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 470 [2022-12-06 06:34:27,896 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 203 flow [2022-12-06 06:34:27,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 06:34:27,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:27,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:27,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:34:27,896 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 06:34:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1393859932, now seen corresponding path program 1 times [2022-12-06 06:34:27,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:27,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443978507] [2022-12-06 06:34:27,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:27,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:28,104 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 06:34:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443978507] [2022-12-06 06:34:28,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443978507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:28,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:28,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403904456] [2022-12-06 06:34:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:28,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:34:28,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 203 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 06:34:28,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:28,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:34:28,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:28,257 INFO L130 PetriNetUnfolder]: 229/448 cut-off events. [2022-12-06 06:34:28,258 INFO L131 PetriNetUnfolder]: For 454/456 co-relation queries the response was YES. [2022-12-06 06:34:28,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 448 events. 229/448 cut-off events. For 454/456 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2074 event pairs, 41 based on Foata normal form. 40/479 useless extension candidates. Maximal degree in co-relation 1537. Up to 166 conditions per place. [2022-12-06 06:34:28,261 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 48 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2022-12-06 06:34:28,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 406 flow [2022-12-06 06:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 06:34:28,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-06 06:34:28,263 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 203 flow. Second operand 4 states and 49 transitions. [2022-12-06 06:34:28,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 406 flow [2022-12-06 06:34:28,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:28,267 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 208 flow [2022-12-06 06:34:28,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-06 06:34:28,268 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 06:34:28,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:28,269 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 208 flow [2022-12-06 06:34:28,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:28,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:28,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 208 flow [2022-12-06 06:34:28,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 208 flow [2022-12-06 06:34:28,288 INFO L130 PetriNetUnfolder]: 28/123 cut-off events. [2022-12-06 06:34:28,289 INFO L131 PetriNetUnfolder]: For 152/168 co-relation queries the response was YES. [2022-12-06 06:34:28,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 123 events. 28/123 cut-off events. For 152/168 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 535 event pairs, 2 based on Foata normal form. 7/125 useless extension candidates. Maximal degree in co-relation 375. Up to 60 conditions per place. [2022-12-06 06:34:28,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 208 flow [2022-12-06 06:34:28,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 06:34:28,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L853-3-->L864: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_142 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_449 256) 0)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_448 256) 0))) (.cse2 (not .cse9)) (.cse5 (= (mod v_~x$r_buff1_thd0~0_144 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_443 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse5)) (.cse11 (and .cse10 .cse2)) (.cse1 (not .cse8)) (.cse7 (select |v_#memory_int_600| |v_~#x~0.base_295|))) (and (= v_~main$tmp_guard0~0_84 (ite (= (ite (= v_~__unbuffered_cnt~0_207 3) 1 0) 0) 0 1)) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem36#1_183| |v_ULTIMATE.start_main_#t~mem36#1_181|))) (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_143| v_~x$w_buff0~0_305) .cse2 (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~ite37#1_180|)) (and (or (and .cse3 .cse0 (= |v_ULTIMATE.start_main_#t~ite37#1_178| v_~x$w_buff1~0_303) .cse4) (and (or .cse5 .cse6) (= (select .cse7 |v_~#x~0.offset_295|) |v_ULTIMATE.start_main_#t~mem36#1_181|) (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~mem36#1_181|))) (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~ite38#1_143|) (or .cse8 .cse9)))) (= v_~x$r_buff1_thd0~0_143 (ite (or (and .cse10 (not (= (mod v_~x$r_buff0_thd0~0_141 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_442 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_144)) (= v_~x$w_buff1_used~0_442 (ite (or (and .cse3 .cse4) .cse11) 0 v_~x$w_buff1_used~0_443)) (= v_~x$r_buff0_thd0~0_141 (ite .cse11 0 v_~x$r_buff0_thd0~0_142)) (= v_~x$w_buff0_used~0_448 (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_449)) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (= (store |v_#memory_int_600| |v_~#x~0.base_295| (store .cse7 |v_~#x~0.offset_295| |v_ULTIMATE.start_main_#t~ite38#1_143|)) |v_#memory_int_599|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, ~#x~0.offset=|v_~#x~0.offset_295|, ~x$w_buff1~0=v_~x$w_buff1~0_303, #memory_int=|v_#memory_int_600|, ~#x~0.base=|v_~#x~0.base_295|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_443, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_180|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_144, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_183|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_449} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~#x~0.offset=|v_~#x~0.offset_295|, ~x$w_buff1~0=v_~x$w_buff1~0_303, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_442, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_65|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_143, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_448, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, #memory_int=|v_#memory_int_599|, ~#x~0.base=|v_~#x~0.base_295|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_142|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|} AuxVars[|v_ULTIMATE.start_main_#t~ite37#1_178|, |v_ULTIMATE.start_main_#t~mem36#1_181|, |v_ULTIMATE.start_main_#t~ite38#1_143|] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [679] $Ultimate##0-->L823: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= (store |v_#memory_int_314| |v_~#x~0.base_193| (store (select |v_#memory_int_314| |v_~#x~0.base_193|) |v_~#x~0.offset_193| 1)) |v_#memory_int_313|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_193|, #memory_int=|v_#memory_int_314|, ~#x~0.base=|v_~#x~0.base_193|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~#x~0.offset=|v_~#x~0.offset_193|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, #memory_int=|v_#memory_int_313|, ~#x~0.base=|v_~#x~0.base_193|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, #memory_int] [2022-12-06 06:34:29,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L853-3-->L864: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_142 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_449 256) 0)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_448 256) 0))) (.cse2 (not .cse9)) (.cse5 (= (mod v_~x$r_buff1_thd0~0_144 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_443 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse5)) (.cse11 (and .cse10 .cse2)) (.cse1 (not .cse8)) (.cse7 (select |v_#memory_int_600| |v_~#x~0.base_295|))) (and (= v_~main$tmp_guard0~0_84 (ite (= (ite (= v_~__unbuffered_cnt~0_207 3) 1 0) 0) 0 1)) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem36#1_183| |v_ULTIMATE.start_main_#t~mem36#1_181|))) (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_143| v_~x$w_buff0~0_305) .cse2 (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~ite37#1_180|)) (and (or (and .cse3 .cse0 (= |v_ULTIMATE.start_main_#t~ite37#1_178| v_~x$w_buff1~0_303) .cse4) (and (or .cse5 .cse6) (= (select .cse7 |v_~#x~0.offset_295|) |v_ULTIMATE.start_main_#t~mem36#1_181|) (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~mem36#1_181|))) (= |v_ULTIMATE.start_main_#t~ite37#1_178| |v_ULTIMATE.start_main_#t~ite38#1_143|) (or .cse8 .cse9)))) (= v_~x$r_buff1_thd0~0_143 (ite (or (and .cse10 (not (= (mod v_~x$r_buff0_thd0~0_141 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_442 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_144)) (= v_~x$w_buff1_used~0_442 (ite (or (and .cse3 .cse4) .cse11) 0 v_~x$w_buff1_used~0_443)) (= v_~x$r_buff0_thd0~0_141 (ite .cse11 0 v_~x$r_buff0_thd0~0_142)) (= v_~x$w_buff0_used~0_448 (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_449)) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (= (store |v_#memory_int_600| |v_~#x~0.base_295| (store .cse7 |v_~#x~0.offset_295| |v_ULTIMATE.start_main_#t~ite38#1_143|)) |v_#memory_int_599|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, ~#x~0.offset=|v_~#x~0.offset_295|, ~x$w_buff1~0=v_~x$w_buff1~0_303, #memory_int=|v_#memory_int_600|, ~#x~0.base=|v_~#x~0.base_295|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_443, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_180|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_144, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_183|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_449} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~#x~0.offset=|v_~#x~0.offset_295|, ~x$w_buff1~0=v_~x$w_buff1~0_303, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_442, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_65|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_143, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_448, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, #memory_int=|v_#memory_int_599|, ~#x~0.base=|v_~#x~0.base_295|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_142|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|} AuxVars[|v_ULTIMATE.start_main_#t~ite37#1_178|, |v_ULTIMATE.start_main_#t~mem36#1_181|, |v_ULTIMATE.start_main_#t~ite38#1_143|] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [679] $Ultimate##0-->L823: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= (store |v_#memory_int_314| |v_~#x~0.base_193| (store (select |v_#memory_int_314| |v_~#x~0.base_193|) |v_~#x~0.offset_193| 1)) |v_#memory_int_313|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_193|, #memory_int=|v_#memory_int_314|, ~#x~0.base=|v_~#x~0.base_193|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~#x~0.offset=|v_~#x~0.offset_193|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, #memory_int=|v_#memory_int_313|, ~#x~0.base=|v_~#x~0.base_193|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, #memory_int] [2022-12-06 06:34:29,540 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:34:29,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1273 [2022-12-06 06:34:29,541 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 217 flow [2022-12-06 06:34:29,542 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 06:34:29,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:29,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:29,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:34:29,542 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 06:34:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1777809009, now seen corresponding path program 1 times [2022-12-06 06:34:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:29,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139604155] [2022-12-06 06:34:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:29,778 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 06:34:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:29,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139604155] [2022-12-06 06:34:29,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139604155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:29,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:29,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:34:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83955733] [2022-12-06 06:34:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:29,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:29,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:34:29,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 217 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 06:34:29,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:29,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:34:29,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:29,918 INFO L130 PetriNetUnfolder]: 192/371 cut-off events. [2022-12-06 06:34:29,918 INFO L131 PetriNetUnfolder]: For 684/685 co-relation queries the response was YES. [2022-12-06 06:34:29,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 371 events. 192/371 cut-off events. For 684/685 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1699 event pairs, 36 based on Foata normal form. 20/382 useless extension candidates. Maximal degree in co-relation 1361. Up to 166 conditions per place. [2022-12-06 06:34:29,921 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 37 selfloop transitions, 10 changer transitions 6/55 dead transitions. [2022-12-06 06:34:29,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 400 flow [2022-12-06 06:34:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:34:29,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-06 06:34:29,924 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 217 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:34:29,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 400 flow [2022-12-06 06:34:29,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 357 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 06:34:29,926 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 172 flow [2022-12-06 06:34:29,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-06 06:34:29,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2022-12-06 06:34:29,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:29,928 INFO L89 Accepts]: Start accepts. Operand has 45 places, 30 transitions, 172 flow [2022-12-06 06:34:29,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:29,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:29,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 172 flow [2022-12-06 06:34:29,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 30 transitions, 172 flow [2022-12-06 06:34:29,942 INFO L130 PetriNetUnfolder]: 10/56 cut-off events. [2022-12-06 06:34:29,942 INFO L131 PetriNetUnfolder]: For 63/65 co-relation queries the response was YES. [2022-12-06 06:34:29,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 56 events. 10/56 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 0 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 151. Up to 15 conditions per place. [2022-12-06 06:34:29,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 30 transitions, 172 flow [2022-12-06 06:34:29,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 06:34:34,261 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:34:34,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4334 [2022-12-06 06:34:34,262 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 166 flow [2022-12-06 06:34:34,262 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 06:34:34,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:34,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:34:34,263 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 06:34:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1368721968, now seen corresponding path program 1 times [2022-12-06 06:34:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:34,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585319898] [2022-12-06 06:34:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:34:34,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:34:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:34:34,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:34:34,420 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:34:34,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:34:34,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:34:34,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:34:34,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:34:34,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:34:34,423 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:34,429 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:34:34,429 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:34:34,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:34:34 BasicIcfg [2022-12-06 06:34:34,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:34:34,534 INFO L158 Benchmark]: Toolchain (without parser) took 95560.65ms. Allocated memory was 178.3MB in the beginning and 706.7MB in the end (delta: 528.5MB). Free memory was 152.8MB in the beginning and 542.4MB in the end (delta: -389.5MB). Peak memory consumption was 139.9MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,534 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:34:34,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.36ms. Allocated memory is still 178.3MB. Free memory was 152.8MB in the beginning and 125.1MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.40ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 122.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,535 INFO L158 Benchmark]: Boogie Preprocessor took 41.78ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,535 INFO L158 Benchmark]: RCFGBuilder took 1003.42ms. Allocated memory was 178.3MB in the beginning and 235.9MB in the end (delta: 57.7MB). Free memory was 120.3MB in the beginning and 173.6MB in the end (delta: -53.3MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,535 INFO L158 Benchmark]: TraceAbstraction took 93860.68ms. Allocated memory was 235.9MB in the beginning and 706.7MB in the end (delta: 470.8MB). Free memory was 172.5MB in the beginning and 542.4MB in the end (delta: -369.8MB). Peak memory consumption was 102.0MB. Max. memory is 8.0GB. [2022-12-06 06:34:34,537 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.13ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 75.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 569.36ms. Allocated memory is still 178.3MB. Free memory was 152.8MB in the beginning and 125.1MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.40ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 122.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.78ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1003.42ms. Allocated memory was 178.3MB in the beginning and 235.9MB in the end (delta: 57.7MB). Free memory was 120.3MB in the beginning and 173.6MB in the end (delta: -53.3MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. * TraceAbstraction took 93860.68ms. Allocated memory was 235.9MB in the beginning and 706.7MB in the end (delta: 470.8MB). Free memory was 172.5MB in the beginning and 542.4MB in the end (delta: -369.8MB). Peak memory consumption was 102.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.1s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 20 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 863, independent: 798, independent conditional: 798, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 863, independent: 798, independent conditional: 0, independent unconditional: 798, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 863, independent: 798, independent conditional: 0, independent unconditional: 798, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 863, independent: 798, independent conditional: 0, independent unconditional: 798, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 691, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 691, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 390, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 863, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 691, unknown conditional: 0, unknown unconditional: 691] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1017, Positive conditional cache size: 0, Positive unconditional cache size: 1017, 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: 0.2s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 38, independent conditional: 38, 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: 56, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 56, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 55, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 3, independent unconditional: 37, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent conditional: 0, independent unconditional: 2, 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: 56, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 36, 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: 50, independent: 36, independent conditional: 2, independent unconditional: 34, 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: 50, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 52, independent conditional: 5, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 22, independent unconditional: 24, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 61, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 0, 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: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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.1s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 51, 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: 68, independent: 51, independent conditional: 17, independent unconditional: 34, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 107, dependent conditional: 80, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 47, independent conditional: 5, independent unconditional: 42, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 53, Positive conditional cache size: 1, Positive unconditional cache size: 52, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, 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.0s, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 50, independent conditional: 22, independent unconditional: 28, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 36, independent conditional: 19, independent unconditional: 17, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 36, independent conditional: 16, independent unconditional: 20, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 36, independent conditional: 16, independent unconditional: 20, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 32, independent conditional: 14, independent unconditional: 18, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 60, Positive conditional cache size: 3, Positive unconditional cache size: 57, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 47 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 28, independent conditional: 15, independent unconditional: 13, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 58, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 61, Positive conditional cache size: 3, Positive unconditional cache size: 58, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, 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: 4.3s, 45 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 25 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 38, 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: 55, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 38, independent conditional: 18, independent unconditional: 20, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 38, independent conditional: 18, independent unconditional: 20, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 100, dependent conditional: 42, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 21, unknown conditional: 9, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 90, Positive conditional cache size: 7, Positive unconditional cache size: 83, Negative cache size: 40, Negative conditional cache size: 11, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 2 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1681, ((void *)0), P0, ((void *)0))=-3, t1681={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] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=-2, t1681={7:0}, t1682={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] [L852] 0 pthread_t t1683; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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] [L792] 2 y = 2 [L795] 2 __unbuffered_p1_EAX = y [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] 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) [L802] EXPR 2 \read(x) [L802] 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) [L802] 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) [L803] 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)) [L804] 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)) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, 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] [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1683, ((void *)0), P2, ((void *)0))=-1, t1681={7:0}, t1682={8:0}, t1683={5:0}, weak$$choice0=2, weak$$choice1=1, 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] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=1, 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] [L826] 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) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] 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) [L826] 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) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=1, 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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] 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) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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 [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=1, 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: 851]: 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: 849]: 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: 853]: 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, 148 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: 93.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 80.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 5 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=9, InterpolantAutomatonStates: 35, 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.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 883 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 06:34:34,573 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...