/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:34:24,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:34:24,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:34:24,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:34:24,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:34:24,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:34:24,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:34:24,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:34:24,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:34:24,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:34:24,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:34:24,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:34:24,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:34:24,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:34:24,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:34:24,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:34:24,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:34:24,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:34:24,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:34:24,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:34:24,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:34:24,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:34:24,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:34:24,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:34:24,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:34:24,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:34:24,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:34:24,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:34:24,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:34:24,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:34:24,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:34:24,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:34:24,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:34:24,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:34:24,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:34:24,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:34:24,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:34:24,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:34:24,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:34:24,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:34:24,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:34:24,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:34:24,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:34:24,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:34:24,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:34:24,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:34:24,642 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:34:24,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:34:24,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:34:24,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:34:24,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:34:24,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:34:24,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:34:24,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:34:24,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:34:24,644 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:34:24,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:34:24,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:34:24,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:34:24,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:34:24,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:34:24,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:34:24,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:34:24,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:34:24,978 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:34:24,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 06:34:25,958 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:34:26,258 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:34:26,258 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 06:34:26,297 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04acd5503/d91a78292f8c45a9864d31b46ff0b648/FLAG163f19147 [2022-12-06 06:34:26,313 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04acd5503/d91a78292f8c45a9864d31b46ff0b648 [2022-12-06 06:34:26,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:34:26,316 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:34:26,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:34:26,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:34:26,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:34:26,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551a909f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26, skipping insertion in model container [2022-12-06 06:34:26,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:34:26,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:34:26,478 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/safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 06:34:26,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:34:26,608 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:34:26,619 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/safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 06:34:26,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:34:26,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:34:26,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:34:26,684 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:34:26,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26 WrapperNode [2022-12-06 06:34:26,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:34:26,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:34:26,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:34:26,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:34:26,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,718 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-06 06:34:26,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:34:26,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:34:26,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:34:26,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:34:26,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:34:26,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:34:26,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:34:26,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:34:26,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (1/1) ... [2022-12-06 06:34:26,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:34:26,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:34:26,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:34:26,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:34:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:34:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:34:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:34:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:34:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:34:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:34:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:34:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:34:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:34:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:34:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:34:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:34:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:34:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:34:26,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:34:26,830 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:34:26,978 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:34:26,979 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:34:27,124 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:34:27,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:34:27,129 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:34:27,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:34:27 BoogieIcfgContainer [2022-12-06 06:34:27,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:34:27,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:34:27,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:34:27,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:34:27,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:34:26" (1/3) ... [2022-12-06 06:34:27,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303d59e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:34:27, skipping insertion in model container [2022-12-06 06:34:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:34:26" (2/3) ... [2022-12-06 06:34:27,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303d59e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:34:27, skipping insertion in model container [2022-12-06 06:34:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:34:27" (3/3) ... [2022-12-06 06:34:27,136 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 06:34:27,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:34:27,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:34:27,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:34:27,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:34:27,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 06:34:27,268 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-06 06:34:27,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:27,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-06 06:34:27,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 06:34:27,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-06 06:34:27,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:27,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 06:34:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-06 06:34:27,315 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-06 06:34:27,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:27,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:34:27,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 06:34:27,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 06:34:29,374 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-06 06:34:29,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:34:29,411 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;@cf55c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:34:29,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:34:29,421 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 06:34:29,421 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:29,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:29,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:29,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 229073430, now seen corresponding path program 1 times [2022-12-06 06:34:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:29,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510992249] [2022-12-06 06:34:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:29,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:29,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510992249] [2022-12-06 06:34:29,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510992249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:29,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:29,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:29,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680307923] [2022-12-06 06:34:29,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:29,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:34:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:34:29,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:34:29,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-06 06:34:29,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 45 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:29,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:29,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-06 06:34:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:29,721 INFO L130 PetriNetUnfolder]: 164/296 cut-off events. [2022-12-06 06:34:29,721 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:34:29,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 296 events. 164/296 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1225 event pairs, 164 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 586. Up to 271 conditions per place. [2022-12-06 06:34:29,725 INFO L137 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-06 06:34:29,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 17 transitions, 71 flow [2022-12-06 06:34:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:34:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:34:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 06:34:29,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:34:29,735 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 45 flow. Second operand 2 states and 21 transitions. [2022-12-06 06:34:29,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 17 transitions, 71 flow [2022-12-06 06:34:29,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:34:29,738 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 40 flow [2022-12-06 06:34:29,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 06:34:29,742 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 06:34:29,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:29,743 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 40 flow [2022-12-06 06:34:29,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:29,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:29,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 40 flow [2022-12-06 06:34:29,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 40 flow [2022-12-06 06:34:29,749 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 06:34:29,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:29,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:34:29,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 40 flow [2022-12-06 06:34:29,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 06:34:29,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:29,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 06:34:29,770 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 40 flow [2022-12-06 06:34:29,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:29,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:29,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:34:29,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1488657983, now seen corresponding path program 1 times [2022-12-06 06:34:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188984743] [2022-12-06 06:34:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188984743] [2022-12-06 06:34:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188984743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:29,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:29,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269151869] [2022-12-06 06:34:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:29,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:29,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:34:29,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 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-06 06:34:29,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:29,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:34:29,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:30,083 INFO L130 PetriNetUnfolder]: 398/674 cut-off events. [2022-12-06 06:34:30,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:30,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 674 events. 398/674 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3160 event pairs, 144 based on Foata normal form. 31/705 useless extension candidates. Maximal degree in co-relation 1362. Up to 414 conditions per place. [2022-12-06 06:34:30,090 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2022-12-06 06:34:30,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 128 flow [2022-12-06 06:34:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:34:30,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-06 06:34:30,091 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:34:30,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 128 flow [2022-12-06 06:34:30,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:30,093 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-06 06:34:30,094 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 06:34:30,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:30,094 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:30,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:30,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,101 INFO L130 PetriNetUnfolder]: 47/136 cut-off events. [2022-12-06 06:34:30,101 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-12-06 06:34:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 136 events. 47/136 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 624 event pairs, 17 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 277. Up to 66 conditions per place. [2022-12-06 06:34:30,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:34:30,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:30,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 06:34:30,108 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 86 flow [2022-12-06 06:34:30,108 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-06 06:34:30,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:30,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:34:30,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1096243217, now seen corresponding path program 1 times [2022-12-06 06:34:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:30,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955358191] [2022-12-06 06:34:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:30,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955358191] [2022-12-06 06:34:30,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955358191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:30,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:30,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018712641] [2022-12-06 06:34:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:30,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:34:30,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 86 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-06 06:34:30,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:30,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:34:30,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:30,319 INFO L130 PetriNetUnfolder]: 372/631 cut-off events. [2022-12-06 06:34:30,319 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-06 06:34:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 631 events. 372/631 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2970 event pairs, 53 based on Foata normal form. 10/640 useless extension candidates. Maximal degree in co-relation 1719. Up to 321 conditions per place. [2022-12-06 06:34:30,323 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 31 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2022-12-06 06:34:30,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 218 flow [2022-12-06 06:34:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 06:34:30,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2022-12-06 06:34:30,325 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 86 flow. Second operand 4 states and 39 transitions. [2022-12-06 06:34:30,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 218 flow [2022-12-06 06:34:30,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:34:30,329 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-06 06:34:30,330 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 06:34:30,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:30,330 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:30,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:30,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,340 INFO L130 PetriNetUnfolder]: 39/120 cut-off events. [2022-12-06 06:34:30,340 INFO L131 PetriNetUnfolder]: For 65/78 co-relation queries the response was YES. [2022-12-06 06:34:30,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 120 events. 39/120 cut-off events. For 65/78 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 521 event pairs, 13 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 300. Up to 54 conditions per place. [2022-12-06 06:34:30,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:34:30,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:30,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:34:30,344 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 122 flow [2022-12-06 06:34:30,344 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-06 06:34:30,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:30,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:30,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:34:30,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1096242659, now seen corresponding path program 1 times [2022-12-06 06:34:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55841047] [2022-12-06 06:34:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55841047] [2022-12-06 06:34:30,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55841047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:30,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:30,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546749393] [2022-12-06 06:34:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:30,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:34:30,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 3.0) 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-06 06:34:30,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:30,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:34:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:30,589 INFO L130 PetriNetUnfolder]: 587/945 cut-off events. [2022-12-06 06:34:30,589 INFO L131 PetriNetUnfolder]: For 1018/1018 co-relation queries the response was YES. [2022-12-06 06:34:30,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 945 events. 587/945 cut-off events. For 1018/1018 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4215 event pairs, 59 based on Foata normal form. 16/961 useless extension candidates. Maximal degree in co-relation 2864. Up to 307 conditions per place. [2022-12-06 06:34:30,594 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 44 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2022-12-06 06:34:30,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 416 flow [2022-12-06 06:34:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:34:30,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2022-12-06 06:34:30,597 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 122 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:34:30,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 416 flow [2022-12-06 06:34:30,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:30,601 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=119, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2022-12-06 06:34:30,602 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-06 06:34:30,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:30,604 INFO L89 Accepts]: Start accepts. Operand has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:30,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:30,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,616 INFO L130 PetriNetUnfolder]: 58/164 cut-off events. [2022-12-06 06:34:30,616 INFO L131 PetriNetUnfolder]: For 310/361 co-relation queries the response was YES. [2022-12-06 06:34:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 164 events. 58/164 cut-off events. For 310/361 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 797 event pairs, 4 based on Foata normal form. 4/166 useless extension candidates. Maximal degree in co-relation 624. Up to 65 conditions per place. [2022-12-06 06:34:30,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:34:30,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:30,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:34:30,630 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 301 flow [2022-12-06 06:34:30,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-06 06:34:30,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:30,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:30,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:34:30,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash -340149175, now seen corresponding path program 1 times [2022-12-06 06:34:30,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:30,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437663965] [2022-12-06 06:34:30,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:30,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:30,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437663965] [2022-12-06 06:34:30,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437663965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:30,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:30,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:34:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777338003] [2022-12-06 06:34:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:30,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:34:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:34:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:34:30,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:34:30,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:30,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:30,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:34:30,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:30,794 INFO L130 PetriNetUnfolder]: 489/811 cut-off events. [2022-12-06 06:34:30,794 INFO L131 PetriNetUnfolder]: For 2195/2221 co-relation queries the response was YES. [2022-12-06 06:34:30,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 811 events. 489/811 cut-off events. For 2195/2221 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3735 event pairs, 162 based on Foata normal form. 23/832 useless extension candidates. Maximal degree in co-relation 3143. Up to 631 conditions per place. [2022-12-06 06:34:30,799 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 41 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2022-12-06 06:34:30,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 553 flow [2022-12-06 06:34:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:34:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:34:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 06:34:30,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2022-12-06 06:34:30,802 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 301 flow. Second operand 3 states and 29 transitions. [2022-12-06 06:34:30,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 553 flow [2022-12-06 06:34:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:30,813 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 06:34:30,815 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-06 06:34:30,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:30,816 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:30,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:30,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,828 INFO L130 PetriNetUnfolder]: 45/138 cut-off events. [2022-12-06 06:34:30,828 INFO L131 PetriNetUnfolder]: For 363/441 co-relation queries the response was YES. [2022-12-06 06:34:30,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 138 events. 45/138 cut-off events. For 363/441 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 614 event pairs, 3 based on Foata normal form. 6/142 useless extension candidates. Maximal degree in co-relation 590. Up to 55 conditions per place. [2022-12-06 06:34:30,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:34:30,835 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:30,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:34:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 419 flow [2022-12-06 06:34:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:30,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:30,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:34:30,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1954162023, now seen corresponding path program 1 times [2022-12-06 06:34:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:30,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326945199] [2022-12-06 06:34:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326945199] [2022-12-06 06:34:30,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326945199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:30,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:30,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367527730] [2022-12-06 06:34:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:30,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:30,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:34:30,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:30,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:30,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:34:30,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:31,027 INFO L130 PetriNetUnfolder]: 481/819 cut-off events. [2022-12-06 06:34:31,027 INFO L131 PetriNetUnfolder]: For 2793/2822 co-relation queries the response was YES. [2022-12-06 06:34:31,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 819 events. 481/819 cut-off events. For 2793/2822 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3938 event pairs, 71 based on Foata normal form. 35/854 useless extension candidates. Maximal degree in co-relation 3310. Up to 375 conditions per place. [2022-12-06 06:34:31,032 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 34 selfloop transitions, 23 changer transitions 1/60 dead transitions. [2022-12-06 06:34:31,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 605 flow [2022-12-06 06:34:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:34:31,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2022-12-06 06:34:31,033 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 419 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:34:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 605 flow [2022-12-06 06:34:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 593 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:34:31,039 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=529, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-06 06:34:31,041 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2022-12-06 06:34:31,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:31,041 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:31,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:31,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,052 INFO L130 PetriNetUnfolder]: 38/131 cut-off events. [2022-12-06 06:34:31,052 INFO L131 PetriNetUnfolder]: For 578/680 co-relation queries the response was YES. [2022-12-06 06:34:31,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 131 events. 38/131 cut-off events. For 578/680 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 591 event pairs, 3 based on Foata normal form. 5/134 useless extension candidates. Maximal degree in co-relation 607. Up to 50 conditions per place. [2022-12-06 06:34:31,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:34:31,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:31,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:34:31,056 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 529 flow [2022-12-06 06:34:31,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:31,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:31,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:31,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:34:31,057 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1221964057, now seen corresponding path program 1 times [2022-12-06 06:34:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:31,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520591289] [2022-12-06 06:34:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520591289] [2022-12-06 06:34:31,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520591289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:31,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:31,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134271588] [2022-12-06 06:34:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:31,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:34:31,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 529 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:31,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:31,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:34:31,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:31,249 INFO L130 PetriNetUnfolder]: 610/1019 cut-off events. [2022-12-06 06:34:31,249 INFO L131 PetriNetUnfolder]: For 5310/5310 co-relation queries the response was YES. [2022-12-06 06:34:31,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4317 conditions, 1019 events. 610/1019 cut-off events. For 5310/5310 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4886 event pairs, 130 based on Foata normal form. 24/1043 useless extension candidates. Maximal degree in co-relation 4290. Up to 452 conditions per place. [2022-12-06 06:34:31,253 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 39 selfloop transitions, 10 changer transitions 30/79 dead transitions. [2022-12-06 06:34:31,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 917 flow [2022-12-06 06:34:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 06:34:31,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2022-12-06 06:34:31,256 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 529 flow. Second operand 5 states and 48 transitions. [2022-12-06 06:34:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 917 flow [2022-12-06 06:34:31,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 907 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 06:34:31,263 INFO L231 Difference]: Finished difference. Result has 53 places, 29 transitions, 312 flow [2022-12-06 06:34:31,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=53, PETRI_TRANSITIONS=29} [2022-12-06 06:34:31,264 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2022-12-06 06:34:31,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:31,264 INFO L89 Accepts]: Start accepts. Operand has 53 places, 29 transitions, 312 flow [2022-12-06 06:34:31,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:31,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:31,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 29 transitions, 312 flow [2022-12-06 06:34:31,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 29 transitions, 312 flow [2022-12-06 06:34:31,269 INFO L130 PetriNetUnfolder]: 9/48 cut-off events. [2022-12-06 06:34:31,269 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-06 06:34:31,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 48 events. 9/48 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 2 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 233. Up to 18 conditions per place. [2022-12-06 06:34:31,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 29 transitions, 312 flow [2022-12-06 06:34:31,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 06:34:31,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [184] L741-->L744: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [190] L756-->L759: Formula: (= 2 v_~y~0_4) InVars {} OutVars{~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] [2022-12-06 06:34:31,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:34:31,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:34:31,279 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 29 transitions, 326 flow [2022-12-06 06:34:31,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:31,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:31,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:34:31,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1797950641, now seen corresponding path program 1 times [2022-12-06 06:34:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052223653] [2022-12-06 06:34:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:31,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052223653] [2022-12-06 06:34:31,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052223653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:31,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:31,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:34:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282313668] [2022-12-06 06:34:31,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:31,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:34:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:34:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:34:31,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:34:31,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 29 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:31,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:31,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:34:31,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:31,420 INFO L130 PetriNetUnfolder]: 230/409 cut-off events. [2022-12-06 06:34:31,420 INFO L131 PetriNetUnfolder]: For 2088/2089 co-relation queries the response was YES. [2022-12-06 06:34:31,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 409 events. 230/409 cut-off events. For 2088/2089 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1566 event pairs, 54 based on Foata normal form. 12/420 useless extension candidates. Maximal degree in co-relation 1782. Up to 212 conditions per place. [2022-12-06 06:34:31,422 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 17 selfloop transitions, 4 changer transitions 22/44 dead transitions. [2022-12-06 06:34:31,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 482 flow [2022-12-06 06:34:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:34:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:34:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 06:34:31,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-06 06:34:31,423 INFO L175 Difference]: Start difference. First operand has 53 places, 29 transitions, 326 flow. Second operand 5 states and 41 transitions. [2022-12-06 06:34:31,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 482 flow [2022-12-06 06:34:31,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 347 flow, removed 15 selfloop flow, removed 13 redundant places. [2022-12-06 06:34:31,426 INFO L231 Difference]: Finished difference. Result has 45 places, 17 transitions, 99 flow [2022-12-06 06:34:31,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=17} [2022-12-06 06:34:31,427 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2022-12-06 06:34:31,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:34:31,427 INFO L89 Accepts]: Start accepts. Operand has 45 places, 17 transitions, 99 flow [2022-12-06 06:34:31,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:34:31,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:31,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 17 transitions, 99 flow [2022-12-06 06:34:31,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 17 transitions, 99 flow [2022-12-06 06:34:31,430 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:34:31,430 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 06:34:31,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 19 events. 0/19 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 06:34:31,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 17 transitions, 99 flow [2022-12-06 06:34:31,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 06:34:31,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [258] $Ultimate##0-->L729: Formula: (and (= v_~y~0_99 v_~__unbuffered_p0_EAX~0_61) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_61, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_99, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [236] $Ultimate##0-->L741: Formula: (and (= v_~x~0_12 v_~__unbuffered_p1_EAX~0_29) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_12} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_12} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0] [2022-12-06 06:34:31,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [260] $Ultimate##0-->L759: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~y~0_104 v_~__unbuffered_p2_EAX~0_62) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~y~0_103 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_104, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~y~0=v_~y~0_103, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] and [259] $Ultimate##0-->L741: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_38 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_15| v_P1Thread1of1ForFork2_~arg.base_15) (= v_~y~0_101 v_~__unbuffered_p0_EAX~0_63) (= |v_P1Thread1of1ForFork2_#in~arg.offset_15| v_P1Thread1of1ForFork2_~arg.offset_15) (= v_~x~0_38 v_~__unbuffered_p1_EAX~0_59)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_101} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_15, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_63, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_101, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:34:31,550 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:34:31,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 06:34:31,550 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 12 transitions, 68 flow [2022-12-06 06:34:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:34:31,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:34:31,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:31,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:34:31,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:34:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:34:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1096243434, now seen corresponding path program 1 times [2022-12-06 06:34:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:34:31,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425968412] [2022-12-06 06:34:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:34:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:34:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:34:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:34:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:34:31,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425968412] [2022-12-06 06:34:31,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425968412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:34:31,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:34:31,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:34:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919858103] [2022-12-06 06:34:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:34:31,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:34:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:34:31,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:34:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:34:31,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-06 06:34:31,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 12 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 3.0) 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-06 06:34:31,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:34:31,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-06 06:34:31,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:34:31,620 INFO L130 PetriNetUnfolder]: 6/21 cut-off events. [2022-12-06 06:34:31,620 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 06:34:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 21 events. 6/21 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 2 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 72. Up to 14 conditions per place. [2022-12-06 06:34:31,620 INFO L137 encePairwiseOnDemand]: 9/12 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2022-12-06 06:34:31,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 11 transitions, 80 flow [2022-12-06 06:34:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:34:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:34:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-12-06 06:34:31,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 06:34:31,621 INFO L175 Difference]: Start difference. First operand has 36 places, 12 transitions, 68 flow. Second operand 4 states and 12 transitions. [2022-12-06 06:34:31,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 11 transitions, 80 flow [2022-12-06 06:34:31,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 11 transitions, 50 flow, removed 1 selfloop flow, removed 15 redundant places. [2022-12-06 06:34:31,622 INFO L231 Difference]: Finished difference. Result has 21 places, 0 transitions, 0 flow [2022-12-06 06:34:31,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=21, PETRI_TRANSITIONS=0} [2022-12-06 06:34:31,622 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -6 predicate places. [2022-12-06 06:34:31,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:34:31,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 0 transitions, 0 flow [2022-12-06 06:34:31,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 06:34:31,623 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:34:31,623 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:34:31,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 06:34:31,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 06:34:31,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:34:31,623 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:34:31,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 06:34:31,624 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 06:34:31,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-06 06:34:31,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:34:31,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:34:31,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:34:31,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:34:31,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:34:31,626 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:34:31,628 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:34:31,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:34:31,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:34:31 BasicIcfg [2022-12-06 06:34:31,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:34:31,630 INFO L158 Benchmark]: Toolchain (without parser) took 5314.34ms. Allocated memory was 189.8MB in the beginning and 278.9MB in the end (delta: 89.1MB). Free memory was 164.5MB in the beginning and 186.6MB in the end (delta: -22.1MB). Peak memory consumption was 68.0MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory was 167.1MB in the beginning and 166.9MB in the end (delta: 159.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.82ms. Allocated memory is still 189.8MB. Free memory was 164.0MB in the beginning and 140.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.28ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 189.8MB. Free memory was 138.9MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: RCFGBuilder took 385.51ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 123.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,631 INFO L158 Benchmark]: TraceAbstraction took 4497.97ms. Allocated memory was 189.8MB in the beginning and 278.9MB in the end (delta: 89.1MB). Free memory was 123.0MB in the beginning and 186.6MB in the end (delta: -63.5MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. [2022-12-06 06:34:31,632 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 189.8MB. Free memory was 167.1MB in the beginning and 166.9MB in the end (delta: 159.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.82ms. Allocated memory is still 189.8MB. Free memory was 164.0MB in the beginning and 140.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.28ms. Allocated memory is still 189.8MB. Free memory was 140.9MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 189.8MB. Free memory was 138.9MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.51ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 123.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4497.97ms. Allocated memory was 189.8MB in the beginning and 278.9MB in the end (delta: 89.1MB). Free memory was 123.0MB in the beginning and 186.6MB in the end (delta: -63.5MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 79 PlacesBefore, 27 PlacesAfterwards, 70 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 766, independent: 727, independent conditional: 727, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 766, independent: 727, independent conditional: 0, independent unconditional: 727, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 766, independent: 727, independent conditional: 0, independent unconditional: 727, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 766, independent: 727, independent conditional: 0, independent unconditional: 727, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 663, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 663, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 766, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 663, unknown conditional: 0, unknown unconditional: 663] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 943, Positive conditional cache size: 0, Positive unconditional cache size: 943, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 41, 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: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 55, independent: 41, independent conditional: 0, independent unconditional: 41, 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: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 25, independent conditional: 4, independent unconditional: 21, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 1, Positive unconditional cache size: 40, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 27, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 1, Positive unconditional cache size: 40, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 51, independent conditional: 20, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 51, independent conditional: 5, independent unconditional: 46, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 51, independent conditional: 5, independent unconditional: 46, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 46, independent conditional: 5, independent unconditional: 41, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 135, independent conditional: 64, independent unconditional: 71, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 135, independent conditional: 26, independent unconditional: 109, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 135, independent conditional: 26, independent unconditional: 109, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 133, independent conditional: 26, independent unconditional: 107, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 1, Positive unconditional cache size: 47, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 126, independent conditional: 63, independent unconditional: 63, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 137, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 1, Positive unconditional cache size: 47, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 68, 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: 83, independent: 68, independent conditional: 21, independent unconditional: 47, 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: 83, independent: 68, independent conditional: 2, independent unconditional: 66, 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: 83, independent: 68, independent conditional: 2, independent unconditional: 66, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 65, independent conditional: 2, independent unconditional: 63, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 52, Positive conditional cache size: 1, Positive unconditional cache size: 51, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 36 PlacesAfterwards, 17 TransitionsBefore, 12 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 21 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=529occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 06:34:31,650 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...