/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:09:33,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:09:33,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:09:33,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:09:33,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:09:33,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:09:33,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:09:33,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:09:33,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:09:33,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:09:33,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:09:33,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:09:33,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:09:33,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:09:33,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:09:33,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:09:33,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:09:33,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:09:33,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:09:33,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:09:33,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:09:33,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:09:33,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:09:33,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:09:33,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:09:33,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:09:33,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:09:33,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:09:33,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:09:33,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:09:33,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:09:33,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:09:33,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:09:33,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:09:33,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:09:33,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:09:33,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:09:33,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:09:33,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:09:33,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:09:33,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:09:33,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:09:33,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:09:33,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:09:33,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:09:33,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:09:33,646 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:09:33,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:09:33,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:09:33,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:09:33,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:09:33,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:09:33,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:09:33,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:09:33,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:09:33,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:09:33,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:09:33,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:09:33,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:09:33,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:09:33,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:09:33,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:09:33,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:09:33,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:09:33,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:09:33,651 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:09:33,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:09:34,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:09:34,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:09:34,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:09:34,020 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:09:34,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 06:09:35,236 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:09:35,581 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:09:35,582 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 06:09:35,617 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae802859/b9b7c8746b884643bc3492af42a9924b/FLAG93ae0cd1c [2022-12-13 06:09:35,637 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae802859/b9b7c8746b884643bc3492af42a9924b [2022-12-13 06:09:35,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:09:35,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:09:35,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:09:35,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:09:35,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:09:35,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:09:35" (1/1) ... [2022-12-13 06:09:35,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37845ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:35, skipping insertion in model container [2022-12-13 06:09:35,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:09:35" (1/1) ... [2022-12-13 06:09:35,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:09:35,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:09:35,882 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/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 06:09:36,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:09:36,121 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:09:36,134 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/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 06:09:36,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:09:36,254 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:09:36,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36 WrapperNode [2022-12-13 06:09:36,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:09:36,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:09:36,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:09:36,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:09:36,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,329 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-12-13 06:09:36,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:09:36,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:09:36,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:09:36,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:09:36,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:09:36,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:09:36,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:09:36,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:09:36,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:09:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:09:36,425 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-13 06:09:36,455 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-13 06:09:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:09:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:09:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:09:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:09:36,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:09:36,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:09:36,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:09:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:09:36,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:09:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:09:36,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:09:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:09:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:09:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:09:36,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:09:36,480 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:09:36,643 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:09:36,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:09:37,039 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:09:37,166 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:09:37,167 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:09:37,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:09:37 BoogieIcfgContainer [2022-12-13 06:09:37,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:09:37,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:09:37,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:09:37,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:09:37,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:09:35" (1/3) ... [2022-12-13 06:09:37,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa35760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:09:37, skipping insertion in model container [2022-12-13 06:09:37,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (2/3) ... [2022-12-13 06:09:37,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa35760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:09:37, skipping insertion in model container [2022-12-13 06:09:37,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:09:37" (3/3) ... [2022-12-13 06:09:37,181 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-12-13 06:09:37,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:09:37,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:09:37,200 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:09:37,267 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:09:37,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 06:09:37,366 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 06:09:37,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:37,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 06:09:37,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 06:09:37,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-13 06:09:37,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:37,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 06:09:37,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-13 06:09:37,456 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 06:09:37,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:37,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 06:09:37,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 06:09:37,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-13 06:09:42,444 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 06:09:42,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:09:42,474 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;@5986801f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:09:42,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 06:09:42,482 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 06:09:42,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:42,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:42,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:42,484 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-13 06:09:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -612009283, now seen corresponding path program 1 times [2022-12-13 06:09:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:42,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274086210] [2022-12-13 06:09:42,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:42,948 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-13 06:09:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274086210] [2022-12-13 06:09:42,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274086210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:09:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705698455] [2022-12-13 06:09:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:09:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:09:42,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:09:42,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-13 06:09:42,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 06:09:42,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:42,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-13 06:09:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:44,308 INFO L130 PetriNetUnfolder]: 7099/11207 cut-off events. [2022-12-13 06:09:44,308 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 06:09:44,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21410 conditions, 11207 events. 7099/11207 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 80318 event pairs, 824 based on Foata normal form. 0/6816 useless extension candidates. Maximal degree in co-relation 21399. Up to 8776 conditions per place. [2022-12-13 06:09:44,360 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 29 selfloop transitions, 2 changer transitions 42/83 dead transitions. [2022-12-13 06:09:44,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 321 flow [2022-12-13 06:09:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:09:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:09:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-12-13 06:09:44,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-13 06:09:44,377 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-13 06:09:44,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 83 transitions, 321 flow [2022-12-13 06:09:44,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 41 transitions, 153 flow [2022-12-13 06:09:44,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:44,474 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 153 flow [2022-12-13 06:09:44,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:44,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:44,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 153 flow [2022-12-13 06:09:44,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 153 flow [2022-12-13 06:09:44,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 06:09:44,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:44,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-13 06:09:44,732 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 153 flow [2022-12-13 06:09:44,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 06:09:44,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:44,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:44,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:09:44,738 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-13 06:09:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 269715445, now seen corresponding path program 1 times [2022-12-13 06:09:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:44,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291607895] [2022-12-13 06:09:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:44,926 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-13 06:09:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291607895] [2022-12-13 06:09:44,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291607895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:44,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:44,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:09:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971439652] [2022-12-13 06:09:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:44,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:09:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:09:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:09:44,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 06:09:44,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:44,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:44,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 06:09:44,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:45,389 INFO L130 PetriNetUnfolder]: 2040/3161 cut-off events. [2022-12-13 06:09:45,389 INFO L131 PetriNetUnfolder]: For 278/278 co-relation queries the response was YES. [2022-12-13 06:09:45,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8682 conditions, 3161 events. 2040/3161 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15822 event pairs, 143 based on Foata normal form. 8/2672 useless extension candidates. Maximal degree in co-relation 8668. Up to 2873 conditions per place. [2022-12-13 06:09:45,422 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 45 selfloop transitions, 5 changer transitions 2/59 dead transitions. [2022-12-13 06:09:45,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 331 flow [2022-12-13 06:09:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:09:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:09:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 06:09:45,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-13 06:09:45,426 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2022-12-13 06:09:45,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 59 transitions, 331 flow [2022-12-13 06:09:45,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 57 transitions, 323 flow [2022-12-13 06:09:45,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:45,475 INFO L89 Accepts]: Start accepts. Operand has 44 places, 57 transitions, 323 flow [2022-12-13 06:09:45,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:45,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:45,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 57 transitions, 323 flow [2022-12-13 06:09:45,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 57 transitions, 323 flow [2022-12-13 06:09:45,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 06:09:45,485 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:45,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 06:09:45,488 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 57 transitions, 323 flow [2022-12-13 06:09:45,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:45,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:45,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:45,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:09:45,488 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-13 06:09:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash 487504803, now seen corresponding path program 1 times [2022-12-13 06:09:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:45,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61032272] [2022-12-13 06:09:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:45,715 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-13 06:09:45,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:45,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61032272] [2022-12-13 06:09:45,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61032272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:45,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:45,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:09:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105484440] [2022-12-13 06:09:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:45,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:09:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:45,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:09:45,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:09:45,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 06:09:45,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 57 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:45,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:45,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 06:09:45,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:46,001 INFO L130 PetriNetUnfolder]: 1504/2353 cut-off events. [2022-12-13 06:09:46,002 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-13 06:09:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2353 events. 1504/2353 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11146 event pairs, 166 based on Foata normal form. 42/2013 useless extension candidates. Maximal degree in co-relation 8808. Up to 2140 conditions per place. [2022-12-13 06:09:46,025 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 56 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2022-12-13 06:09:46,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:09:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:09:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 06:09:46,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 06:09:46,037 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2022-12-13 06:09:46,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:46,081 INFO L89 Accepts]: Start accepts. Operand has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:46,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:46,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 66 transitions, 493 flow [2022-12-13 06:09:46,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-13 06:09:46,590 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:09:46,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-13 06:09:46,591 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 66 transitions, 499 flow [2022-12-13 06:09:46,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:46,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:46,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:46,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:09:46,592 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-13 06:09:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1498435555, now seen corresponding path program 1 times [2022-12-13 06:09:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642112284] [2022-12-13 06:09:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:46,826 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-13 06:09:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642112284] [2022-12-13 06:09:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642112284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:46,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:46,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:09:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611978347] [2022-12-13 06:09:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:46,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:09:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:09:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:09:46,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 06:09:46,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 66 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:46,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:46,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 06:09:46,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:47,211 INFO L130 PetriNetUnfolder]: 1866/2896 cut-off events. [2022-12-13 06:09:47,211 INFO L131 PetriNetUnfolder]: For 2333/2337 co-relation queries the response was YES. [2022-12-13 06:09:47,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12881 conditions, 2896 events. 1866/2896 cut-off events. For 2333/2337 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14393 event pairs, 305 based on Foata normal form. 49/2538 useless extension candidates. Maximal degree in co-relation 12861. Up to 2533 conditions per place. [2022-12-13 06:09:47,235 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 68 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2022-12-13 06:09:47,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:09:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:09:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 06:09:47,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 06:09:47,237 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -16 predicate places. [2022-12-13 06:09:47,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:47,276 INFO L89 Accepts]: Start accepts. Operand has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:47,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:47,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 06:09:47,282 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:47,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:09:47,283 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 94 transitions, 877 flow [2022-12-13 06:09:47,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:47,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:47,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:09:47,284 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-13 06:09:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -228345741, now seen corresponding path program 1 times [2022-12-13 06:09:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:47,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827631943] [2022-12-13 06:09:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:47,454 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-13 06:09:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827631943] [2022-12-13 06:09:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827631943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:47,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:47,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:09:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797348146] [2022-12-13 06:09:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:09:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:47,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:09:47,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:09:47,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 06:09:47,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 94 transitions, 877 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:47,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:47,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 06:09:47,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:47,754 INFO L130 PetriNetUnfolder]: 899/1587 cut-off events. [2022-12-13 06:09:47,755 INFO L131 PetriNetUnfolder]: For 1891/1931 co-relation queries the response was YES. [2022-12-13 06:09:47,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8551 conditions, 1587 events. 899/1587 cut-off events. For 1891/1931 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8271 event pairs, 93 based on Foata normal form. 149/1513 useless extension candidates. Maximal degree in co-relation 8528. Up to 1337 conditions per place. [2022-12-13 06:09:47,768 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 68 selfloop transitions, 35 changer transitions 0/111 dead transitions. [2022-12-13 06:09:47,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:09:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:09:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 06:09:47,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2022-12-13 06:09:47,771 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -13 predicate places. [2022-12-13 06:09:47,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:47,798 INFO L89 Accepts]: Start accepts. Operand has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:47,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:47,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-13 06:09:47,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:47,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:09:47,807 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 111 transitions, 1238 flow [2022-12-13 06:09:47,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:47,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:47,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:09:47,807 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-13 06:09:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1671918157, now seen corresponding path program 1 times [2022-12-13 06:09:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769296629] [2022-12-13 06:09:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:48,023 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-13 06:09:48,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:48,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769296629] [2022-12-13 06:09:48,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769296629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:48,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:48,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:09:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251876400] [2022-12-13 06:09:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:48,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:09:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:09:48,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:09:48,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 06:09:48,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 111 transitions, 1238 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-13 06:09:48,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:48,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 06:09:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:48,437 INFO L130 PetriNetUnfolder]: 1314/2404 cut-off events. [2022-12-13 06:09:48,437 INFO L131 PetriNetUnfolder]: For 3820/3875 co-relation queries the response was YES. [2022-12-13 06:09:48,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15016 conditions, 2404 events. 1314/2404 cut-off events. For 3820/3875 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14533 event pairs, 80 based on Foata normal form. 146/2164 useless extension candidates. Maximal degree in co-relation 14990. Up to 2105 conditions per place. [2022-12-13 06:09:48,457 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 117 selfloop transitions, 16 changer transitions 61/207 dead transitions. [2022-12-13 06:09:48,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 207 transitions, 2772 flow [2022-12-13 06:09:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:09:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:09:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 06:09:48,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2022-12-13 06:09:48,460 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2022-12-13 06:09:48,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 207 transitions, 2772 flow [2022-12-13 06:09:48,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 146 transitions, 1927 flow [2022-12-13 06:09:48,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:48,518 INFO L89 Accepts]: Start accepts. Operand has 56 places, 146 transitions, 1927 flow [2022-12-13 06:09:48,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:48,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:48,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 146 transitions, 1927 flow [2022-12-13 06:09:48,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 146 transitions, 1927 flow [2022-12-13 06:09:48,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 06:09:48,527 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:48,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 06:09:48,527 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 146 transitions, 1927 flow [2022-12-13 06:09:48,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-13 06:09:48,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:48,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:48,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:09:48,528 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-13 06:09:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1402492497, now seen corresponding path program 1 times [2022-12-13 06:09:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:48,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967094748] [2022-12-13 06:09:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:48,755 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-13 06:09:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967094748] [2022-12-13 06:09:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967094748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:48,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:48,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:09:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786108049] [2022-12-13 06:09:48,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:48,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:09:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:09:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:09:48,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 06:09:48,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 146 transitions, 1927 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 06:09:48,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:48,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 06:09:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:48,987 INFO L130 PetriNetUnfolder]: 528/1030 cut-off events. [2022-12-13 06:09:48,987 INFO L131 PetriNetUnfolder]: For 2558/2678 co-relation queries the response was YES. [2022-12-13 06:09:48,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 1030 events. 528/1030 cut-off events. For 2558/2678 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5418 event pairs, 6 based on Foata normal form. 156/1017 useless extension candidates. Maximal degree in co-relation 7259. Up to 845 conditions per place. [2022-12-13 06:09:48,994 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 56 selfloop transitions, 56 changer transitions 21/140 dead transitions. [2022-12-13 06:09:48,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 140 transitions, 2105 flow [2022-12-13 06:09:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:09:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:09:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 06:09:48,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-13 06:09:48,997 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2022-12-13 06:09:48,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 140 transitions, 2105 flow [2022-12-13 06:09:49,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 119 transitions, 1788 flow [2022-12-13 06:09:49,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:49,014 INFO L89 Accepts]: Start accepts. Operand has 56 places, 119 transitions, 1788 flow [2022-12-13 06:09:49,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:49,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:49,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 119 transitions, 1788 flow [2022-12-13 06:09:49,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 119 transitions, 1788 flow [2022-12-13 06:09:49,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-13 06:09:49,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:09:49,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-13 06:09:49,347 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 118 transitions, 1772 flow [2022-12-13 06:09:49,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 06:09:49,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:49,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:09:49,348 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-13 06:09:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -821708246, now seen corresponding path program 1 times [2022-12-13 06:09:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:49,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641510827] [2022-12-13 06:09:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:49,561 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-13 06:09:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:49,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641510827] [2022-12-13 06:09:49,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641510827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:49,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:49,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:09:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691493324] [2022-12-13 06:09:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:09:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:09:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:09:49,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:09:49,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 118 transitions, 1772 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 06:09:49,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:49,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:09:49,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:49,788 INFO L130 PetriNetUnfolder]: 612/1119 cut-off events. [2022-12-13 06:09:49,788 INFO L131 PetriNetUnfolder]: For 3019/3066 co-relation queries the response was YES. [2022-12-13 06:09:49,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 1119 events. 612/1119 cut-off events. For 3019/3066 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5836 event pairs, 0 based on Foata normal form. 34/917 useless extension candidates. Maximal degree in co-relation 8810. Up to 989 conditions per place. [2022-12-13 06:09:49,796 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 109 selfloop transitions, 14 changer transitions 46/181 dead transitions. [2022-12-13 06:09:49,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 181 transitions, 3100 flow [2022-12-13 06:09:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:09:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:09:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 06:09:49,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2022-12-13 06:09:49,800 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2022-12-13 06:09:49,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 181 transitions, 3100 flow [2022-12-13 06:09:49,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 135 transitions, 2277 flow [2022-12-13 06:09:49,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:49,822 INFO L89 Accepts]: Start accepts. Operand has 59 places, 135 transitions, 2277 flow [2022-12-13 06:09:49,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:49,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:49,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 135 transitions, 2277 flow [2022-12-13 06:09:49,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 135 transitions, 2277 flow [2022-12-13 06:09:49,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 06:09:49,831 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:49,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 06:09:49,833 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 135 transitions, 2277 flow [2022-12-13 06:09:49,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 06:09:49,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:49,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:09:49,834 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-13 06:09:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1980745716, now seen corresponding path program 2 times [2022-12-13 06:09:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:49,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100287093] [2022-12-13 06:09:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:50,038 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-13 06:09:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:50,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100287093] [2022-12-13 06:09:50,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100287093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:50,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:50,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:09:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018697089] [2022-12-13 06:09:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:09:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:09:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:09:50,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 06:09:50,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 135 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 06:09:50,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:50,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 06:09:50,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:50,230 INFO L130 PetriNetUnfolder]: 564/1108 cut-off events. [2022-12-13 06:09:50,231 INFO L131 PetriNetUnfolder]: For 3552/3622 co-relation queries the response was YES. [2022-12-13 06:09:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 1108 events. 564/1108 cut-off events. For 3552/3622 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6385 event pairs, 2 based on Foata normal form. 45/920 useless extension candidates. Maximal degree in co-relation 9326. Up to 990 conditions per place. [2022-12-13 06:09:50,238 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 50 selfloop transitions, 2 changer transitions 108/172 dead transitions. [2022-12-13 06:09:50,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 172 transitions, 3257 flow [2022-12-13 06:09:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:09:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:09:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 06:09:50,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 06:09:50,240 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2022-12-13 06:09:50,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 172 transitions, 3257 flow [2022-12-13 06:09:50,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 64 transitions, 1127 flow [2022-12-13 06:09:50,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:50,256 INFO L89 Accepts]: Start accepts. Operand has 59 places, 64 transitions, 1127 flow [2022-12-13 06:09:50,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:50,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:50,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 64 transitions, 1127 flow [2022-12-13 06:09:50,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 64 transitions, 1127 flow [2022-12-13 06:09:50,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 06:09:51,411 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 06:09:51,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1157 [2022-12-13 06:09:51,412 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 1095 flow [2022-12-13 06:09:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 06:09:51,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:51,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:51,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:09:51,413 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-13 06:09:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2126771764, now seen corresponding path program 1 times [2022-12-13 06:09:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:51,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110846569] [2022-12-13 06:09:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:51,947 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-13 06:09:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:51,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110846569] [2022-12-13 06:09:51,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110846569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:51,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:51,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:09:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433203899] [2022-12-13 06:09:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:51,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:09:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:51,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:09:51,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:09:51,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:09:51,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 1095 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 06:09:51,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:51,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:09:51,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:52,111 INFO L130 PetriNetUnfolder]: 342/652 cut-off events. [2022-12-13 06:09:52,111 INFO L131 PetriNetUnfolder]: For 2276/2277 co-relation queries the response was YES. [2022-12-13 06:09:52,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6010 conditions, 652 events. 342/652 cut-off events. For 2276/2277 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3251 event pairs, 3 based on Foata normal form. 28/518 useless extension candidates. Maximal degree in co-relation 5972. Up to 616 conditions per place. [2022-12-13 06:09:52,117 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 44 selfloop transitions, 2 changer transitions 45/103 dead transitions. [2022-12-13 06:09:52,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 103 transitions, 2097 flow [2022-12-13 06:09:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:09:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:09:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 06:09:52,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-13 06:09:52,119 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 06:09:52,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 103 transitions, 2097 flow [2022-12-13 06:09:52,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 1107 flow [2022-12-13 06:09:52,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:52,131 INFO L89 Accepts]: Start accepts. Operand has 59 places, 58 transitions, 1107 flow [2022-12-13 06:09:52,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:52,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:52,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 1107 flow [2022-12-13 06:09:52,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 1107 flow [2022-12-13 06:09:52,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 06:09:52,136 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:52,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:09:52,137 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 1107 flow [2022-12-13 06:09:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 06:09:52,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:52,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:09:52,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-13 06:09:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2001623696, now seen corresponding path program 1 times [2022-12-13 06:09:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:52,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128126154] [2022-12-13 06:09:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:52,726 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-13 06:09:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:52,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128126154] [2022-12-13 06:09:52,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128126154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:52,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:52,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:09:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436299144] [2022-12-13 06:09:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:52,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:09:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:09:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:09:52,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 06:09:52,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-13 06:09:52,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:52,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 06:09:52,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:52,887 INFO L130 PetriNetUnfolder]: 278/544 cut-off events. [2022-12-13 06:09:52,887 INFO L131 PetriNetUnfolder]: For 1736/1736 co-relation queries the response was YES. [2022-12-13 06:09:52,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 544 events. 278/544 cut-off events. For 1736/1736 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2782 event pairs, 3 based on Foata normal form. 27/430 useless extension candidates. Maximal degree in co-relation 5330. Up to 517 conditions per place. [2022-12-13 06:09:52,891 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 34 selfloop transitions, 4 changer transitions 45/94 dead transitions. [2022-12-13 06:09:52,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 2063 flow [2022-12-13 06:09:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:09:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:09:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 06:09:52,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-13 06:09:52,893 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-13 06:09:52,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 94 transitions, 2063 flow [2022-12-13 06:09:52,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 49 transitions, 1005 flow [2022-12-13 06:09:52,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:52,901 INFO L89 Accepts]: Start accepts. Operand has 61 places, 49 transitions, 1005 flow [2022-12-13 06:09:52,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:52,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:52,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 1005 flow [2022-12-13 06:09:52,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 1005 flow [2022-12-13 06:09:52,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 06:09:52,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:09:52,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 06:09:52,952 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 1005 flow [2022-12-13 06:09:52,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-13 06:09:52,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:52,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:52,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:09:52,952 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-13 06:09:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1691979674, now seen corresponding path program 1 times [2022-12-13 06:09:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657707697] [2022-12-13 06:09:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:09:52,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:09:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:09:53,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:09:53,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:09:53,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 06:09:53,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 06:09:53,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 06:09:53,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 06:09:53,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 06:09:53,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 06:09:53,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:09:53,080 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:53,085 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:09:53,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:09:53,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:09:53 BasicIcfg [2022-12-13 06:09:53,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:09:53,169 INFO L158 Benchmark]: Toolchain (without parser) took 17528.56ms. Allocated memory was 199.2MB in the beginning and 631.2MB in the end (delta: 432.0MB). Free memory was 173.8MB in the beginning and 540.3MB in the end (delta: -366.5MB). Peak memory consumption was 420.5MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,169 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:09:53,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.81ms. Allocated memory is still 199.2MB. Free memory was 173.3MB in the beginning and 146.6MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.64ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 143.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,170 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,170 INFO L158 Benchmark]: RCFGBuilder took 805.24ms. Allocated memory is still 199.2MB. Free memory was 141.9MB in the beginning and 105.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,170 INFO L158 Benchmark]: TraceAbstraction took 15996.08ms. Allocated memory was 199.2MB in the beginning and 631.2MB in the end (delta: 432.0MB). Free memory was 104.6MB in the beginning and 540.3MB in the end (delta: -435.7MB). Peak memory consumption was 352.3MB. Max. memory is 8.0GB. [2022-12-13 06:09:53,177 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 613.81ms. Allocated memory is still 199.2MB. Free memory was 173.3MB in the beginning and 146.6MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.64ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 143.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 805.24ms. Allocated memory is still 199.2MB. Free memory was 141.9MB in the beginning and 105.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15996.08ms. Allocated memory was 199.2MB in the beginning and 631.2MB in the end (delta: 432.0MB). Free memory was 104.6MB in the beginning and 540.3MB in the end (delta: -435.7MB). Peak memory consumption was 352.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 114 PlacesBefore, 64 PlacesAfterwards, 106 TransitionsBefore, 54 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3578, independent: 3357, independent conditional: 3357, independent unconditional: 0, dependent: 221, dependent conditional: 221, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3578, independent: 3357, independent conditional: 0, independent unconditional: 3357, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3578, independent: 3357, independent conditional: 0, independent unconditional: 3357, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3578, independent: 3357, independent conditional: 0, independent unconditional: 3357, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1753, independent: 1684, independent conditional: 0, independent unconditional: 1684, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1753, independent: 1652, independent conditional: 0, independent unconditional: 1652, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 351, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3578, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1753, unknown conditional: 0, unknown unconditional: 1753] , Statistics on independence cache: Total cache size (in pairs): 3241, Positive cache size: 3172, Positive conditional cache size: 0, Positive unconditional cache size: 3172, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 35, independent conditional: 35, 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: 44, independent: 35, independent conditional: 22, independent unconditional: 13, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 35, independent conditional: 1, independent unconditional: 34, 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: 44, independent: 35, independent conditional: 1, independent unconditional: 34, 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: 29, independent: 25, independent conditional: 1, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 29, unknown conditional: 1, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 25, Positive conditional cache size: 1, Positive unconditional cache size: 24, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 25, Positive conditional cache size: 1, Positive unconditional cache size: 24, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 46 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 15, 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: 0, independent unconditional: 15, 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: 0, independent unconditional: 15, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 119 TransitionsBefore, 118 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 59 PlacesBefore, 57 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 9, independent unconditional: 2, 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: 11, independent: 11, independent conditional: 1, independent unconditional: 10, 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: 11, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 49, Positive conditional cache size: 2, Positive unconditional cache size: 47, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 49, Positive conditional cache size: 2, Positive unconditional cache size: 47, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 4, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 55, Positive cache size: 51, Positive conditional cache size: 3, Positive unconditional cache size: 48, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, 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; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=-2, t418={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] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=-1, t418={5:0}, t419={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] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=0, t418={5:0}, t419={6:0}, t420={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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 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) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 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 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 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 [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 848]: 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: 844]: 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: 846]: 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, 135 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: 15.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 812 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 11 mSDtfsCounter, 812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2277occurred in iteration=8, InterpolantAutomatonStates: 47, 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, 2.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-13 06:09:53,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...