/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/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:44:52,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:44:52,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:44:52,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:44:52,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:44:52,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:44:52,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:44:52,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:44:52,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:44:52,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:44:52,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:44:52,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:44:52,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:44:52,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:44:52,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:44:52,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:44:52,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:44:52,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:44:52,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:44:52,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:44:52,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:44:52,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:44:52,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:44:52,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:44:52,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:44:52,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:44:52,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:44:52,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:44:52,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:44:52,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:44:52,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:44:52,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:44:52,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:44:52,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:44:52,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:44:52,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:44:52,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:44:52,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:44:52,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:44:52,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:44:52,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:44:52,211 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:44:52,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:44:52,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:44:52,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:44:52,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:44:52,252 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:44:52,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:44:52,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:44:52,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:44:52,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:44:52,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:44:52,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:44:52,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:52,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:44:52,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:44:52,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:44:52,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:44:52,256 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:44:52,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:44:52,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:44:52,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:44:52,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:44:52,537 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:44:52,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:53,600 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:44:53,944 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:44:53,944 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:53,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204b3df87/6541f6fb36f34145b9bbac6edf6d6840/FLAGfe7b2fe6b [2022-12-06 06:44:53,996 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204b3df87/6541f6fb36f34145b9bbac6edf6d6840 [2022-12-06 06:44:53,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:44:53,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:44:54,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:54,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:44:54,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:44:54,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:53" (1/1) ... [2022-12-06 06:44:54,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b58f909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54, skipping insertion in model container [2022-12-06 06:44:54,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:53" (1/1) ... [2022-12-06 06:44:54,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:44:54,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:44:54,186 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:44:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:54,370 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:44:54,379 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:44:54,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:54,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:54,464 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:44:54,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54 WrapperNode [2022-12-06 06:44:54,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:54,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:54,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:44:54,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:44:54,471 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:44:54" (1/1) ... [2022-12-06 06:44:54,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,521 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-06 06:44:54,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:54,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:44:54,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:44:54,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:44:54,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,549 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:44:54,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:44:54,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:44:54,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:44:54,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (1/1) ... [2022-12-06 06:44:54,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:44:54,600 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:44:54,607 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:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:44:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:44:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:44:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:44:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:44:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:44:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:44:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:44:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:44:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:44:54,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:44:54,637 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:44:54,791 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:44:54,793 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:44:55,036 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:44:55,149 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:44:55,149 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:44:55,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:55 BoogieIcfgContainer [2022-12-06 06:44:55,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:44:55,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:44:55,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:44:55,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:44:55,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:44:53" (1/3) ... [2022-12-06 06:44:55,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376eaf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:55, skipping insertion in model container [2022-12-06 06:44:55,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:54" (2/3) ... [2022-12-06 06:44:55,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376eaf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:55, skipping insertion in model container [2022-12-06 06:44:55,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:55" (3/3) ... [2022-12-06 06:44:55,161 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:55,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:44:55,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:44:55,175 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:44:55,216 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:44:55,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 06:44:55,298 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 06:44:55,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:55,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:44:55,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 06:44:55,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-06 06:44:55,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:55,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 06:44:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-06 06:44:55,369 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 06:44:55,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:55,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:44:55,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 06:44:55,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-06 06:44:59,654 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-06 06:44:59,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:44:59,669 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;@42113a5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:44:59,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:44:59,673 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 06:44:59,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:59,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:59,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:59,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:44:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1257878953, now seen corresponding path program 1 times [2022-12-06 06:44:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:59,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914908971] [2022-12-06 06:44:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:59,992 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:44:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914908971] [2022-12-06 06:44:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914908971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:59,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:59,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56128196] [2022-12-06 06:44:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:00,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:00,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:00,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:45:00,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:00,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:00,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:45:00,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:00,287 INFO L130 PetriNetUnfolder]: 615/1010 cut-off events. [2022-12-06 06:45:00,287 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:45:00,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 1010 events. 615/1010 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5033 event pairs, 129 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1970. Up to 703 conditions per place. [2022-12-06 06:45:00,298 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 06:45:00,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-06 06:45:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:45:00,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:45:00,310 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:45:00,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-06 06:45:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:00,314 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:00,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:45:00,319 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:45:00,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:00,320 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:00,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:00,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:00,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:00,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:45:00,335 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:45:00,335 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:45:00,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:45:00,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:45:00,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:00,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 06:45:00,422 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:45:00,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:00,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:00,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:00,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:45:00,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1935870278, now seen corresponding path program 1 times [2022-12-06 06:45:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142686214] [2022-12-06 06:45:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:00,737 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:45:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142686214] [2022-12-06 06:45:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142686214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:00,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:00,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345260797] [2022-12-06 06:45:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:00,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:00,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:00,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:00,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:00,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:00,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:00,880 INFO L130 PetriNetUnfolder]: 545/892 cut-off events. [2022-12-06 06:45:00,881 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 06:45:00,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 892 events. 545/892 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4158 event pairs, 125 based on Foata normal form. 8/897 useless extension candidates. Maximal degree in co-relation 1824. Up to 775 conditions per place. [2022-12-06 06:45:00,886 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 06:45:00,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2022-12-06 06:45:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:45:00,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:45:00,888 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:45:00,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2022-12-06 06:45:00,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:00,889 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 06:45:00,890 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 06:45:00,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:00,891 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:00,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:00,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,897 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:45:00,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:00,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 06:45:00,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:45:00,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:00,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:45:00,910 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 06:45:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:00,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:00,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:45:00,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -117565678, now seen corresponding path program 1 times [2022-12-06 06:45:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711691055] [2022-12-06 06:45:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:01,858 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:45:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:01,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711691055] [2022-12-06 06:45:01,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711691055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:01,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:01,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157383876] [2022-12-06 06:45:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:01,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:01,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:01,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:45:01,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:45:01,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:01,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:45:01,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:02,114 INFO L130 PetriNetUnfolder]: 1262/1927 cut-off events. [2022-12-06 06:45:02,114 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-06 06:45:02,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4311 conditions, 1927 events. 1262/1927 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8574 event pairs, 142 based on Foata normal form. 66/1993 useless extension candidates. Maximal degree in co-relation 4300. Up to 1220 conditions per place. [2022-12-06 06:45:02,123 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 38 selfloop transitions, 13 changer transitions 0/51 dead transitions. [2022-12-06 06:45:02,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 51 transitions, 249 flow [2022-12-06 06:45:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:45:02,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-06 06:45:02,125 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:45:02,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 51 transitions, 249 flow [2022-12-06 06:45:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:02,127 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-06 06:45:02,128 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 06:45:02,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:02,129 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:02,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:02,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,180 INFO L130 PetriNetUnfolder]: 282/561 cut-off events. [2022-12-06 06:45:02,180 INFO L131 PetriNetUnfolder]: For 270/281 co-relation queries the response was YES. [2022-12-06 06:45:02,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 561 events. 282/561 cut-off events. For 270/281 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3000 event pairs, 71 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 1439. Up to 328 conditions per place. [2022-12-06 06:45:02,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:45:02,189 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:02,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 06:45:02,191 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 172 flow [2022-12-06 06:45:02,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:45:02,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:02,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:02,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:45:02,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -23094236, now seen corresponding path program 1 times [2022-12-06 06:45:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:02,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690930517] [2022-12-06 06:45:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:45:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690930517] [2022-12-06 06:45:02,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690930517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:02,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:02,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799103955] [2022-12-06 06:45:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:02,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:02,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:02,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:02,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:02,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:02,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:02,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:02,503 INFO L130 PetriNetUnfolder]: 1097/1733 cut-off events. [2022-12-06 06:45:02,503 INFO L131 PetriNetUnfolder]: For 1276/1317 co-relation queries the response was YES. [2022-12-06 06:45:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 1733 events. 1097/1733 cut-off events. For 1276/1317 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8430 event pairs, 256 based on Foata normal form. 15/1722 useless extension candidates. Maximal degree in co-relation 5387. Up to 1489 conditions per place. [2022-12-06 06:45:02,514 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 42 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-06 06:45:02,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 352 flow [2022-12-06 06:45:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:45:02,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:45:02,517 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 172 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:45:02,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 352 flow [2022-12-06 06:45:02,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:45:02,521 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2022-12-06 06:45:02,522 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 06:45:02,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:02,525 INFO L89 Accepts]: Start accepts. Operand has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:02,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:02,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,572 INFO L130 PetriNetUnfolder]: 283/547 cut-off events. [2022-12-06 06:45:02,573 INFO L131 PetriNetUnfolder]: For 409/419 co-relation queries the response was YES. [2022-12-06 06:45:02,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 547 events. 283/547 cut-off events. For 409/419 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2826 event pairs, 59 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 1564. Up to 323 conditions per place. [2022-12-06 06:45:02,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 06:45:02,581 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:02,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 06:45:02,588 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 217 flow [2022-12-06 06:45:02,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:02,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:02,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:02,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:45:02,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1251711988, now seen corresponding path program 1 times [2022-12-06 06:45:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:02,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214821567] [2022-12-06 06:45:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:02,698 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:45:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:02,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214821567] [2022-12-06 06:45:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214821567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:02,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985172762] [2022-12-06 06:45:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:02,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:02,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:02,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 217 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:45:02,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:02,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:02,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:02,994 INFO L130 PetriNetUnfolder]: 1394/2214 cut-off events. [2022-12-06 06:45:02,994 INFO L131 PetriNetUnfolder]: For 2670/2703 co-relation queries the response was YES. [2022-12-06 06:45:02,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 2214 events. 1394/2214 cut-off events. For 2670/2703 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11617 event pairs, 409 based on Foata normal form. 64/2212 useless extension candidates. Maximal degree in co-relation 7160. Up to 1136 conditions per place. [2022-12-06 06:45:03,005 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 43 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2022-12-06 06:45:03,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 381 flow [2022-12-06 06:45:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:45:03,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:45:03,008 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 217 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:45:03,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 381 flow [2022-12-06 06:45:03,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:03,017 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-12-06 06:45:03,019 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 06:45:03,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:03,019 INFO L89 Accepts]: Start accepts. Operand has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:03,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:03,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,071 INFO L130 PetriNetUnfolder]: 309/643 cut-off events. [2022-12-06 06:45:03,071 INFO L131 PetriNetUnfolder]: For 776/788 co-relation queries the response was YES. [2022-12-06 06:45:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 643 events. 309/643 cut-off events. For 776/788 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3703 event pairs, 71 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 1844. Up to 371 conditions per place. [2022-12-06 06:45:03,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 06:45:03,077 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:03,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:45:03,078 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 232 flow [2022-12-06 06:45:03,078 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:45:03,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:03,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:03,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:45:03,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1282661954, now seen corresponding path program 1 times [2022-12-06 06:45:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:03,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937203132] [2022-12-06 06:45:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:03,415 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:45:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:03,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937203132] [2022-12-06 06:45:03,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937203132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:03,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:03,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:45:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746337513] [2022-12-06 06:45:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:03,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:45:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:45:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:45:03,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:03,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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:45:03,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:03,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:03,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:03,797 INFO L130 PetriNetUnfolder]: 2134/3450 cut-off events. [2022-12-06 06:45:03,797 INFO L131 PetriNetUnfolder]: For 4459/4525 co-relation queries the response was YES. [2022-12-06 06:45:03,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11130 conditions, 3450 events. 2134/3450 cut-off events. For 4459/4525 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20161 event pairs, 283 based on Foata normal form. 45/3420 useless extension candidates. Maximal degree in co-relation 11111. Up to 1573 conditions per place. [2022-12-06 06:45:03,817 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 70 selfloop transitions, 20 changer transitions 0/98 dead transitions. [2022-12-06 06:45:03,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 98 transitions, 729 flow [2022-12-06 06:45:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:45:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:45:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 06:45:03,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 06:45:03,819 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 232 flow. Second operand 6 states and 69 transitions. [2022-12-06 06:45:03,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 98 transitions, 729 flow [2022-12-06 06:45:03,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 704 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:03,823 INFO L231 Difference]: Finished difference. Result has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=47, PETRI_TRANSITIONS=53} [2022-12-06 06:45:03,824 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-06 06:45:03,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:03,824 INFO L89 Accepts]: Start accepts. Operand has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:03,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:03,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,940 INFO L130 PetriNetUnfolder]: 471/995 cut-off events. [2022-12-06 06:45:03,940 INFO L131 PetriNetUnfolder]: For 1687/1743 co-relation queries the response was YES. [2022-12-06 06:45:03,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 995 events. 471/995 cut-off events. For 1687/1743 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6502 event pairs, 62 based on Foata normal form. 16/977 useless extension candidates. Maximal degree in co-relation 3711. Up to 597 conditions per place. [2022-12-06 06:45:03,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 06:45:03,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:03,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 06:45:03,953 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 53 transitions, 380 flow [2022-12-06 06:45:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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:45:03,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:03,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:03,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:45:03,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 651112622, now seen corresponding path program 1 times [2022-12-06 06:45:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:03,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136745774] [2022-12-06 06:45:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:04,253 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:45:04,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:04,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136745774] [2022-12-06 06:45:04,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136745774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:04,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:04,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068977425] [2022-12-06 06:45:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:04,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:04,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:04,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:04,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 53 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:04,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:04,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:04,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:04,625 INFO L130 PetriNetUnfolder]: 2095/3384 cut-off events. [2022-12-06 06:45:04,625 INFO L131 PetriNetUnfolder]: For 7747/7900 co-relation queries the response was YES. [2022-12-06 06:45:04,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13196 conditions, 3384 events. 2095/3384 cut-off events. For 7747/7900 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19652 event pairs, 289 based on Foata normal form. 65/3394 useless extension candidates. Maximal degree in co-relation 13173. Up to 2721 conditions per place. [2022-12-06 06:45:04,642 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 56 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2022-12-06 06:45:04,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 620 flow [2022-12-06 06:45:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:45:04,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:45:04,643 INFO L175 Difference]: Start difference. First operand has 47 places, 53 transitions, 380 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:45:04,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 620 flow [2022-12-06 06:45:04,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 618 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:45:04,648 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 404 flow [2022-12-06 06:45:04,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-06 06:45:04,648 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-06 06:45:04,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:04,648 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 404 flow [2022-12-06 06:45:04,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:04,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:04,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 404 flow [2022-12-06 06:45:04,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 404 flow [2022-12-06 06:45:04,728 INFO L130 PetriNetUnfolder]: 468/996 cut-off events. [2022-12-06 06:45:04,728 INFO L131 PetriNetUnfolder]: For 2047/2103 co-relation queries the response was YES. [2022-12-06 06:45:04,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 996 events. 468/996 cut-off events. For 2047/2103 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6561 event pairs, 63 based on Foata normal form. 14/974 useless extension candidates. Maximal degree in co-relation 3778. Up to 592 conditions per place. [2022-12-06 06:45:04,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 404 flow [2022-12-06 06:45:04,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:45:05,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:05,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 819 [2022-12-06 06:45:05,467 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 416 flow [2022-12-06 06:45:05,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:05,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:05,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:05,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:45:05,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 474734960, now seen corresponding path program 1 times [2022-12-06 06:45:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:05,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569805551] [2022-12-06 06:45:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:05,764 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:45:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:05,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569805551] [2022-12-06 06:45:05,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569805551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:05,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:05,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734949442] [2022-12-06 06:45:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:05,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:05,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:45:05,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:05,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:05,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:45:05,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:06,103 INFO L130 PetriNetUnfolder]: 2063/3342 cut-off events. [2022-12-06 06:45:06,103 INFO L131 PetriNetUnfolder]: For 8183/8301 co-relation queries the response was YES. [2022-12-06 06:45:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13362 conditions, 3342 events. 2063/3342 cut-off events. For 8183/8301 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 19510 event pairs, 435 based on Foata normal form. 84/3358 useless extension candidates. Maximal degree in co-relation 13336. Up to 2750 conditions per place. [2022-12-06 06:45:06,126 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 55 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2022-12-06 06:45:06,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 668 flow [2022-12-06 06:45:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:45:06,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:45:06,128 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 416 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:45:06,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 668 flow [2022-12-06 06:45:06,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 652 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:06,137 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2022-12-06 06:45:06,138 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-06 06:45:06,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:06,138 INFO L89 Accepts]: Start accepts. Operand has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:06,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:06,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,221 INFO L130 PetriNetUnfolder]: 452/966 cut-off events. [2022-12-06 06:45:06,221 INFO L131 PetriNetUnfolder]: For 2614/2678 co-relation queries the response was YES. [2022-12-06 06:45:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 966 events. 452/966 cut-off events. For 2614/2678 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6381 event pairs, 59 based on Foata normal form. 20/954 useless extension candidates. Maximal degree in co-relation 3903. Up to 573 conditions per place. [2022-12-06 06:45:06,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 06:45:06,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:06,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 06:45:06,234 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 462 flow [2022-12-06 06:45:06,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:06,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:06,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:06,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:45:06,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1288060604, now seen corresponding path program 2 times [2022-12-06 06:45:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494968669] [2022-12-06 06:45:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:06,550 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:45:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494968669] [2022-12-06 06:45:06,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494968669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:06,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:45:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371491188] [2022-12-06 06:45:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:45:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:45:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:45:06,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:45:06,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 462 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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:45:06,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:06,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:45:06,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:06,912 INFO L130 PetriNetUnfolder]: 2129/3464 cut-off events. [2022-12-06 06:45:06,912 INFO L131 PetriNetUnfolder]: For 12311/12520 co-relation queries the response was YES. [2022-12-06 06:45:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14196 conditions, 3464 events. 2129/3464 cut-off events. For 12311/12520 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 20542 event pairs, 351 based on Foata normal form. 132/3532 useless extension candidates. Maximal degree in co-relation 14169. Up to 2062 conditions per place. [2022-12-06 06:45:06,935 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 56 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2022-12-06 06:45:06,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 788 flow [2022-12-06 06:45:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 06:45:06,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 06:45:06,939 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 462 flow. Second operand 5 states and 48 transitions. [2022-12-06 06:45:06,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 788 flow [2022-12-06 06:45:06,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 762 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:06,955 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:06,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2022-12-06 06:45:06,955 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-06 06:45:06,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:06,956 INFO L89 Accepts]: Start accepts. Operand has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:06,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:06,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:06,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:07,044 INFO L130 PetriNetUnfolder]: 427/935 cut-off events. [2022-12-06 06:45:07,044 INFO L131 PetriNetUnfolder]: For 2596/2642 co-relation queries the response was YES. [2022-12-06 06:45:07,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 935 events. 427/935 cut-off events. For 2596/2642 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6250 event pairs, 66 based on Foata normal form. 21/924 useless extension candidates. Maximal degree in co-relation 4061. Up to 554 conditions per place. [2022-12-06 06:45:07,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:07,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:45:07,061 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:07,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 06:45:07,062 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 549 flow [2022-12-06 06:45:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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:45:07,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:07,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:45:07,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 115148871, now seen corresponding path program 1 times [2022-12-06 06:45:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311481362] [2022-12-06 06:45:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:07,467 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:45:07,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311481362] [2022-12-06 06:45:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311481362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:07,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:07,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238561937] [2022-12-06 06:45:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:07,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:07,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:45:07,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 549 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:07,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:45:07,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:07,988 INFO L130 PetriNetUnfolder]: 3341/5389 cut-off events. [2022-12-06 06:45:07,988 INFO L131 PetriNetUnfolder]: For 16818/16818 co-relation queries the response was YES. [2022-12-06 06:45:08,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22513 conditions, 5389 events. 3341/5389 cut-off events. For 16818/16818 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 33075 event pairs, 527 based on Foata normal form. 80/5469 useless extension candidates. Maximal degree in co-relation 22485. Up to 2428 conditions per place. [2022-12-06 06:45:08,015 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 82 selfloop transitions, 24 changer transitions 18/124 dead transitions. [2022-12-06 06:45:08,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 1321 flow [2022-12-06 06:45:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:45:08,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:45:08,017 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 549 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:45:08,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 124 transitions, 1321 flow [2022-12-06 06:45:08,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 1294 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:08,033 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2022-12-06 06:45:08,033 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-12-06 06:45:08,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:08,033 INFO L89 Accepts]: Start accepts. Operand has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:08,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:08,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,121 INFO L130 PetriNetUnfolder]: 423/1100 cut-off events. [2022-12-06 06:45:08,121 INFO L131 PetriNetUnfolder]: For 4118/4243 co-relation queries the response was YES. [2022-12-06 06:45:08,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 1100 events. 423/1100 cut-off events. For 4118/4243 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8639 event pairs, 36 based on Foata normal form. 46/1133 useless extension candidates. Maximal degree in co-relation 5272. Up to 626 conditions per place. [2022-12-06 06:45:08,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 06:45:08,137 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:08,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 06:45:08,138 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 789 flow [2022-12-06 06:45:08,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:08,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:45:08,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1900995587, now seen corresponding path program 1 times [2022-12-06 06:45:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:08,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979420644] [2022-12-06 06:45:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:08,747 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:45:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979420644] [2022-12-06 06:45:08,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979420644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:08,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:08,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:45:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146248562] [2022-12-06 06:45:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:08,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:45:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:45:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:45:08,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:08,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 789 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:08,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:08,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:08,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:09,208 INFO L130 PetriNetUnfolder]: 2612/4451 cut-off events. [2022-12-06 06:45:09,209 INFO L131 PetriNetUnfolder]: For 19496/19889 co-relation queries the response was YES. [2022-12-06 06:45:09,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20421 conditions, 4451 events. 2612/4451 cut-off events. For 19496/19889 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 29715 event pairs, 802 based on Foata normal form. 194/4568 useless extension candidates. Maximal degree in co-relation 20390. Up to 3526 conditions per place. [2022-12-06 06:45:09,233 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 73 selfloop transitions, 15 changer transitions 9/106 dead transitions. [2022-12-06 06:45:09,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 1247 flow [2022-12-06 06:45:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:45:09,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:45:09,234 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 789 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:45:09,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 1247 flow [2022-12-06 06:45:09,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 1237 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 06:45:09,249 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=883, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2022-12-06 06:45:09,250 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2022-12-06 06:45:09,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:09,250 INFO L89 Accepts]: Start accepts. Operand has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:09,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:09,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,367 INFO L130 PetriNetUnfolder]: 442/1154 cut-off events. [2022-12-06 06:45:09,367 INFO L131 PetriNetUnfolder]: For 4830/4992 co-relation queries the response was YES. [2022-12-06 06:45:09,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5766 conditions, 1154 events. 442/1154 cut-off events. For 4830/4992 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9139 event pairs, 35 based on Foata normal form. 48/1189 useless extension candidates. Maximal degree in co-relation 5734. Up to 660 conditions per place. [2022-12-06 06:45:09,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 06:45:09,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:09,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 06:45:09,387 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 883 flow [2022-12-06 06:45:09,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:09,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:09,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:09,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:45:09,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1346011173, now seen corresponding path program 2 times [2022-12-06 06:45:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431610003] [2022-12-06 06:45:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:09,769 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:45:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431610003] [2022-12-06 06:45:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431610003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:09,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:45:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834551661] [2022-12-06 06:45:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:45:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:45:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:45:09,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:09,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 883 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:09,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:09,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:10,301 INFO L130 PetriNetUnfolder]: 2737/4720 cut-off events. [2022-12-06 06:45:10,301 INFO L131 PetriNetUnfolder]: For 24220/24611 co-relation queries the response was YES. [2022-12-06 06:45:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22504 conditions, 4720 events. 2737/4720 cut-off events. For 24220/24611 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 32540 event pairs, 744 based on Foata normal form. 206/4853 useless extension candidates. Maximal degree in co-relation 22469. Up to 3662 conditions per place. [2022-12-06 06:45:10,321 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 76 selfloop transitions, 19 changer transitions 10/114 dead transitions. [2022-12-06 06:45:10,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 1418 flow [2022-12-06 06:45:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 06:45:10,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-06 06:45:10,322 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 883 flow. Second operand 5 states and 51 transitions. [2022-12-06 06:45:10,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 1418 flow [2022-12-06 06:45:10,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 1394 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:10,339 INFO L231 Difference]: Finished difference. Result has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1065, PETRI_PLACES=70, PETRI_TRANSITIONS=87} [2022-12-06 06:45:10,339 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2022-12-06 06:45:10,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:10,339 INFO L89 Accepts]: Start accepts. Operand has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:10,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:10,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,444 INFO L130 PetriNetUnfolder]: 474/1262 cut-off events. [2022-12-06 06:45:10,444 INFO L131 PetriNetUnfolder]: For 6511/6678 co-relation queries the response was YES. [2022-12-06 06:45:10,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 1262 events. 474/1262 cut-off events. For 6511/6678 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 10358 event pairs, 33 based on Foata normal form. 49/1298 useless extension candidates. Maximal degree in co-relation 6616. Up to 713 conditions per place. [2022-12-06 06:45:10,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:45:10,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:10,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 06:45:10,468 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 87 transitions, 1065 flow [2022-12-06 06:45:10,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:10,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:10,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:10,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:45:10,469 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1274051493, now seen corresponding path program 3 times [2022-12-06 06:45:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:10,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377246934] [2022-12-06 06:45:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:10,931 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:45:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:10,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377246934] [2022-12-06 06:45:10,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377246934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:10,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:45:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631813878] [2022-12-06 06:45:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:10,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:45:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:45:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:45:10,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:45:10,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 87 transitions, 1065 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:10,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:10,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:45:10,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:11,511 INFO L130 PetriNetUnfolder]: 2963/5201 cut-off events. [2022-12-06 06:45:11,511 INFO L131 PetriNetUnfolder]: For 30682/31010 co-relation queries the response was YES. [2022-12-06 06:45:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25072 conditions, 5201 events. 2963/5201 cut-off events. For 30682/31010 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 37173 event pairs, 493 based on Foata normal form. 281/5412 useless extension candidates. Maximal degree in co-relation 25035. Up to 2138 conditions per place. [2022-12-06 06:45:11,538 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 107 selfloop transitions, 25 changer transitions 6/147 dead transitions. [2022-12-06 06:45:11,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 147 transitions, 1896 flow [2022-12-06 06:45:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:45:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:45:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 06:45:11,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2022-12-06 06:45:11,540 INFO L175 Difference]: Start difference. First operand has 70 places, 87 transitions, 1065 flow. Second operand 6 states and 67 transitions. [2022-12-06 06:45:11,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 147 transitions, 1896 flow [2022-12-06 06:45:11,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 147 transitions, 1863 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:11,562 INFO L231 Difference]: Finished difference. Result has 73 places, 92 transitions, 1174 flow [2022-12-06 06:45:11,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1174, PETRI_PLACES=73, PETRI_TRANSITIONS=92} [2022-12-06 06:45:11,562 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2022-12-06 06:45:11,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:11,562 INFO L89 Accepts]: Start accepts. Operand has 73 places, 92 transitions, 1174 flow [2022-12-06 06:45:11,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:11,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:11,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 92 transitions, 1174 flow [2022-12-06 06:45:11,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 92 transitions, 1174 flow [2022-12-06 06:45:11,703 INFO L130 PetriNetUnfolder]: 470/1323 cut-off events. [2022-12-06 06:45:11,704 INFO L131 PetriNetUnfolder]: For 7695/7927 co-relation queries the response was YES. [2022-12-06 06:45:11,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7171 conditions, 1323 events. 470/1323 cut-off events. For 7695/7927 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 11322 event pairs, 32 based on Foata normal form. 55/1365 useless extension candidates. Maximal degree in co-relation 7136. Up to 734 conditions per place. [2022-12-06 06:45:11,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 92 transitions, 1174 flow [2022-12-06 06:45:11,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-06 06:45:12,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:12,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1151 [2022-12-06 06:45:12,713 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 93 transitions, 1220 flow [2022-12-06 06:45:12,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:45:12,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:12,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:45:12,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1275211203, now seen corresponding path program 4 times [2022-12-06 06:45:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:12,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671380017] [2022-12-06 06:45:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:12,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:13,424 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:45:13,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:13,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671380017] [2022-12-06 06:45:13,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671380017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:13,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:13,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:45:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205752260] [2022-12-06 06:45:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:13,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:45:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:45:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:45:13,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:45:13,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 93 transitions, 1220 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:45:13,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:13,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:45:13,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:14,399 INFO L130 PetriNetUnfolder]: 3657/6347 cut-off events. [2022-12-06 06:45:14,399 INFO L131 PetriNetUnfolder]: For 36656/36656 co-relation queries the response was YES. [2022-12-06 06:45:14,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29736 conditions, 6347 events. 3657/6347 cut-off events. For 36656/36656 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 44772 event pairs, 744 based on Foata normal form. 48/6395 useless extension candidates. Maximal degree in co-relation 29698. Up to 3019 conditions per place. [2022-12-06 06:45:14,433 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 65 selfloop transitions, 48 changer transitions 40/153 dead transitions. [2022-12-06 06:45:14,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 153 transitions, 1986 flow [2022-12-06 06:45:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:45:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:45:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-06 06:45:14,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2022-12-06 06:45:14,435 INFO L175 Difference]: Start difference. First operand has 74 places, 93 transitions, 1220 flow. Second operand 8 states and 67 transitions. [2022-12-06 06:45:14,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 153 transitions, 1986 flow [2022-12-06 06:45:14,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 1951 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:14,488 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1376, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2022-12-06 06:45:14,488 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2022-12-06 06:45:14,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:14,489 INFO L89 Accepts]: Start accepts. Operand has 83 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:14,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:14,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,567 INFO L130 PetriNetUnfolder]: 181/604 cut-off events. [2022-12-06 06:45:14,567 INFO L131 PetriNetUnfolder]: For 4853/4891 co-relation queries the response was YES. [2022-12-06 06:45:14,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 604 events. 181/604 cut-off events. For 4853/4891 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4550 event pairs, 16 based on Foata normal form. 18/618 useless extension candidates. Maximal degree in co-relation 3542. Up to 341 conditions per place. [2022-12-06 06:45:14,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 06:45:14,585 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:14,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 06:45:14,586 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 1376 flow [2022-12-06 06:45:14,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:45:14,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:14,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:14,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:45:14,586 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1397273299, now seen corresponding path program 1 times [2022-12-06 06:45:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:14,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253407315] [2022-12-06 06:45:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:14,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:14,675 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:45:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:14,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253407315] [2022-12-06 06:45:14,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253407315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:14,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:14,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10598968] [2022-12-06 06:45:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:14,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:14,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 06:45:14,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:14,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:14,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 06:45:14,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:14,872 INFO L130 PetriNetUnfolder]: 632/1256 cut-off events. [2022-12-06 06:45:14,872 INFO L131 PetriNetUnfolder]: For 8696/8789 co-relation queries the response was YES. [2022-12-06 06:45:14,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 1256 events. 632/1256 cut-off events. For 8696/8789 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7868 event pairs, 159 based on Foata normal form. 130/1378 useless extension candidates. Maximal degree in co-relation 5998. Up to 1085 conditions per place. [2022-12-06 06:45:14,881 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 77 selfloop transitions, 4 changer transitions 4/96 dead transitions. [2022-12-06 06:45:14,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 96 transitions, 1508 flow [2022-12-06 06:45:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:45:14,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:45:14,883 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 1376 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:45:14,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 96 transitions, 1508 flow [2022-12-06 06:45:14,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 1334 flow, removed 13 selfloop flow, removed 17 redundant places. [2022-12-06 06:45:14,900 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 872 flow [2022-12-06 06:45:14,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2022-12-06 06:45:14,901 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2022-12-06 06:45:14,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:14,901 INFO L89 Accepts]: Start accepts. Operand has 67 places, 71 transitions, 872 flow [2022-12-06 06:45:14,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:14,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:14,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 71 transitions, 872 flow [2022-12-06 06:45:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 872 flow [2022-12-06 06:45:14,984 INFO L130 PetriNetUnfolder]: 293/776 cut-off events. [2022-12-06 06:45:14,984 INFO L131 PetriNetUnfolder]: For 2888/2928 co-relation queries the response was YES. [2022-12-06 06:45:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 776 events. 293/776 cut-off events. For 2888/2928 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 5853 event pairs, 95 based on Foata normal form. 7/728 useless extension candidates. Maximal degree in co-relation 3173. Up to 414 conditions per place. [2022-12-06 06:45:14,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 71 transitions, 872 flow [2022-12-06 06:45:14,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 06:45:15,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [394] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd3~0_52 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_171 256) 0)) (not (= (mod v_~y$w_buff1_used~0_153 256) 0)))) 1 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= v_~y$w_buff0~0_85 v_~y$w_buff1~0_80) (= v_~y$w_buff0_used~0_171 1) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= 2 v_~y$w_buff0~0_84) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= v_~y$w_buff0_used~0_172 v_~y$w_buff1_used~0_153) (= v_~y$r_buff0_thd0~0_91 v_~y$r_buff1_thd0~0_97)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_85, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_80, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_97, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_153} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 06:45:15,344 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:45:15,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 444 [2022-12-06 06:45:15,345 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 869 flow [2022-12-06 06:45:15,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:15,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:15,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:15,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:45:15,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 322093633, now seen corresponding path program 1 times [2022-12-06 06:45:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:15,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303387227] [2022-12-06 06:45:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:15,481 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:45:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:15,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303387227] [2022-12-06 06:45:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303387227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:15,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:15,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500874766] [2022-12-06 06:45:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:15,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 06:45:15,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 869 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:15,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:15,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 06:45:15,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:15,599 INFO L130 PetriNetUnfolder]: 254/588 cut-off events. [2022-12-06 06:45:15,600 INFO L131 PetriNetUnfolder]: For 2808/2861 co-relation queries the response was YES. [2022-12-06 06:45:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 588 events. 254/588 cut-off events. For 2808/2861 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3298 event pairs, 22 based on Foata normal form. 115/698 useless extension candidates. Maximal degree in co-relation 2990. Up to 321 conditions per place. [2022-12-06 06:45:15,604 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 73 selfloop transitions, 7 changer transitions 9/97 dead transitions. [2022-12-06 06:45:15,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 1317 flow [2022-12-06 06:45:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 06:45:15,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2022-12-06 06:45:15,605 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 869 flow. Second operand 4 states and 50 transitions. [2022-12-06 06:45:15,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 1317 flow [2022-12-06 06:45:15,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 1236 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-06 06:45:15,616 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 684 flow [2022-12-06 06:45:15,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=684, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-06 06:45:15,617 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-06 06:45:15,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:15,617 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 684 flow [2022-12-06 06:45:15,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:15,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:15,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 684 flow [2022-12-06 06:45:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 684 flow [2022-12-06 06:45:15,650 INFO L130 PetriNetUnfolder]: 81/276 cut-off events. [2022-12-06 06:45:15,650 INFO L131 PetriNetUnfolder]: For 1124/1182 co-relation queries the response was YES. [2022-12-06 06:45:15,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 276 events. 81/276 cut-off events. For 1124/1182 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1530 event pairs, 8 based on Foata normal form. 15/282 useless extension candidates. Maximal degree in co-relation 1295. Up to 125 conditions per place. [2022-12-06 06:45:15,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 684 flow [2022-12-06 06:45:15,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:45:15,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L787-->L794: Formula: (let ((.cse4 (not (= 0 (mod v_~y$r_buff1_thd3~0_24 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_88 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_31) v_~y$r_buff0_thd3~0_30) (= v_~y~0_51 (ite .cse1 v_~y$w_buff0~0_34 (ite .cse2 v_~y$w_buff1~0_35 v_~y~0_52))) (= v_~y$w_buff0_used~0_87 (ite .cse1 0 v_~y$w_buff0_used~0_88)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_80 256) 0)))) 0 v_~y$r_buff1_thd3~0_24) v_~y$r_buff1_thd3~0_23) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_81) v_~y$w_buff1_used~0_80)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 06:45:15,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L787-->L794: Formula: (let ((.cse4 (not (= 0 (mod v_~y$r_buff1_thd3~0_24 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_88 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_31) v_~y$r_buff0_thd3~0_30) (= v_~y~0_51 (ite .cse1 v_~y$w_buff0~0_34 (ite .cse2 v_~y$w_buff1~0_35 v_~y~0_52))) (= v_~y$w_buff0_used~0_87 (ite .cse1 0 v_~y$w_buff0_used~0_88)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_80 256) 0)))) 0 v_~y$r_buff1_thd3~0_24) v_~y$r_buff1_thd3~0_23) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_81) v_~y$w_buff1_used~0_80)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 06:45:15,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L787-->L794: Formula: (let ((.cse4 (not (= 0 (mod v_~y$r_buff1_thd3~0_24 256)))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_88 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_31) v_~y$r_buff0_thd3~0_30) (= v_~y~0_51 (ite .cse1 v_~y$w_buff0~0_34 (ite .cse2 v_~y$w_buff1~0_35 v_~y~0_52))) (= v_~y$w_buff0_used~0_87 (ite .cse1 0 v_~y$w_buff0_used~0_88)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_80 256) 0)))) 0 v_~y$r_buff1_thd3~0_24) v_~y$r_buff1_thd3~0_23) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_81) v_~y$w_buff1_used~0_80)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 06:45:15,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:15,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 06:45:15,885 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 697 flow [2022-12-06 06:45:15,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:15,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:15,885 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:45:15,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:45:15,885 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1503406345, now seen corresponding path program 1 times [2022-12-06 06:45:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:15,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084373052] [2022-12-06 06:45:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:16,013 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:45:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084373052] [2022-12-06 06:45:16,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084373052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:16,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:16,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:45:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147407536] [2022-12-06 06:45:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:16,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:16,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:45:16,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 697 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:16,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:16,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:45:16,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:16,097 INFO L130 PetriNetUnfolder]: 114/271 cut-off events. [2022-12-06 06:45:16,097 INFO L131 PetriNetUnfolder]: For 1429/1469 co-relation queries the response was YES. [2022-12-06 06:45:16,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 271 events. 114/271 cut-off events. For 1429/1469 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1199 event pairs, 5 based on Foata normal form. 48/316 useless extension candidates. Maximal degree in co-relation 1471. Up to 118 conditions per place. [2022-12-06 06:45:16,098 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 17 selfloop transitions, 10 changer transitions 53/83 dead transitions. [2022-12-06 06:45:16,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 1070 flow [2022-12-06 06:45:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:45:16,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.432 [2022-12-06 06:45:16,099 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 697 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:45:16,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 1070 flow [2022-12-06 06:45:16,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 991 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 06:45:16,102 INFO L231 Difference]: Finished difference. Result has 65 places, 26 transitions, 203 flow [2022-12-06 06:45:16,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=65, PETRI_TRANSITIONS=26} [2022-12-06 06:45:16,103 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 06:45:16,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:16,103 INFO L89 Accepts]: Start accepts. Operand has 65 places, 26 transitions, 203 flow [2022-12-06 06:45:16,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:16,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:16,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 26 transitions, 203 flow [2022-12-06 06:45:16,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 26 transitions, 203 flow [2022-12-06 06:45:16,107 INFO L130 PetriNetUnfolder]: 5/29 cut-off events. [2022-12-06 06:45:16,107 INFO L131 PetriNetUnfolder]: For 54/56 co-relation queries the response was YES. [2022-12-06 06:45:16,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 29 events. 5/29 cut-off events. For 54/56 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 105. Up to 11 conditions per place. [2022-12-06 06:45:16,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 26 transitions, 203 flow [2022-12-06 06:45:16,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 06:45:16,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [310] L740-->L743: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [338] $Ultimate##0-->L755: Formula: (and (= v_~x~0_15 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-06 06:45:16,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L784-->L787: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0] and [418] $Ultimate##0-->L740: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~z~0_65 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:45:17,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] $Ultimate##0-->L765: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_457 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_459 256) 0)) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_103 256) 0)))) (let ((.cse3 (and (not .cse2) .cse0)) (.cse4 (and .cse0 .cse1))) (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= 2 v_~y$w_buff0~0_297) (= v_~y$r_buff0_thd3~0_131 v_~y$r_buff1_thd3~0_106) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|) (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_424 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_102 256) 0)) .cse1)) 0 v_~y$r_buff0_thd2~0_103) v_~y$r_buff1_thd2~0_105) (= v_~y$w_buff1~0_279 v_~y$w_buff0~0_298) (= |v_P2Thread1of1ForFork0_~arg#1.offset_28| |v_P2Thread1of1ForFork0_#in~arg#1.offset_28|) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32| (ite .cse2 1 0)) (= v_~y$r_buff0_thd3~0_130 1) (= v_~z~0_128 2) (= 2 v_~x~0_114) (= v_~y~0_388 (ite .cse0 v_~y$w_buff0~0_297 (ite .cse3 v_~y$w_buff1~0_279 1))) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_28| |v_P2Thread1of1ForFork0_~arg#1.base_28|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= v_~y$w_buff0_used~0_457 (ite .cse0 0 1)) (= v_~y$r_buff0_thd0~0_292 v_~y$r_buff1_thd0~0_301) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff0_used~0_459) v_~y$w_buff1_used~0_424) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_103) v_~y$r_buff0_thd2~0_102) (= v_~y$r_buff0_thd1~0_42 v_~y$r_buff1_thd1~0_46) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_28|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_28|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_298, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_131, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_42, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_457, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_46, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_106, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_28|, ~y$w_buff0~0=v_~y$w_buff0~0_297, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_42, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_388, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_28|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_105, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~y$w_buff1~0=v_~y$w_buff1~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_28|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~z~0=v_~z~0_128, ~x~0=v_~x~0_114, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_301, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_424} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork2_~arg.offset, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd2~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [384] L743-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P0Thread1of1ForFork1_#res.offset_11| 0) (= |v_P0Thread1of1ForFork1_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:45:17,828 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 06:45:17,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1727 [2022-12-06 06:45:17,830 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 17 transitions, 212 flow [2022-12-06 06:45:17,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:17,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:17,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:17,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:45:17,830 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 702402196, now seen corresponding path program 1 times [2022-12-06 06:45:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:17,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084023670] [2022-12-06 06:45:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:45:17,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:45:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:45:17,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:45:17,887 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:45:17,888 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:45:17,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:45:17,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:45:17,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:45:17,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:45:17,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:45:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:45:17,890 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:17,894 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:45:17,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:45:17,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:45:17 BasicIcfg [2022-12-06 06:45:17,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:45:17,939 INFO L158 Benchmark]: Toolchain (without parser) took 23940.36ms. Allocated memory was 243.3MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 217.2MB in the beginning and 647.9MB in the end (delta: -430.7MB). Peak memory consumption was 470.0MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,939 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 243.3MB. Free memory is still 219.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:45:17,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.30ms. Allocated memory is still 243.3MB. Free memory was 216.7MB in the beginning and 190.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.16ms. Allocated memory is still 243.3MB. Free memory was 190.4MB in the beginning and 187.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,939 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 243.3MB. Free memory was 187.9MB in the beginning and 185.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,939 INFO L158 Benchmark]: RCFGBuilder took 600.13ms. Allocated memory is still 243.3MB. Free memory was 185.8MB in the beginning and 153.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,940 INFO L158 Benchmark]: TraceAbstraction took 22783.89ms. Allocated memory was 243.3MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 152.7MB in the beginning and 647.9MB in the end (delta: -495.2MB). Peak memory consumption was 405.0MB. Max. memory is 8.0GB. [2022-12-06 06:45:17,941 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.10ms. Allocated memory is still 243.3MB. Free memory is still 219.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.30ms. Allocated memory is still 243.3MB. Free memory was 216.7MB in the beginning and 190.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.16ms. Allocated memory is still 243.3MB. Free memory was 190.4MB in the beginning and 187.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 243.3MB. Free memory was 187.9MB in the beginning and 185.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.13ms. Allocated memory is still 243.3MB. Free memory was 185.8MB in the beginning and 153.8MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22783.89ms. Allocated memory was 243.3MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 152.7MB in the beginning and 647.9MB in the end (delta: -495.2MB). Peak memory consumption was 405.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 110 PlacesBefore, 34 PlacesAfterwards, 102 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1430, independent: 1376, independent conditional: 1376, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1430, independent: 1376, independent conditional: 0, independent unconditional: 1376, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1430, independent: 1376, independent conditional: 0, independent unconditional: 1376, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1430, independent: 1376, independent conditional: 0, independent unconditional: 1376, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1207, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1430, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1945, Positive cache size: 1907, Positive conditional cache size: 0, Positive unconditional cache size: 1907, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 3, independent unconditional: 44, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 47, independent conditional: 3, independent unconditional: 44, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 3, independent unconditional: 44, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 77, dependent conditional: 5, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 62, unknown conditional: 4, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 46, Positive conditional cache size: 3, Positive unconditional cache size: 43, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 87, independent conditional: 87, 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: 104, independent: 87, independent conditional: 9, independent unconditional: 78, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 69, Positive conditional cache size: 3, Positive unconditional cache size: 66, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 15, independent unconditional: 30, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 43, independent conditional: 9, independent unconditional: 34, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 71, Positive conditional cache size: 3, Positive unconditional cache size: 68, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 44, independent conditional: 12, independent unconditional: 32, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 44, independent conditional: 5, independent unconditional: 39, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 44, independent conditional: 5, independent unconditional: 39, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 74, Positive conditional cache size: 4, Positive unconditional cache size: 70, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 74, Positive conditional cache size: 4, Positive unconditional cache size: 70, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, 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, 47 PlacesBefore, 47 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 54, independent conditional: 36, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 63, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 74, Positive conditional cache size: 4, Positive unconditional cache size: 70, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, 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.7s, 51 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 43, independent conditional: 26, independent unconditional: 17, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 43, independent conditional: 2, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 43, independent conditional: 2, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 17, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 35, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 68, independent conditional: 32, independent unconditional: 36, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 68, independent conditional: 8, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 68, independent conditional: 8, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 78, independent: 68, independent conditional: 8, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 76, independent conditional: 46, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 76, independent conditional: 10, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 76, independent conditional: 10, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 88, independent: 76, independent conditional: 10, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 77, independent conditional: 77, 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: 92, independent: 77, independent conditional: 45, independent unconditional: 32, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 77, independent conditional: 17, independent unconditional: 60, 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: 92, independent: 77, independent conditional: 17, independent unconditional: 60, 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: 92, independent: 77, independent conditional: 17, independent unconditional: 60, 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): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 115, independent conditional: 69, independent unconditional: 46, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 139, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 4, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 73 PlacesBefore, 74 PlacesAfterwards, 92 TransitionsBefore, 93 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 411, independent: 346, independent conditional: 346, 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: 411, independent: 346, independent conditional: 221, independent unconditional: 125, 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: 411, independent: 346, independent conditional: 123, independent unconditional: 223, 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: 411, independent: 346, independent conditional: 123, independent unconditional: 223, 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: 0, 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: 411, independent: 346, independent conditional: 123, independent unconditional: 223, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 89, Positive conditional cache size: 4, Positive unconditional cache size: 85, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 98, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 132, independent conditional: 132, 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: 168, independent: 132, independent conditional: 99, independent unconditional: 33, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 132, independent conditional: 81, independent unconditional: 51, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 132, independent conditional: 81, independent unconditional: 51, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 168, independent: 132, independent conditional: 81, independent unconditional: 51, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 89, Positive conditional cache size: 4, Positive unconditional cache size: 85, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 66 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 30, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 33, independent conditional: 13, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 13, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 25, independent conditional: 11, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 110, Positive conditional cache size: 6, Positive unconditional cache size: 104, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 64 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 126, Positive conditional cache size: 8, Positive unconditional cache size: 118, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 61 PlacesBefore, 48 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 15, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 174, Positive conditional cache size: 9, Positive unconditional cache size: 165, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 z = 1 [L739] 3 z = 2 [L742] 3 x = 1 [L754] 3 x = 2 [L757] 3 y = 1 [L760] 3 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 3 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 3 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 812]: 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: 816]: 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, 131 locations, 6 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: 22.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1220 IncrementalHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 28 mSDtfsCounter, 1220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1376occurred in iteration=14, InterpolantAutomatonStates: 75, 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, 5.4s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:45:17,990 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...