/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:08:06,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:08:06,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:08:06,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:08:06,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:08:06,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:08:06,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:08:06,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:08:06,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:08:06,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:08:06,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:08:06,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:08:06,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:08:06,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:08:06,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:08:06,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:08:06,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:08:06,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:08:06,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:08:06,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:08:06,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:08:06,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:08:06,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:08:06,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:08:06,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:08:06,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:08:06,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:08:06,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:08:06,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:08:06,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:08:06,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:08:06,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:08:06,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:08:06,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:08:06,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:08:06,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:08:06,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:08:06,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:08:06,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:08:06,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:08:06,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:08:06,663 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-05 23:08:06,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:08:06,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:08:06,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:08:06,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:08:06,688 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:08:06,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:08:06,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:08:06,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:08:06,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:08:06,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:06,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:08:06,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:08:06,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:08:06,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:08:06,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:08:06,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:08:06,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:08:06,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:08:06,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:08:06,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:08:06,943 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:08:06,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:08:07,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:08:08,006 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:08:08,007 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:08:08,016 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce6023d4/c6649ba0362e47e2a33bb55f01e7b6a3/FLAG105823edc [2022-12-05 23:08:08,025 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce6023d4/c6649ba0362e47e2a33bb55f01e7b6a3 [2022-12-05 23:08:08,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:08:08,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:08:08,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:08,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:08:08,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:08:08,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77943165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08, skipping insertion in model container [2022-12-05 23:08:08,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:08:08,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:08:08,192 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 23:08:08,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:08,296 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:08:08,303 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 23:08:08,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:08,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:08,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:08,374 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:08:08,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08 WrapperNode [2022-12-05 23:08:08,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:08,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:08,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:08:08,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:08:08,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,423 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-05 23:08:08,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:08,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:08:08,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:08:08,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:08:08,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:08:08,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:08:08,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:08:08,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:08:08,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (1/1) ... [2022-12-05 23:08:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:08:08,493 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-05 23:08:08,509 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-05 23:08:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:08:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:08:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:08:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:08:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:08:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:08:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:08:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:08:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:08:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:08:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:08:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:08:08,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:08:08,528 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:08:08,648 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:08:08,649 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:08:08,885 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:08:09,023 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:08:09,023 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:08:09,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:09 BoogieIcfgContainer [2022-12-05 23:08:09,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:08:09,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:08:09,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:08:09,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:08:09,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:08:08" (1/3) ... [2022-12-05 23:08:09,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ef7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:09, skipping insertion in model container [2022-12-05 23:08:09,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:08" (2/3) ... [2022-12-05 23:08:09,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ef7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:09, skipping insertion in model container [2022-12-05 23:08:09,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:09" (3/3) ... [2022-12-05 23:08:09,031 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:08:09,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:08:09,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:08:09,043 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:08:09,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:08:09,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 23:08:09,128 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 23:08:09,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:09,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:08:09,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 23:08:09,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:09,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:09,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:09,178 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 23:08:09,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:09,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:08:09,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:09,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-05 23:08:13,123 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-05 23:08:13,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:08:13,139 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;@64369781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:08:13,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:08:13,141 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:08:13,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:13,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:13,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:08:13,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash 394395427, now seen corresponding path program 1 times [2022-12-05 23:08:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:13,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931717608] [2022-12-05 23:08:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:13,402 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-05 23:08:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:13,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931717608] [2022-12-05 23:08:13,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931717608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:13,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:13,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48285842] [2022-12-05 23:08:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:13,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:08:13,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:13,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:13,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:08:13,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:13,537 INFO L130 PetriNetUnfolder]: 173/328 cut-off events. [2022-12-05 23:08:13,537 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:08:13,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1397 event pairs, 21 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2022-12-05 23:08:13,541 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-05 23:08:13,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-05 23:08:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:08:13,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:08:13,551 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:08:13,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-05 23:08:13,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:13,555 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-05 23:08:13,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-05 23:08:13,561 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:08:13,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:13,562 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-05 23:08:13,563 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:13,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:13,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-05 23:08:13,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-05 23:08:13,569 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 23:08:13,569 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:13,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:08:13,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-05 23:08:13,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:08:13,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:13,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-05 23:08:13,721 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 23:08:13,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:13,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:13,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:13,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:08:13,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1056924342, now seen corresponding path program 1 times [2022-12-05 23:08:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:13,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385484296] [2022-12-05 23:08:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:14,175 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-05 23:08:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:14,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385484296] [2022-12-05 23:08:14,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385484296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:14,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:14,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65267026] [2022-12-05 23:08:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:14,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:14,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:14,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:08:14,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:08:14,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:14,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:08:14,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:14,245 INFO L130 PetriNetUnfolder]: 135/241 cut-off events. [2022-12-05 23:08:14,245 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:08:14,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 241 events. 135/241 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 795 event pairs, 31 based on Foata normal form. 5/246 useless extension candidates. Maximal degree in co-relation 503. Up to 200 conditions per place. [2022-12-05 23:08:14,251 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-05 23:08:14,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 92 flow [2022-12-05 23:08:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-05 23:08:14,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-05 23:08:14,253 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 22 transitions. [2022-12-05 23:08:14,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 92 flow [2022-12-05 23:08:14,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:14,255 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-05 23:08:14,256 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-05 23:08:14,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:14,256 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,257 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:14,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:14,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,261 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:08:14,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:14,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:14,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-05 23:08:14,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:14,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 23:08:14,272 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-05 23:08:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:08:14,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:14,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:08:14,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1595082806, now seen corresponding path program 1 times [2022-12-05 23:08:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100757189] [2022-12-05 23:08:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:14,634 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-05 23:08:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100757189] [2022-12-05 23:08:14,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100757189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:14,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:14,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405150487] [2022-12-05 23:08:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:14,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:14,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:08:14,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:14,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:14,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:08:14,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:14,703 INFO L130 PetriNetUnfolder]: 100/199 cut-off events. [2022-12-05 23:08:14,703 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 23:08:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 199 events. 100/199 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 686 event pairs, 36 based on Foata normal form. 2/201 useless extension candidates. Maximal degree in co-relation 432. Up to 157 conditions per place. [2022-12-05 23:08:14,705 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-12-05 23:08:14,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 123 flow [2022-12-05 23:08:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-05 23:08:14,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 23:08:14,711 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 31 transitions. [2022-12-05 23:08:14,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 123 flow [2022-12-05 23:08:14,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:14,712 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2022-12-05 23:08:14,713 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-05 23:08:14,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:14,713 INFO L89 Accepts]: Start accepts. Operand has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,714 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:14,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:14,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,718 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-05 23:08:14,719 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-05 23:08:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2022-12-05 23:08:14,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 23:08:14,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:14,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-05 23:08:14,763 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 71 flow [2022-12-05 23:08:14,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:14,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:14,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:14,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:08:14,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 14029158, now seen corresponding path program 1 times [2022-12-05 23:08:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:14,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960281387] [2022-12-05 23:08:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:14,994 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-05 23:08:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:14,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960281387] [2022-12-05 23:08:14,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960281387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:14,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:14,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:14,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094907771] [2022-12-05 23:08:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:14,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:08:14,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:14,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:14,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:08:14,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:15,085 INFO L130 PetriNetUnfolder]: 106/209 cut-off events. [2022-12-05 23:08:15,086 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-05 23:08:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 209 events. 106/209 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 735 event pairs, 19 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 524. Up to 148 conditions per place. [2022-12-05 23:08:15,087 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 23 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2022-12-05 23:08:15,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 174 flow [2022-12-05 23:08:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 23:08:15,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-05 23:08:15,089 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 71 flow. Second operand 5 states and 36 transitions. [2022-12-05 23:08:15,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 174 flow [2022-12-05 23:08:15,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:08:15,091 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 128 flow [2022-12-05 23:08:15,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-05 23:08:15,093 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-05 23:08:15,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:15,093 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 128 flow [2022-12-05 23:08:15,094 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:15,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:15,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 128 flow [2022-12-05 23:08:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 128 flow [2022-12-05 23:08:15,102 INFO L130 PetriNetUnfolder]: 22/63 cut-off events. [2022-12-05 23:08:15,102 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-12-05 23:08:15,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 63 events. 22/63 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 215 event pairs, 5 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 171. Up to 32 conditions per place. [2022-12-05 23:08:15,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 128 flow [2022-12-05 23:08:15,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-05 23:08:15,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [390] $Ultimate##0-->L775: Formula: (and (= v_~y$w_buff0_used~0_395 1) (= v_~y$r_buff0_thd0~0_257 v_~y$r_buff1_thd0~0_265) (= v_~z~0_28 v_~__unbuffered_p1_EAX~0_75) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y$r_buff0_thd2~0_124 1) (= v_~z~0_28 1) (= 2 v_~y$w_buff0~0_274) (= v_~y$w_buff1~0_237 v_~y$w_buff0~0_275) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_31| |v_P1Thread1of1ForFork1_~arg#1.offset_31|) (= v_~y$w_buff0_used~0_396 v_~y$w_buff1_used~0_342) (= v_~y$r_buff0_thd2~0_125 v_~y$r_buff1_thd2~0_99) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_31| |v_P1Thread1of1ForFork1_~arg#1.base_31|) (= v_~y$r_buff0_thd1~0_89 v_~y$r_buff1_thd1~0_94) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_342 256) 0)) (not (= (mod v_~y$w_buff0_used~0_395 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_396, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_257, ~y$w_buff0~0=v_~y$w_buff0~0_275, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_89, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_31|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_395, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_94, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_75, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1~0=v_~y$w_buff1~0_237, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_257, ~y$w_buff0~0=v_~y$w_buff0~0_274, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_89, ~z~0=v_~z~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_342} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:08:15,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [196] L810-->L816: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_36 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_74 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_66 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_35 (ite .cse2 v_~y$w_buff0~0_20 (ite .cse0 v_~y$w_buff1~0_15 v_~y~0_36))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_36) v_~y$r_buff1_thd0~0_35) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff0_used~0_73 (ite .cse2 0 v_~y$w_buff0_used~0_74))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_20, ~y~0=v_~y~0_36, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_20, ~y~0=v_~y~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:08:15,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L741-->L775: Formula: (and (= v_~y$r_buff0_thd2~0_187 v_~y$r_buff1_thd2~0_140) (= v_~y$r_buff0_thd2~0_186 1) (= v_~y~0_372 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_422 256) 0)) (not (= (mod v_~y$w_buff0_used~0_492 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|) (= v_~y$w_buff0_used~0_492 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_52| |v_P1Thread1of1ForFork1_~arg#1.base_52|) (= v_~z~0_49 v_~__unbuffered_p1_EAX~0_101) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|) (= v_~y$r_buff0_thd1~0_128 v_~y$r_buff1_thd1~0_136) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| 0)) (= v_~z~0_49 1) (= 2 v_~y$w_buff0~0_336) (= v_~y$w_buff0_used~0_493 v_~y$w_buff1_used~0_422) (= v_~y$r_buff0_thd0~0_303 v_~y$r_buff1_thd0~0_312) (= v_~y$w_buff1~0_287 v_~y$w_buff0~0_337) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_52| |v_P1Thread1of1ForFork1_~arg#1.offset_52|)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_493, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_337, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_187, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_128, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_52|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_52|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_140, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_101, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|, ~y$w_buff1~0=v_~y$w_buff1~0_287, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_336, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_186, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_128, ~z~0=v_~z~0_49, ~y~0=v_~y~0_372, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [284] L744-->L751: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_71 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_22) v_~y$r_buff0_thd1~0_21) (= v_~y$w_buff1_used~0_70 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_71)) (= (ite .cse2 v_~y$w_buff0~0_22 (ite .cse1 v_~y$w_buff1~0_17 v_~y~0_40)) v_~y~0_39) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse3) (and (not (= 0 (mod v_~y$r_buff0_thd1~0_21 256))) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_22, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, ~y~0=v_~y~0_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:08:15,524 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:15,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-05 23:08:15,525 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 143 flow [2022-12-05 23:08:15,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:15,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:15,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:08:15,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -553552108, now seen corresponding path program 1 times [2022-12-05 23:08:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:15,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183822035] [2022-12-05 23:08:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:15,869 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-05 23:08:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:15,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183822035] [2022-12-05 23:08:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183822035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:15,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:15,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401071556] [2022-12-05 23:08:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:15,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:15,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:15,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 23:08:15,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:15,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:15,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 23:08:15,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:15,958 INFO L130 PetriNetUnfolder]: 108/214 cut-off events. [2022-12-05 23:08:15,958 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-12-05 23:08:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 214 events. 108/214 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 817 event pairs, 28 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 696. Up to 125 conditions per place. [2022-12-05 23:08:15,960 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 25 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2022-12-05 23:08:15,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 253 flow [2022-12-05 23:08:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 23:08:15,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-05 23:08:15,961 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 143 flow. Second operand 4 states and 35 transitions. [2022-12-05 23:08:15,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 253 flow [2022-12-05 23:08:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 241 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:08:15,963 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-05 23:08:15,963 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2022-12-05 23:08:15,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:15,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,964 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:15,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:15,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,971 INFO L130 PetriNetUnfolder]: 19/63 cut-off events. [2022-12-05 23:08:15,971 INFO L131 PetriNetUnfolder]: For 147/154 co-relation queries the response was YES. [2022-12-05 23:08:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 63 events. 19/63 cut-off events. For 147/154 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 231 event pairs, 5 based on Foata normal form. 3/63 useless extension candidates. Maximal degree in co-relation 207. Up to 30 conditions per place. [2022-12-05 23:08:15,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:08:15,973 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:15,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:08:15,974 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 174 flow [2022-12-05 23:08:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:15,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:15,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:15,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:08:15,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -553733365, now seen corresponding path program 1 times [2022-12-05 23:08:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:15,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320305367] [2022-12-05 23:08:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:16,234 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-05 23:08:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:16,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320305367] [2022-12-05 23:08:16,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320305367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:16,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:16,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340334762] [2022-12-05 23:08:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:16,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:16,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 23:08:16,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:16,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:16,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 23:08:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:16,314 INFO L130 PetriNetUnfolder]: 96/186 cut-off events. [2022-12-05 23:08:16,314 INFO L131 PetriNetUnfolder]: For 356/356 co-relation queries the response was YES. [2022-12-05 23:08:16,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 186 events. 96/186 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 664 event pairs, 27 based on Foata normal form. 3/189 useless extension candidates. Maximal degree in co-relation 654. Up to 153 conditions per place. [2022-12-05 23:08:16,316 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 24 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2022-12-05 23:08:16,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 280 flow [2022-12-05 23:08:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 23:08:16,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2022-12-05 23:08:16,317 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 174 flow. Second operand 5 states and 34 transitions. [2022-12-05 23:08:16,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 280 flow [2022-12-05 23:08:16,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 248 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:16,319 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-05 23:08:16,319 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-05 23:08:16,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:16,319 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,320 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:16,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:16,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,357 INFO L130 PetriNetUnfolder]: 23/77 cut-off events. [2022-12-05 23:08:16,358 INFO L131 PetriNetUnfolder]: For 108/113 co-relation queries the response was YES. [2022-12-05 23:08:16,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 77 events. 23/77 cut-off events. For 108/113 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 313 event pairs, 4 based on Foata normal form. 4/79 useless extension candidates. Maximal degree in co-relation 247. Up to 39 conditions per place. [2022-12-05 23:08:16,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:08:16,361 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:16,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-05 23:08:16,362 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 200 flow [2022-12-05 23:08:16,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:16,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:16,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:16,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:08:16,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -553174435, now seen corresponding path program 2 times [2022-12-05 23:08:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207153402] [2022-12-05 23:08:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:16,600 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-05 23:08:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:16,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207153402] [2022-12-05 23:08:16,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207153402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:16,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:16,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520458013] [2022-12-05 23:08:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:16,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:16,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:16,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:16,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:16,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:16,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:16,657 INFO L130 PetriNetUnfolder]: 97/189 cut-off events. [2022-12-05 23:08:16,657 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-05 23:08:16,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 189 events. 97/189 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 656 event pairs, 15 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 717. Up to 127 conditions per place. [2022-12-05 23:08:16,658 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2022-12-05 23:08:16,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 312 flow [2022-12-05 23:08:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:08:16,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:08:16,659 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 200 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:08:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 312 flow [2022-12-05 23:08:16,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 290 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:16,661 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-05 23:08:16,662 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-05 23:08:16,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:16,662 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,662 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:16,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:16,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,670 INFO L130 PetriNetUnfolder]: 20/72 cut-off events. [2022-12-05 23:08:16,670 INFO L131 PetriNetUnfolder]: For 168/170 co-relation queries the response was YES. [2022-12-05 23:08:16,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 72 events. 20/72 cut-off events. For 168/170 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 290 event pairs, 4 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 248. Up to 35 conditions per place. [2022-12-05 23:08:16,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:08:16,672 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:16,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:08:16,672 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 229 flow [2022-12-05 23:08:16,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:16,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:16,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:16,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:08:16,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 28688810, now seen corresponding path program 1 times [2022-12-05 23:08:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:16,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648085351] [2022-12-05 23:08:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:17,054 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-05 23:08:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:17,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648085351] [2022-12-05 23:08:17,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648085351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:17,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034182924] [2022-12-05 23:08:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:17,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:17,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:17,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:17,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:17,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:17,131 INFO L130 PetriNetUnfolder]: 94/184 cut-off events. [2022-12-05 23:08:17,131 INFO L131 PetriNetUnfolder]: For 471/471 co-relation queries the response was YES. [2022-12-05 23:08:17,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 184 events. 94/184 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 635 event pairs, 16 based on Foata normal form. 2/180 useless extension candidates. Maximal degree in co-relation 721. Up to 112 conditions per place. [2022-12-05 23:08:17,133 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2022-12-05 23:08:17,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 329 flow [2022-12-05 23:08:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-05 23:08:17,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 23:08:17,134 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 229 flow. Second operand 4 states and 32 transitions. [2022-12-05 23:08:17,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 329 flow [2022-12-05 23:08:17,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:17,135 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-05 23:08:17,136 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2022-12-05 23:08:17,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:17,136 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,137 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:17,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:17,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,144 INFO L130 PetriNetUnfolder]: 19/70 cut-off events. [2022-12-05 23:08:17,144 INFO L131 PetriNetUnfolder]: For 249/251 co-relation queries the response was YES. [2022-12-05 23:08:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 70 events. 19/70 cut-off events. For 249/251 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 284 event pairs, 4 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 259. Up to 33 conditions per place. [2022-12-05 23:08:17,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:08:17,146 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:17,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:08:17,146 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 253 flow [2022-12-05 23:08:17,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:17,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:17,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:08:17,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash 851416923, now seen corresponding path program 1 times [2022-12-05 23:08:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841046695] [2022-12-05 23:08:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:17,521 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-05 23:08:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841046695] [2022-12-05 23:08:17,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841046695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:17,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:17,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:17,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523313205] [2022-12-05 23:08:17,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:17,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:08:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:08:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:08:17,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:17,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:17,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:17,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:17,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:17,593 INFO L130 PetriNetUnfolder]: 86/173 cut-off events. [2022-12-05 23:08:17,594 INFO L131 PetriNetUnfolder]: For 599/599 co-relation queries the response was YES. [2022-12-05 23:08:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 173 events. 86/173 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 601 event pairs, 33 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 714. Up to 155 conditions per place. [2022-12-05 23:08:17,595 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 26 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-05 23:08:17,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 329 flow [2022-12-05 23:08:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 23:08:17,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-05 23:08:17,596 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 253 flow. Second operand 4 states and 29 transitions. [2022-12-05 23:08:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 329 flow [2022-12-05 23:08:17,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 303 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:17,597 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-05 23:08:17,598 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-05 23:08:17,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:17,598 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,599 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:17,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:17,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,606 INFO L130 PetriNetUnfolder]: 18/71 cut-off events. [2022-12-05 23:08:17,607 INFO L131 PetriNetUnfolder]: For 195/198 co-relation queries the response was YES. [2022-12-05 23:08:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 71 events. 18/71 cut-off events. For 195/198 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 287 event pairs, 3 based on Foata normal form. 3/73 useless extension candidates. Maximal degree in co-relation 249. Up to 32 conditions per place. [2022-12-05 23:08:17,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:08:17,608 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:17,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:08:17,609 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 246 flow [2022-12-05 23:08:17,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:17,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:17,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:17,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:08:17,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash 773148123, now seen corresponding path program 2 times [2022-12-05 23:08:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:17,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466407477] [2022-12-05 23:08:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:17,993 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-05 23:08:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:17,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466407477] [2022-12-05 23:08:17,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466407477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:17,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:17,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17270681] [2022-12-05 23:08:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:17,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:17,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:17,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:17,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:17,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:17,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:18,064 INFO L130 PetriNetUnfolder]: 66/144 cut-off events. [2022-12-05 23:08:18,064 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-05 23:08:18,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 144 events. 66/144 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 488 event pairs, 26 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 584. Up to 112 conditions per place. [2022-12-05 23:08:18,065 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 24 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2022-12-05 23:08:18,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 361 flow [2022-12-05 23:08:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-05 23:08:18,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 23:08:18,067 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 246 flow. Second operand 5 states and 39 transitions. [2022-12-05 23:08:18,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 361 flow [2022-12-05 23:08:18,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 347 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:18,068 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-05 23:08:18,069 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2022-12-05 23:08:18,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:18,069 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,069 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:18,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:18,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,079 INFO L130 PetriNetUnfolder]: 30/88 cut-off events. [2022-12-05 23:08:18,079 INFO L131 PetriNetUnfolder]: For 358/361 co-relation queries the response was YES. [2022-12-05 23:08:18,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 88 events. 30/88 cut-off events. For 358/361 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 315 event pairs, 6 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 360. Up to 37 conditions per place. [2022-12-05 23:08:18,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-05 23:08:18,080 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:18,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 23:08:18,081 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 316 flow [2022-12-05 23:08:18,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:18,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:18,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:18,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:08:18,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 896978396, now seen corresponding path program 1 times [2022-12-05 23:08:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363183150] [2022-12-05 23:08:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:18,434 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-05 23:08:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363183150] [2022-12-05 23:08:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363183150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:18,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246665190] [2022-12-05 23:08:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:18,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:18,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 316 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:18,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:18,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:18,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:18,556 INFO L130 PetriNetUnfolder]: 114/236 cut-off events. [2022-12-05 23:08:18,556 INFO L131 PetriNetUnfolder]: For 903/903 co-relation queries the response was YES. [2022-12-05 23:08:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 236 events. 114/236 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 900 event pairs, 28 based on Foata normal form. 7/243 useless extension candidates. Maximal degree in co-relation 1092. Up to 119 conditions per place. [2022-12-05 23:08:18,557 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 24 selfloop transitions, 3 changer transitions 36/63 dead transitions. [2022-12-05 23:08:18,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 654 flow [2022-12-05 23:08:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-05 23:08:18,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-05 23:08:18,558 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 316 flow. Second operand 6 states and 39 transitions. [2022-12-05 23:08:18,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 654 flow [2022-12-05 23:08:18,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 614 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:18,560 INFO L231 Difference]: Finished difference. Result has 50 places, 22 transitions, 169 flow [2022-12-05 23:08:18,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=22} [2022-12-05 23:08:18,561 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2022-12-05 23:08:18,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:18,561 INFO L89 Accepts]: Start accepts. Operand has 50 places, 22 transitions, 169 flow [2022-12-05 23:08:18,561 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:18,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:18,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 22 transitions, 169 flow [2022-12-05 23:08:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 22 transitions, 169 flow [2022-12-05 23:08:18,568 INFO L130 PetriNetUnfolder]: 19/65 cut-off events. [2022-12-05 23:08:18,568 INFO L131 PetriNetUnfolder]: For 167/167 co-relation queries the response was YES. [2022-12-05 23:08:18,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 65 events. 19/65 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 10 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 242. Up to 30 conditions per place. [2022-12-05 23:08:18,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 22 transitions, 169 flow [2022-12-05 23:08:18,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-05 23:08:18,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L778: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_510 256) 0)) (not (= (mod v_~y$w_buff1_used~0_436 256) 0)))) 1 0)) (= v_~z~0_53 v_~__unbuffered_p1_EAX~0_105) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_56| |v_P1Thread1of1ForFork1_~arg#1.base_56|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64| 0)) (= v_~z~0_53 1) (= v_~__unbuffered_p1_EBX~0_88 v_~x~0_41) (= v_~y$r_buff0_thd0~0_311 v_~y$r_buff1_thd0~0_320) (= 2 v_~y$w_buff0~0_348) (= v_~y$w_buff0_used~0_511 v_~y$w_buff1_used~0_436) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_56| |v_P1Thread1of1ForFork1_~arg#1.offset_56|) (= v_~y$w_buff0_used~0_510 1) (= v_~y$r_buff0_thd1~0_138 v_~y$r_buff1_thd1~0_146) (= v_~y$w_buff1~0_295 v_~y$w_buff0~0_349) (= v_~y$r_buff0_thd2~0_194 1) (= v_~y$r_buff0_thd2~0_195 v_~y$r_buff1_thd2~0_144)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_56|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_311, ~y$w_buff0~0=v_~y$w_buff0~0_349, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_195, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_138, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_56|} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_56|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_56|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_56|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_56|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64|, ~y$w_buff1~0=v_~y$w_buff1~0_295, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_311, ~y$w_buff0~0=v_~y$w_buff0~0_348, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_138, ~z~0=v_~z~0_53, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_320, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_436} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [400] $Ultimate##0-->L744: Formula: (and (= v_~y~0_398 1) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~y~0=v_~y~0_398, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:19,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->L744: Formula: (and (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_446 256) 0)) (not (= (mod v_~y$w_buff0_used~0_524 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|) (= v_~z~0_57 1) (= v_~y$r_buff0_thd2~0_205 v_~y$r_buff1_thd2~0_150) (= v_~y~0_400 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_60| |v_P1Thread1of1ForFork1_~arg#1.base_60|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|) (= v_~y$w_buff0_used~0_524 1) (= v_~x~0_51 1) (= v_~__unbuffered_p1_EBX~0_92 v_~x~0_52) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~z~0_57 v_~__unbuffered_p1_EAX~0_109) (= v_~y$r_buff0_thd0~0_315 v_~y$r_buff1_thd0~0_324) (= v_~y$w_buff1~0_301 v_~y$w_buff0~0_359) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_60| |v_P1Thread1of1ForFork1_~arg#1.offset_60|) (= v_~y$r_buff0_thd2~0_204 1) (= v_~y$r_buff0_thd1~0_146 v_~y$r_buff1_thd1~0_154) (= 2 v_~y$w_buff0~0_358) (= v_~y$w_buff0_used~0_525 v_~y$w_buff1_used~0_446)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_60|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_525, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_315, ~y$w_buff0~0=v_~y$w_buff0~0_359, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_146, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x~0=v_~x~0_52, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_60|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_60|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_524, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_60|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_154, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_109, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|, ~y$w_buff0~0=v_~y$w_buff0~0_358, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_146, ~y~0=v_~y~0_400, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_60|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_150, ~y$w_buff1~0=v_~y$w_buff1~0_301, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_315, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_204, ~z~0=v_~z~0_57, ~x~0=v_~x~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_324, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_446} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_59 (ite .cse0 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_29 v_~y~0_60))) (= v_~y$w_buff1_used~0_90 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_90 256) 0)))) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:08:19,489 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:08:19,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 928 [2022-12-05 23:08:19,489 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 181 flow [2022-12-05 23:08:19,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:19,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:19,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:08:19,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2110735611, now seen corresponding path program 1 times [2022-12-05 23:08:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431277067] [2022-12-05 23:08:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:19,578 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-05 23:08:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:19,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431277067] [2022-12-05 23:08:19,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431277067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:19,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:19,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945768752] [2022-12-05 23:08:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:19,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:08:19,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 18 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:08:19,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:19,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:08:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:19,613 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2022-12-05 23:08:19,613 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-05 23:08:19,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 25 events. 7/25 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 34 event pairs, 0 based on Foata normal form. 8/33 useless extension candidates. Maximal degree in co-relation 135. Up to 12 conditions per place. [2022-12-05 23:08:19,614 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 15 selfloop transitions, 7 changer transitions 0/22 dead transitions. [2022-12-05 23:08:19,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 22 transitions, 254 flow [2022-12-05 23:08:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-05 23:08:19,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2022-12-05 23:08:19,615 INFO L175 Difference]: Start difference. First operand has 39 places, 18 transitions, 181 flow. Second operand 4 states and 23 transitions. [2022-12-05 23:08:19,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 22 transitions, 254 flow [2022-12-05 23:08:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 132 flow, removed 43 selfloop flow, removed 16 redundant places. [2022-12-05 23:08:19,616 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 111 flow [2022-12-05 23:08:19,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-05 23:08:19,616 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-05 23:08:19,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:19,616 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 111 flow [2022-12-05 23:08:19,616 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:19,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:19,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 111 flow [2022-12-05 23:08:19,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 20 transitions, 111 flow [2022-12-05 23:08:19,620 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-05 23:08:19,620 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:08:19,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 24 events. 6/24 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 35 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 69. Up to 13 conditions per place. [2022-12-05 23:08:19,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 111 flow [2022-12-05 23:08:19,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-05 23:08:20,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] $Ultimate##0-->L751: Formula: (let ((.cse2 (not (= 0 (mod v_~y$w_buff0_used~0_534 256)))) (.cse1 (not (= (mod v_~y$r_buff0_thd1~0_151 256) 0))) (.cse0 (= (mod v_~y$w_buff0_used~0_536 256) 0))) (let ((.cse3 (and .cse1 (not .cse0))) (.cse4 (and .cse1 .cse2))) (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_72| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_72|) (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_72| (ite .cse0 1 0)) (= (ite .cse1 0 1) v_~y$w_buff0_used~0_534) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_452 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd1~0_150 256) 0)))) 0 v_~y$r_buff0_thd1~0_151) v_~y$r_buff1_thd1~0_158) (= v_~__unbuffered_p1_EBX~0_96 v_~x~0_60) (= v_~y$w_buff1_used~0_452 (ite (or .cse3 .cse4) 0 v_~y$w_buff0_used~0_536)) (= v_~y$w_buff1~0_305 v_~y$w_buff0~0_367) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_72| 0)) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= 2 v_~y$w_buff0~0_366) (= v_~z~0_61 v_~__unbuffered_p1_EAX~0_113) (= v_~z~0_61 1) (= v_~y$r_buff0_thd0~0_319 v_~y$r_buff1_thd0~0_328) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_64| |v_P1Thread1of1ForFork1_~arg#1.base_64|) (= v_~y$r_buff0_thd2~0_215 v_~y$r_buff1_thd2~0_156) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_64| |v_P1Thread1of1ForFork1_~arg#1.offset_64|) (= v_~y~0_406 (ite .cse1 v_~y$w_buff0~0_366 (ite .cse3 v_~y$w_buff1~0_305 1))) (= v_~y$r_buff0_thd2~0_214 1) (= v_~x~0_59 1) (= v_~y$r_buff0_thd1~0_150 (ite .cse4 0 v_~y$r_buff0_thd1~0_151))))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_64|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_536, ~y$w_buff0~0=v_~y$w_buff0~0_367, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_319, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_215, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x~0=v_~x~0_60, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_64|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_64|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_534, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_64|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_64|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_158, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_113, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_72|, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y~0=v_~y~0_406, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_64|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_72|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_305, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_319, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_214, ~z~0=v_~z~0_61, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_328, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_452} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_59 (ite .cse0 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_29 v_~y~0_60))) (= v_~y$w_buff1_used~0_90 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_90 256) 0)))) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:08:20,621 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:08:20,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1005 [2022-12-05 23:08:20,621 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 105 flow [2022-12-05 23:08:20,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:08:20,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:20,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:20,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:08:20,622 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1594264961, now seen corresponding path program 1 times [2022-12-05 23:08:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:20,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685371075] [2022-12-05 23:08:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:20,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:08:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:20,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:08:20,708 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:08:20,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:08:20,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:08:20,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:08:20,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:08:20,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:08:20,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:08:20,710 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:20,719 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:08:20,719 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:08:20,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:08:20 BasicIcfg [2022-12-05 23:08:20,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:08:20,764 INFO L158 Benchmark]: Toolchain (without parser) took 12735.34ms. Allocated memory was 215.0MB in the beginning and 482.3MB in the end (delta: 267.4MB). Free memory was 188.8MB in the beginning and 368.2MB in the end (delta: -179.4MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,764 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 95.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:20,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.78ms. Allocated memory is still 215.0MB. Free memory was 188.8MB in the beginning and 163.2MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.85ms. Allocated memory is still 215.0MB. Free memory was 163.2MB in the beginning and 160.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,765 INFO L158 Benchmark]: Boogie Preprocessor took 27.71ms. Allocated memory is still 215.0MB. Free memory was 160.7MB in the beginning and 159.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,765 INFO L158 Benchmark]: RCFGBuilder took 572.46ms. Allocated memory is still 215.0MB. Free memory was 159.0MB in the beginning and 183.9MB in the end (delta: -24.9MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,765 INFO L158 Benchmark]: TraceAbstraction took 11738.15ms. Allocated memory was 215.0MB in the beginning and 482.3MB in the end (delta: 267.4MB). Free memory was 183.4MB in the beginning and 368.2MB in the end (delta: -184.8MB). Peak memory consumption was 83.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:20,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 95.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 343.78ms. Allocated memory is still 215.0MB. Free memory was 188.8MB in the beginning and 163.2MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.85ms. Allocated memory is still 215.0MB. Free memory was 163.2MB in the beginning and 160.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.71ms. Allocated memory is still 215.0MB. Free memory was 160.7MB in the beginning and 159.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.46ms. Allocated memory is still 215.0MB. Free memory was 159.0MB in the beginning and 183.9MB in the end (delta: -24.9MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11738.15ms. Allocated memory was 215.0MB in the beginning and 482.3MB in the end (delta: 267.4MB). Free memory was 183.4MB in the beginning and 368.2MB in the end (delta: -184.8MB). Peak memory consumption was 83.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 769, independent: 733, independent conditional: 0, independent unconditional: 733, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 769, independent: 719, independent conditional: 0, independent unconditional: 719, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 218, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 967, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 769, unknown conditional: 0, unknown unconditional: 769] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1127, Positive conditional cache size: 0, Positive unconditional cache size: 1127, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 14, independent unconditional: 37, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 53, dependent conditional: 31, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 68, unknown conditional: 21, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 51, Positive conditional cache size: 14, Positive unconditional cache size: 37, Negative cache size: 17, Negative conditional cache size: 7, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 5, independent unconditional: 27, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 59, Positive conditional cache size: 14, Positive unconditional cache size: 45, Negative cache size: 19, Negative conditional cache size: 7, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 64, Positive conditional cache size: 14, Positive unconditional cache size: 50, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 32 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 145, independent conditional: 59, independent unconditional: 86, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 145, independent conditional: 37, independent unconditional: 108, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 145, independent conditional: 37, independent unconditional: 108, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 144, independent conditional: 36, independent unconditional: 108, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 76, Positive conditional cache size: 15, Positive unconditional cache size: 61, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 63, independent conditional: 20, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 63, independent conditional: 20, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 63, independent conditional: 20, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 61, independent conditional: 20, independent unconditional: 41, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 78, Positive conditional cache size: 15, Positive unconditional cache size: 63, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 26, independent unconditional: 37, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 63, independent conditional: 25, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 25, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 57, independent conditional: 23, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 84, Positive conditional cache size: 17, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 17, independent unconditional: 30, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 47, independent conditional: 16, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 47, independent conditional: 16, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 67, independent: 47, independent conditional: 16, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 84, Positive conditional cache size: 17, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 27, independent unconditional: 30, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 57, independent conditional: 26, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 26, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 55, independent conditional: 24, independent unconditional: 31, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 86, Positive conditional cache size: 19, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 20, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 57, independent conditional: 20, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 20, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 77, independent: 57, independent conditional: 20, independent unconditional: 37, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 86, Positive conditional cache size: 19, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 47, independent conditional: 18, independent unconditional: 29, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 47, independent conditional: 18, independent unconditional: 29, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 47, independent conditional: 18, independent unconditional: 29, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 45, independent conditional: 18, independent unconditional: 27, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 88, Positive conditional cache size: 19, Positive unconditional cache size: 69, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 45 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 18 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 4, independent unconditional: 13, 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: 17, independent: 17, independent conditional: 4, independent unconditional: 13, 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: 17, independent: 17, independent conditional: 4, independent unconditional: 13, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 139, Positive conditional cache size: 31, Positive unconditional cache size: 108, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 28 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 148, Positive conditional cache size: 32, Positive unconditional cache size: 116, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 __unbuffered_p1_EBX = x [L740] 2 x = 1 [L743] 2 y = 1 [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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 5 procedures, 111 locations, 5 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: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 14 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=10, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-05 23:08:20,802 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...