/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/mix007.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:07:34,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:07:34,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:07:35,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:07:35,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:07:35,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:07:35,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:07:35,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:07:35,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:07:35,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:07:35,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:07:35,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:07:35,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:07:35,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:07:35,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:07:35,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:07:35,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:07:35,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:07:35,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:07:35,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:07:35,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:07:35,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:07:35,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:07:35,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:07:35,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:07:35,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:07:35,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:07:35,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:07:35,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:07:35,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:07:35,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:07:35,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:07:35,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:07:35,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:07:35,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:07:35,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:07:35,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:07:35,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:07:35,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:07:35,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:07:35,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:07:35,076 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:07:35,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:07:35,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:07:35,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:07:35,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:07:35,111 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:07:35,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:07:35,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:07:35,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:07:35,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:07:35,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:07:35,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:07:35,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:07:35,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:07:35,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:07:35,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:07:35,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:07:35,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:07:35,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:07:35,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:07:35,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:07:35,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:07:35,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:07:35,115 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:07:35,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:07:35,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:07:35,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:07:35,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:07:35,482 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:07:35,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2022-12-13 06:07:36,763 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:07:37,107 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:07:37,107 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2022-12-13 06:07:37,123 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295841200/9031af47cc6844aaba8fdb5d8290ab52/FLAG9ff06b422 [2022-12-13 06:07:37,134 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295841200/9031af47cc6844aaba8fdb5d8290ab52 [2022-12-13 06:07:37,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:07:37,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:07:37,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:07:37,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:07:37,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:07:37,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39689db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37, skipping insertion in model container [2022-12-13 06:07:37,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:07:37,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:07:37,324 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/mix007.opt.i[944,957] [2022-12-13 06:07:37,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:07:37,545 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:07:37,557 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/mix007.opt.i[944,957] [2022-12-13 06:07:37,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:07:37,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:07:37,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:07:37,648 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:07:37,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37 WrapperNode [2022-12-13 06:07:37,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:07:37,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:07:37,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:07:37,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:07:37,658 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:07:37" (1/1) ... [2022-12-13 06:07:37,690 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:07:37" (1/1) ... [2022-12-13 06:07:37,732 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 06:07:37,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:07:37,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:07:37,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:07:37,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:07:37,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,786 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:07:37,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:07:37,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:07:37,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:07:37,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (1/1) ... [2022-12-13 06:07:37,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:07:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:07:37,826 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:07:37,845 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:07:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:07:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:07:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:07:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:07:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:07:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 06:07:37,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 06:07:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:07:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:07:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:07:37,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:07:37,869 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:07:38,067 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:07:38,068 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:07:38,437 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:07:38,578 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:07:38,579 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:07:38,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:07:38 BoogieIcfgContainer [2022-12-13 06:07:38,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:07:38,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:07:38,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:07:38,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:07:38,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:07:37" (1/3) ... [2022-12-13 06:07:38,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf185b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:07:38, skipping insertion in model container [2022-12-13 06:07:38,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:07:37" (2/3) ... [2022-12-13 06:07:38,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf185b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:07:38, skipping insertion in model container [2022-12-13 06:07:38,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:07:38" (3/3) ... [2022-12-13 06:07:38,589 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2022-12-13 06:07:38,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:07:38,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:07:38,605 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:07:38,661 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:07:38,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 06:07:38,764 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 06:07:38,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:07:38,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 06:07:38,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 06:07:38,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 06:07:38,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:07:38,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 06:07:38,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 06:07:38,844 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 06:07:38,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:07:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 06:07:38,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 06:07:38,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-13 06:07:44,833 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 06:07:44,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:07:44,851 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;@6e8534fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:07:44,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 06:07:44,856 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 06:07:44,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:07:44,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:07:44,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:07:44,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:07:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:07:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash 231809873, now seen corresponding path program 1 times [2022-12-13 06:07:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:07:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281320465] [2022-12-13 06:07:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:07:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:07:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:07:45,324 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:07:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:07:45,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281320465] [2022-12-13 06:07:45,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281320465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:07:45,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:07:45,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:07:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755161583] [2022-12-13 06:07:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:07:45,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:07:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:07:45,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:07:45,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:07:45,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 67 [2022-12-13 06:07:45,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:07:45,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:07:45,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 67 [2022-12-13 06:07:45,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:07:50,587 INFO L130 PetriNetUnfolder]: 40551/58271 cut-off events. [2022-12-13 06:07:50,588 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 06:07:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112191 conditions, 58271 events. 40551/58271 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 3408. Compared 444495 event pairs, 5311 based on Foata normal form. 0/35848 useless extension candidates. Maximal degree in co-relation 112179. Up to 46041 conditions per place. [2022-12-13 06:07:50,842 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 37 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2022-12-13 06:07:50,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-13 06:07:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:07:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:07:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-12-13 06:07:50,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 06:07:50,860 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2022-12-13 06:07:50,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 99 transitions, 380 flow [2022-12-13 06:07:50,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 196 flow [2022-12-13 06:07:51,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:07:51,304 INFO L89 Accepts]: Start accepts. Operand has 55 places, 53 transitions, 196 flow [2022-12-13 06:07:51,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:07:51,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:07:51,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 53 transitions, 196 flow [2022-12-13 06:07:51,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 196 flow [2022-12-13 06:07:51,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-13 06:07:53,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:07:53,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2207 [2022-12-13 06:07:53,510 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 196 flow [2022-12-13 06:07:53,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:07:53,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:07:53,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:07:53,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:07:53,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:07:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:07:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash -568989401, now seen corresponding path program 1 times [2022-12-13 06:07:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:07:53,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592265747] [2022-12-13 06:07:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:07:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:07:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:07:53,796 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:07:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:07:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592265747] [2022-12-13 06:07:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592265747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:07:53,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:07:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:07:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135786890] [2022-12-13 06:07:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:07:53,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:07:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:07:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:07:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:07:53,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:07:53,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:07:53,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:07:53,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:07:53,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:07:56,470 INFO L130 PetriNetUnfolder]: 25863/36547 cut-off events. [2022-12-13 06:07:56,470 INFO L131 PetriNetUnfolder]: For 4281/4281 co-relation queries the response was YES. [2022-12-13 06:07:56,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99356 conditions, 36547 events. 25863/36547 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 227189 event pairs, 2486 based on Foata normal form. 638/30503 useless extension candidates. Maximal degree in co-relation 99341. Up to 24257 conditions per place. [2022-12-13 06:07:56,714 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 72 selfloop transitions, 10 changer transitions 2/93 dead transitions. [2022-12-13 06:07:56,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 93 transitions, 523 flow [2022-12-13 06:07:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:07:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:07:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-13 06:07:56,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 06:07:56,717 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-13 06:07:56,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 93 transitions, 523 flow [2022-12-13 06:07:56,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 91 transitions, 515 flow [2022-12-13 06:07:57,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:07:57,054 INFO L89 Accepts]: Start accepts. Operand has 56 places, 91 transitions, 515 flow [2022-12-13 06:07:57,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:07:57,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:07:57,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 91 transitions, 515 flow [2022-12-13 06:07:57,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 91 transitions, 515 flow [2022-12-13 06:07:57,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-13 06:07:57,074 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:07:57,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 06:07:57,075 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 91 transitions, 515 flow [2022-12-13 06:07:57,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:07:57,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:07:57,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:07:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:07:57,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:07:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:07:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -458803025, now seen corresponding path program 1 times [2022-12-13 06:07:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:07:57,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032393175] [2022-12-13 06:07:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:07:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:07:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:07:57,224 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:07:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:07:57,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032393175] [2022-12-13 06:07:57,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032393175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:07:57,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:07:57,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:07:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52590879] [2022-12-13 06:07:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:07:57,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:07:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:07:57,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:07:57,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:07:57,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2022-12-13 06:07:57,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 91 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:07:57,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:07:57,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2022-12-13 06:07:57,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:07:59,341 INFO L130 PetriNetUnfolder]: 19127/27350 cut-off events. [2022-12-13 06:07:59,342 INFO L131 PetriNetUnfolder]: For 9542/9542 co-relation queries the response was YES. [2022-12-13 06:07:59,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97016 conditions, 27350 events. 19127/27350 cut-off events. For 9542/9542 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 166049 event pairs, 1947 based on Foata normal form. 280/22508 useless extension candidates. Maximal degree in co-relation 96998. Up to 18306 conditions per place. [2022-12-13 06:07:59,535 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 93 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2022-12-13 06:07:59,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:07:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:07:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 06:07:59,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 06:07:59,537 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 06:07:59,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:07:59,800 INFO L89 Accepts]: Start accepts. Operand has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:07:59,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:07:59,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 113 transitions, 839 flow [2022-12-13 06:07:59,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 1172 [2022-12-13 06:08:00,862 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:08:00,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1064 [2022-12-13 06:08:00,864 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 113 transitions, 847 flow [2022-12-13 06:08:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:08:00,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:00,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:00,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:08:00,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1337978808, now seen corresponding path program 1 times [2022-12-13 06:08:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:00,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637302819] [2022-12-13 06:08:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:01,161 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:08:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:01,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637302819] [2022-12-13 06:08:01,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637302819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:01,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:01,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:08:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258198644] [2022-12-13 06:08:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:01,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:08:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:08:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:08:01,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 06:08:01,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 113 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:08:01,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:01,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 06:08:01,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:03,193 INFO L130 PetriNetUnfolder]: 18043/26270 cut-off events. [2022-12-13 06:08:03,194 INFO L131 PetriNetUnfolder]: For 15034/15034 co-relation queries the response was YES. [2022-12-13 06:08:03,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114887 conditions, 26270 events. 18043/26270 cut-off events. For 15034/15034 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 166271 event pairs, 1173 based on Foata normal form. 100/21323 useless extension candidates. Maximal degree in co-relation 114866. Up to 21865 conditions per place. [2022-12-13 06:08:03,407 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 129 selfloop transitions, 8 changer transitions 0/150 dead transitions. [2022-12-13 06:08:03,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:08:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:08:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 06:08:03,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2022-12-13 06:08:03,409 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2022-12-13 06:08:03,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:03,828 INFO L89 Accepts]: Start accepts. Operand has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:03,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:03,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 1388 [2022-12-13 06:08:03,887 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:03,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 06:08:03,888 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 150 transitions, 1417 flow [2022-12-13 06:08:03,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:08:03,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:03,891 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:03,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:08:03,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1471913424, now seen corresponding path program 1 times [2022-12-13 06:08:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:03,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875155437] [2022-12-13 06:08:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:04,048 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:08:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:04,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875155437] [2022-12-13 06:08:04,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875155437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:04,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:04,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:08:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881248188] [2022-12-13 06:08:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:04,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:08:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:08:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:08:04,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 06:08:04,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 150 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:08:04,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:04,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 06:08:04,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:05,865 INFO L130 PetriNetUnfolder]: 17003/24790 cut-off events. [2022-12-13 06:08:05,865 INFO L131 PetriNetUnfolder]: For 29545/29545 co-relation queries the response was YES. [2022-12-13 06:08:05,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129350 conditions, 24790 events. 17003/24790 cut-off events. For 29545/29545 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 155752 event pairs, 439 based on Foata normal form. 400/20328 useless extension candidates. Maximal degree in co-relation 129326. Up to 20660 conditions per place. [2022-12-13 06:08:06,161 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 186 selfloop transitions, 3 changer transitions 0/205 dead transitions. [2022-12-13 06:08:06,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:08:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:08:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 06:08:06,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 06:08:06,164 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2022-12-13 06:08:06,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:06,412 INFO L89 Accepts]: Start accepts. Operand has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:06,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:06,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 1794 [2022-12-13 06:08:06,488 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:06,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 06:08:06,489 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 205 transitions, 2351 flow [2022-12-13 06:08:06,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:08:06,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:06,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:08:06,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1615327618, now seen corresponding path program 1 times [2022-12-13 06:08:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550625430] [2022-12-13 06:08:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:06,709 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:08:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550625430] [2022-12-13 06:08:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550625430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:06,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:06,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:08:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720939497] [2022-12-13 06:08:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:06,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:08:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:08:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:08:06,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:08:06,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 205 transitions, 2351 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:08:06,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:06,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:08:06,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:10,448 INFO L130 PetriNetUnfolder]: 30367/42176 cut-off events. [2022-12-13 06:08:10,449 INFO L131 PetriNetUnfolder]: For 120903/122629 co-relation queries the response was YES. [2022-12-13 06:08:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243648 conditions, 42176 events. 30367/42176 cut-off events. For 120903/122629 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 261210 event pairs, 3591 based on Foata normal form. 504/35296 useless extension candidates. Maximal degree in co-relation 243621. Up to 36687 conditions per place. [2022-12-13 06:08:10,806 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 253 selfloop transitions, 81 changer transitions 0/348 dead transitions. [2022-12-13 06:08:10,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:08:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:08:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 06:08:10,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 06:08:10,808 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2022-12-13 06:08:10,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:11,313 INFO L89 Accepts]: Start accepts. Operand has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:11,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:11,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-13 06:08:11,345 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:11,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 06:08:11,346 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 348 transitions, 4722 flow [2022-12-13 06:08:11,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:08:11,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:11,346 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:08:11,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:08:11,346 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1190391041, now seen corresponding path program 1 times [2022-12-13 06:08:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:11,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519203579] [2022-12-13 06:08:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:11,576 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:08:11,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:11,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519203579] [2022-12-13 06:08:11,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519203579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:11,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:11,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:08:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813209817] [2022-12-13 06:08:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:11,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:08:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:08:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:08:11,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:08:11,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 348 transitions, 4722 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08:11,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:11,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:08:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:14,378 INFO L130 PetriNetUnfolder]: 19836/28847 cut-off events. [2022-12-13 06:08:14,378 INFO L131 PetriNetUnfolder]: For 104607/107180 co-relation queries the response was YES. [2022-12-13 06:08:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193093 conditions, 28847 events. 19836/28847 cut-off events. For 104607/107180 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 185485 event pairs, 1586 based on Foata normal form. 1964/25897 useless extension candidates. Maximal degree in co-relation 193063. Up to 24974 conditions per place. [2022-12-13 06:08:14,593 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 280 selfloop transitions, 157 changer transitions 0/451 dead transitions. [2022-12-13 06:08:14,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:08:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:08:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 06:08:14,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 06:08:14,596 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2022-12-13 06:08:14,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:14,957 INFO L89 Accepts]: Start accepts. Operand has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:14,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:14,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 2228 [2022-12-13 06:08:14,991 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:14,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 06:08:14,992 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 451 transitions, 7016 flow [2022-12-13 06:08:14,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08:14,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:14,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:14,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:08:14,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash 828226805, now seen corresponding path program 1 times [2022-12-13 06:08:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:14,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134287962] [2022-12-13 06:08:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:15,201 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:08:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:15,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134287962] [2022-12-13 06:08:15,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134287962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:15,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:15,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:08:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385835490] [2022-12-13 06:08:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:08:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:08:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:08:15,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:08:15,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 451 transitions, 7016 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:08:15,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:15,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:08:15,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:17,209 INFO L130 PetriNetUnfolder]: 11985/17963 cut-off events. [2022-12-13 06:08:17,209 INFO L131 PetriNetUnfolder]: For 89972/92465 co-relation queries the response was YES. [2022-12-13 06:08:17,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136347 conditions, 17963 events. 11985/17963 cut-off events. For 89972/92465 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 113371 event pairs, 369 based on Foata normal form. 2363/17118 useless extension candidates. Maximal degree in co-relation 136314. Up to 15321 conditions per place. [2022-12-13 06:08:17,340 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 247 selfloop transitions, 213 changer transitions 7/481 dead transitions. [2022-12-13 06:08:17,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 481 transitions, 8396 flow [2022-12-13 06:08:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:08:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:08:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 06:08:17,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 06:08:17,342 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2022-12-13 06:08:17,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 481 transitions, 8396 flow [2022-12-13 06:08:17,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 474 transitions, 8270 flow [2022-12-13 06:08:17,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:17,590 INFO L89 Accepts]: Start accepts. Operand has 71 places, 474 transitions, 8270 flow [2022-12-13 06:08:17,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:17,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:17,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 474 transitions, 8270 flow [2022-12-13 06:08:17,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 474 transitions, 8270 flow [2022-12-13 06:08:17,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 2228 [2022-12-13 06:08:17,621 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:17,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 06:08:17,622 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 474 transitions, 8270 flow [2022-12-13 06:08:17,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:08:17,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:17,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:17,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:08:17,623 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -264514058, now seen corresponding path program 1 times [2022-12-13 06:08:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189290186] [2022-12-13 06:08:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:17,856 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:08:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189290186] [2022-12-13 06:08:17,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189290186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:17,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:17,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:08:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302876852] [2022-12-13 06:08:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:17,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:08:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:08:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:08:17,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:08:17,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 474 transitions, 8270 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:08:17,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:17,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:08:17,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:21,485 INFO L130 PetriNetUnfolder]: 17872/27486 cut-off events. [2022-12-13 06:08:21,485 INFO L131 PetriNetUnfolder]: For 138420/141907 co-relation queries the response was YES. [2022-12-13 06:08:21,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230914 conditions, 27486 events. 17872/27486 cut-off events. For 138420/141907 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 195011 event pairs, 460 based on Foata normal form. 1138/23575 useless extension candidates. Maximal degree in co-relation 230878. Up to 23836 conditions per place. [2022-12-13 06:08:21,691 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 515 selfloop transitions, 67 changer transitions 367/970 dead transitions. [2022-12-13 06:08:21,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 970 transitions, 19068 flow [2022-12-13 06:08:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:08:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:08:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-13 06:08:21,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2022-12-13 06:08:21,694 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2022-12-13 06:08:21,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 970 transitions, 19068 flow [2022-12-13 06:08:21,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 603 transitions, 11728 flow [2022-12-13 06:08:22,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:22,278 INFO L89 Accepts]: Start accepts. Operand has 76 places, 603 transitions, 11728 flow [2022-12-13 06:08:22,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:22,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:22,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 603 transitions, 11728 flow [2022-12-13 06:08:22,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 603 transitions, 11728 flow [2022-12-13 06:08:22,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 2622 [2022-12-13 06:08:22,362 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:22,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 06:08:22,364 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 603 transitions, 11728 flow [2022-12-13 06:08:22,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:08:22,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:22,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:22,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:08:22,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -752387810, now seen corresponding path program 1 times [2022-12-13 06:08:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244459293] [2022-12-13 06:08:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:22,641 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:08:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244459293] [2022-12-13 06:08:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244459293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:22,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:22,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:08:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073163573] [2022-12-13 06:08:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:08:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:08:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:08:22,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:08:22,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 603 transitions, 11728 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:08:22,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:22,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:08:22,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:24,678 INFO L130 PetriNetUnfolder]: 9502/14664 cut-off events. [2022-12-13 06:08:24,679 INFO L131 PetriNetUnfolder]: For 102133/105102 co-relation queries the response was YES. [2022-12-13 06:08:24,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132645 conditions, 14664 events. 9502/14664 cut-off events. For 102133/105102 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 96410 event pairs, 63 based on Foata normal form. 1940/13905 useless extension candidates. Maximal degree in co-relation 132606. Up to 12329 conditions per place. [2022-12-13 06:08:24,763 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 235 selfloop transitions, 277 changer transitions 65/592 dead transitions. [2022-12-13 06:08:24,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 592 transitions, 12656 flow [2022-12-13 06:08:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:08:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:08:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-13 06:08:24,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-13 06:08:24,765 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2022-12-13 06:08:24,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 592 transitions, 12656 flow [2022-12-13 06:08:24,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 527 transitions, 11266 flow [2022-12-13 06:08:24,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:24,990 INFO L89 Accepts]: Start accepts. Operand has 79 places, 527 transitions, 11266 flow [2022-12-13 06:08:24,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:24,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:24,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 527 transitions, 11266 flow [2022-12-13 06:08:25,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 527 transitions, 11266 flow [2022-12-13 06:08:25,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 2326 [2022-12-13 06:08:25,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:08:25,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-13 06:08:25,308 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 526 transitions, 11244 flow [2022-12-13 06:08:25,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:08:25,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:25,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:25,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:08:25,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1486989248, now seen corresponding path program 1 times [2022-12-13 06:08:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:25,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647513242] [2022-12-13 06:08:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:25,579 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:08:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647513242] [2022-12-13 06:08:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647513242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:25,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:08:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411303543] [2022-12-13 06:08:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:25,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:08:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:08:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:08:25,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 06:08:25,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 526 transitions, 11244 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:08:25,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:25,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 06:08:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:27,502 INFO L130 PetriNetUnfolder]: 9900/14963 cut-off events. [2022-12-13 06:08:27,503 INFO L131 PetriNetUnfolder]: For 99676/101369 co-relation queries the response was YES. [2022-12-13 06:08:27,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150081 conditions, 14963 events. 9900/14963 cut-off events. For 99676/101369 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 96209 event pairs, 9 based on Foata normal form. 529/12306 useless extension candidates. Maximal degree in co-relation 150039. Up to 12976 conditions per place. [2022-12-13 06:08:27,583 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 487 selfloop transitions, 62 changer transitions 314/884 dead transitions. [2022-12-13 06:08:27,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 884 transitions, 20711 flow [2022-12-13 06:08:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:08:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:08:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-12-13 06:08:27,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2022-12-13 06:08:27,585 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2022-12-13 06:08:27,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 884 transitions, 20711 flow [2022-12-13 06:08:27,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 570 transitions, 13220 flow [2022-12-13 06:08:27,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:27,789 INFO L89 Accepts]: Start accepts. Operand has 82 places, 570 transitions, 13220 flow [2022-12-13 06:08:27,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:27,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:27,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 570 transitions, 13220 flow [2022-12-13 06:08:27,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 570 transitions, 13220 flow [2022-12-13 06:08:27,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 2130 [2022-12-13 06:08:27,822 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:08:27,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 06:08:27,823 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 570 transitions, 13220 flow [2022-12-13 06:08:27,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:08:27,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:27,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:27,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:08:27,823 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash -648301367, now seen corresponding path program 1 times [2022-12-13 06:08:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:27,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849490564] [2022-12-13 06:08:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:28,108 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:08:28,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:28,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849490564] [2022-12-13 06:08:28,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849490564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:28,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:28,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:08:28,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617088127] [2022-12-13 06:08:28,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:28,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:08:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:28,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:08:28,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:08:28,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 06:08:28,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 570 transitions, 13220 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:08:28,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:28,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 06:08:28,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:31,296 INFO L130 PetriNetUnfolder]: 13539/21302 cut-off events. [2022-12-13 06:08:31,296 INFO L131 PetriNetUnfolder]: For 134710/138204 co-relation queries the response was YES. [2022-12-13 06:08:31,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221090 conditions, 21302 events. 13539/21302 cut-off events. For 134710/138204 co-relation queries the response was YES. Maximal size of possible extension queue 1468. Compared 157710 event pairs, 7 based on Foata normal form. 970/17539 useless extension candidates. Maximal degree in co-relation 221045. Up to 18266 conditions per place. [2022-12-13 06:08:31,517 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 189 selfloop transitions, 24 changer transitions 960/1193 dead transitions. [2022-12-13 06:08:31,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1193 transitions, 30036 flow [2022-12-13 06:08:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:08:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:08:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 261 transitions. [2022-12-13 06:08:31,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5426195426195426 [2022-12-13 06:08:31,521 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2022-12-13 06:08:31,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 1193 transitions, 30036 flow [2022-12-13 06:08:31,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 233 transitions, 5604 flow [2022-12-13 06:08:31,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:31,815 INFO L89 Accepts]: Start accepts. Operand has 87 places, 233 transitions, 5604 flow [2022-12-13 06:08:31,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:31,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:31,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 233 transitions, 5604 flow [2022-12-13 06:08:31,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 233 transitions, 5604 flow [2022-12-13 06:08:31,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-13 06:08:32,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [499] $Ultimate##0-->L826: Formula: (and (= v_~z$w_buff0~0_108 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|) (= v_~z$w_buff0~0_109 v_~z$w_buff1~0_103) (= v_~z$r_buff0_thd0~0_49 v_~z$r_buff1_thd0~0_42) (= v_~z$r_buff0_thd2~0_21 v_~z$r_buff1_thd2~0_19) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13| 0)) (= v_~z$r_buff0_thd4~0_112 1) (= v_~z$w_buff0_used~0_192 v_~z$w_buff1_used~0_168) (= v_~z$r_buff1_thd4~0_95 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_57) (= v_~z$w_buff0_used~0_191 1) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_191 256) 0)) (not (= (mod v_~z$w_buff1_used~0_168 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|) (= v_~z$r_buff0_thd1~0_21 v_~z$r_buff1_thd1~0_19)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_49, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_192, ~z$w_buff0~0=v_~z$w_buff0~0_109, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_191, ~z$w_buff0~0=v_~z$w_buff0~0_108, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_168, ~z$w_buff1~0=v_~z$w_buff1~0_103, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_49, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [482] $Ultimate##0-->L785: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_20 2) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_20, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-13 06:08:32,464 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:08:32,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 651 [2022-12-13 06:08:32,465 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 232 transitions, 5580 flow [2022-12-13 06:08:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:08:32,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:32,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:32,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:08:32,466 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1952354374, now seen corresponding path program 1 times [2022-12-13 06:08:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:32,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358381653] [2022-12-13 06:08:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:32,630 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:08:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:32,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358381653] [2022-12-13 06:08:32,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358381653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:32,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:32,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:08:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74117471] [2022-12-13 06:08:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:08:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:08:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:08:32,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2022-12-13 06:08:32,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 232 transitions, 5580 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08:32,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:32,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2022-12-13 06:08:32,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:33,401 INFO L130 PetriNetUnfolder]: 4192/6718 cut-off events. [2022-12-13 06:08:33,401 INFO L131 PetriNetUnfolder]: For 47112/48253 co-relation queries the response was YES. [2022-12-13 06:08:33,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76357 conditions, 6718 events. 4192/6718 cut-off events. For 47112/48253 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 44110 event pairs, 0 based on Foata normal form. 311/5314 useless extension candidates. Maximal degree in co-relation 76309. Up to 6169 conditions per place. [2022-12-13 06:08:33,436 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 121 selfloop transitions, 7 changer transitions 125/272 dead transitions. [2022-12-13 06:08:33,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 272 transitions, 7124 flow [2022-12-13 06:08:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:08:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:08:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 06:08:33,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-13 06:08:33,438 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2022-12-13 06:08:33,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 272 transitions, 7124 flow [2022-12-13 06:08:33,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 147 transitions, 3704 flow [2022-12-13 06:08:33,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:33,526 INFO L89 Accepts]: Start accepts. Operand has 86 places, 147 transitions, 3704 flow [2022-12-13 06:08:33,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:33,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:33,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 147 transitions, 3704 flow [2022-12-13 06:08:33,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 147 transitions, 3704 flow [2022-12-13 06:08:33,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 06:08:33,646 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:08:33,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 06:08:33,647 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 147 transitions, 3704 flow [2022-12-13 06:08:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08:33,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:33,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 06:08:33,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1305828845, now seen corresponding path program 1 times [2022-12-13 06:08:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733771813] [2022-12-13 06:08:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:08:34,312 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:08:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:08:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733771813] [2022-12-13 06:08:34,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733771813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:08:34,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:08:34,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:08:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003528797] [2022-12-13 06:08:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:08:34,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:08:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:08:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:08:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:08:34,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2022-12-13 06:08:34,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 147 transitions, 3704 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:08:34,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:08:34,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2022-12-13 06:08:34,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:08:34,778 INFO L130 PetriNetUnfolder]: 2197/3502 cut-off events. [2022-12-13 06:08:34,778 INFO L131 PetriNetUnfolder]: For 23676/23924 co-relation queries the response was YES. [2022-12-13 06:08:34,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42739 conditions, 3502 events. 2197/3502 cut-off events. For 23676/23924 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 19338 event pairs, 0 based on Foata normal form. 101/2625 useless extension candidates. Maximal degree in co-relation 42688. Up to 3334 conditions per place. [2022-12-13 06:08:34,796 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 78 selfloop transitions, 5 changer transitions 132/237 dead transitions. [2022-12-13 06:08:34,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 237 transitions, 6652 flow [2022-12-13 06:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:08:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:08:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 06:08:34,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-13 06:08:34,798 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2022-12-13 06:08:34,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 237 transitions, 6652 flow [2022-12-13 06:08:34,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 105 transitions, 2720 flow [2022-12-13 06:08:34,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:08:34,839 INFO L89 Accepts]: Start accepts. Operand has 88 places, 105 transitions, 2720 flow [2022-12-13 06:08:34,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:08:34,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:08:34,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 105 transitions, 2720 flow [2022-12-13 06:08:34,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 105 transitions, 2720 flow [2022-12-13 06:08:34,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 06:08:35,335 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 06:08:35,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-13 06:08:35,336 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 2708 flow [2022-12-13 06:08:35,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:08:35,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:08:35,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 06:08:35,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:08:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:08:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -220925164, now seen corresponding path program 1 times [2022-12-13 06:08:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:08:35,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953025789] [2022-12-13 06:08:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:08:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:08:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:08:35,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:08:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:08:35,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:08:35,449 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:08:35,449 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 06:08:35,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 06:08:35,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 06:08:35,452 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:08:35,457 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:08:35,457 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:08:35,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:08:35 BasicIcfg [2022-12-13 06:08:35,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:08:35,560 INFO L158 Benchmark]: Toolchain (without parser) took 58422.87ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 172.9MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 06:08:35,561 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:08:35,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.69ms. Allocated memory is still 197.1MB. Free memory was 172.9MB in the beginning and 144.2MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 06:08:35,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.06ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 141.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:35,563 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 197.1MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:35,563 INFO L158 Benchmark]: RCFGBuilder took 789.78ms. Allocated memory is still 197.1MB. Free memory was 139.3MB in the beginning and 145.8MB in the end (delta: -6.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 06:08:35,563 INFO L158 Benchmark]: TraceAbstraction took 56976.52ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 144.8MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 06:08:35,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.69ms. Allocated memory is still 197.1MB. Free memory was 172.9MB in the beginning and 144.2MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.06ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 141.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 197.1MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 789.78ms. Allocated memory is still 197.1MB. Free memory was 139.3MB in the beginning and 145.8MB in the end (delta: -6.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 56976.52ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 144.8MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 137 PlacesBefore, 79 PlacesAfterwards, 126 TransitionsBefore, 67 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4702, independent: 4550, independent conditional: 4550, independent unconditional: 0, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4702, independent: 4550, independent conditional: 0, independent unconditional: 4550, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4702, independent: 4550, independent conditional: 0, independent unconditional: 4550, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4702, independent: 4550, independent conditional: 0, independent unconditional: 4550, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2579, independent: 2522, independent conditional: 0, independent unconditional: 2522, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2579, independent: 2495, independent conditional: 0, independent unconditional: 2495, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4702, independent: 2028, independent conditional: 0, independent unconditional: 2028, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 2579, unknown conditional: 0, unknown unconditional: 2579] , Statistics on independence cache: Total cache size (in pairs): 4970, Positive cache size: 4913, Positive conditional cache size: 0, Positive unconditional cache size: 4913, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, 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: 2.2s, 55 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 131, independent conditional: 76, independent unconditional: 55, dependent: 19, dependent conditional: 15, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 131, independent conditional: 2, independent unconditional: 129, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 131, independent conditional: 2, independent unconditional: 129, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 70, independent conditional: 2, independent unconditional: 68, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 79, unknown conditional: 2, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 970 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): 79, Positive cache size: 70, Positive conditional cache size: 2, Positive unconditional cache size: 68, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 58 PlacesBefore, 58 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 1172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 28, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 60 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 1388 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 62 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 1794 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 348 TransitionsBefore, 348 TransitionsAfterwards, 1840 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 451 TransitionsBefore, 451 TransitionsAfterwards, 2228 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 474 TransitionsBefore, 474 TransitionsAfterwards, 2228 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 603 TransitionsBefore, 603 TransitionsAfterwards, 2622 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 79 PlacesBefore, 78 PlacesAfterwards, 527 TransitionsBefore, 526 TransitionsAfterwards, 2326 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 570 TransitionsBefore, 570 TransitionsAfterwards, 2130 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): 93, Positive cache size: 84, Positive conditional cache size: 2, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 87 PlacesBefore, 86 PlacesAfterwards, 233 TransitionsBefore, 232 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 20, independent unconditional: 4, 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: 24, independent: 24, independent conditional: 3, independent unconditional: 21, 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: 24, independent: 24, independent conditional: 3, independent unconditional: 21, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 24, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 1, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 110, Positive conditional cache size: 3, Positive unconditional cache size: 107, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 86 PlacesBefore, 86 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 121, Positive conditional cache size: 3, Positive unconditional cache size: 118, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 88 PlacesBefore, 87 PlacesAfterwards, 105 TransitionsBefore, 104 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 2, independent unconditional: 22, 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: 24, independent: 24, independent conditional: 2, independent unconditional: 22, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 24, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 141, Positive conditional cache size: 4, Positive unconditional cache size: 137, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=-3, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=-2, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=-1, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 876]: 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: 872]: 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: 870]: 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: 874]: 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 9 procedures, 165 locations, 7 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: 56.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1462 IncrementalHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 40 mSDtfsCounter, 1462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13220occurred in iteration=11, InterpolantAutomatonStates: 67, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:08:35,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...