/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:13:30,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:13:30,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:13:30,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:13:30,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:13:30,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:13:30,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:13:30,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:13:30,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:13:30,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:13:30,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:13:30,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:13:30,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:13:30,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:13:30,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:13:30,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:13:30,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:13:30,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:13:30,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:13:30,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:13:30,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:13:30,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:13:30,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:13:30,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:13:30,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:13:30,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:13:30,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:13:30,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:13:30,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:13:30,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:13:30,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:13:30,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:13:30,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:13:30,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:13:30,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:13:30,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:13:30,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:13:30,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:13:30,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:13:30,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:13:30,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:13:30,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:13:30,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:13:30,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:13:30,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:13:30,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:13:30,780 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:13:30,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:13:30,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:13:30,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:13:30,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:13:30,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:13:30,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:13:30,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:13:30,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:13:30,798 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:13:30,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:13:30,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:13:30,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:13:30,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:13:30,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:13:30,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:13:30,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:13:31,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:13:31,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:13:31,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:13:31,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:13:31,086 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:13:31,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:13:32,076 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:13:32,317 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:13:32,317 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:13:32,327 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18baad9cd/6ee9e1803e8e4ce09ff436be447f1bdf/FLAG1e866f77f [2022-12-06 01:13:32,338 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18baad9cd/6ee9e1803e8e4ce09ff436be447f1bdf [2022-12-06 01:13:32,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:13:32,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:13:32,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:13:32,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:13:32,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:13:32,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3baf7420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32, skipping insertion in model container [2022-12-06 01:13:32,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:13:32,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:13:32,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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:13:32,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:13:32,608 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:13:32,620 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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:13:32,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:32,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:32,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:13:32,669 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:13:32,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32 WrapperNode [2022-12-06 01:13:32,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:13:32,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:13:32,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:13:32,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:13:32,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,709 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-06 01:13:32,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:13:32,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:13:32,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:13:32,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:13:32,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:13:32,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:13:32,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:13:32,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:13:32,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (1/1) ... [2022-12-06 01:13:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:13:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:13:32,780 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 01:13:32,787 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 01:13:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:13:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:13:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:13:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:13:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:13:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:13:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:13:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:13:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:13:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:13:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:13:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:13:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:13:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:13:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:13:32,815 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 01:13:32,966 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:13:32,967 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:13:33,124 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:13:33,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:13:33,130 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:13:33,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:13:33 BoogieIcfgContainer [2022-12-06 01:13:33,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:13:33,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:13:33,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:13:33,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:13:33,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:13:32" (1/3) ... [2022-12-06 01:13:33,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1960ae0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:13:33, skipping insertion in model container [2022-12-06 01:13:33,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:32" (2/3) ... [2022-12-06 01:13:33,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1960ae0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:13:33, skipping insertion in model container [2022-12-06 01:13:33,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:13:33" (3/3) ... [2022-12-06 01:13:33,137 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:13:33,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:13:33,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:13:33,152 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:13:33,226 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:13:33,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 01:13:33,305 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-06 01:13:33,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:33,309 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 01:13:33,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 01:13:33,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-06 01:13:33,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:33,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 01:13:33,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-06 01:13:33,392 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-06 01:13:33,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:33,393 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 01:13:33,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 01:13:33,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 01:13:35,261 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-06 01:13:35,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:13:35,277 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;@5c429a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:13:35,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:13:35,280 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 01:13:35,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:35,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:35,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:35,281 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 01:13:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 229073430, now seen corresponding path program 1 times [2022-12-06 01:13:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:35,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458821908] [2022-12-06 01:13:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:13:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458821908] [2022-12-06 01:13:35,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458821908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:35,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:35,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134005809] [2022-12-06 01:13:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:35,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 01:13:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 01:13:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 01:13:35,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-06 01:13:35,464 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 01:13:35,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:35,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-06 01:13:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:35,537 INFO L130 PetriNetUnfolder]: 164/296 cut-off events. [2022-12-06 01:13:35,537 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 01:13:35,539 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 01:13:35,541 INFO L137 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-06 01:13:35,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 17 transitions, 71 flow [2022-12-06 01:13:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 01:13:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 01:13:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 01:13:35,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 01:13:35,553 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 01:13:35,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:35,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 17 transitions, 71 flow [2022-12-06 01:13:35,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 17 transitions, 71 flow [2022-12-06 01:13:35,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 01:13:35,628 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:13:35,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 01:13:35,631 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 65 flow [2022-12-06 01:13:35,631 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 01:13:35,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:35,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:13:35,635 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 01:13:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1488657983, now seen corresponding path program 1 times [2022-12-06 01:13:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:35,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499914013] [2022-12-06 01:13:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:35,900 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 01:13:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:35,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499914013] [2022-12-06 01:13:35,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499914013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:35,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:35,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677365041] [2022-12-06 01:13:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:35,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:13:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:13:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:13:35,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 01:13:35,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 65 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 01:13:35,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:35,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 01:13:35,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:35,963 INFO L130 PetriNetUnfolder]: 199/343 cut-off events. [2022-12-06 01:13:35,963 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 01:13:35,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 343 events. 199/343 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1299 event pairs, 68 based on Foata normal form. 16/359 useless extension candidates. Maximal degree in co-relation 1051. Up to 344 conditions per place. [2022-12-06 01:13:35,966 INFO L137 encePairwiseOnDemand]: 7/14 looper letters, 19 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2022-12-06 01:13:35,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 165 flow [2022-12-06 01:13:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:13:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:13:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 01:13:35,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 01:13:35,970 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-06 01:13:35,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:35,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 165 flow [2022-12-06 01:13:35,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 165 flow [2022-12-06 01:13:35,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:36,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:13:36,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 01:13:36,056 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 165 flow [2022-12-06 01:13:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 01:13:36,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:36,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:36,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:13:36,057 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 01:13:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1096243217, now seen corresponding path program 1 times [2022-12-06 01:13:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:36,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693898767] [2022-12-06 01:13:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:36,212 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 01:13:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:36,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693898767] [2022-12-06 01:13:36,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693898767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:36,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:36,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318231278] [2022-12-06 01:13:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:13:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:13:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:13:36,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 01:13:36,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 165 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 01:13:36,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:36,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 01:13:36,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:36,264 INFO L130 PetriNetUnfolder]: 179/314 cut-off events. [2022-12-06 01:13:36,264 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 01:13:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 314 events. 179/314 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1148 event pairs, 30 based on Foata normal form. 10/324 useless extension candidates. Maximal degree in co-relation 1276. Up to 315 conditions per place. [2022-12-06 01:13:36,268 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 01:13:36,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 287 flow [2022-12-06 01:13:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:13:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:13:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 01:13:36,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 01:13:36,271 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 01:13:36,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:36,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 34 transitions, 287 flow [2022-12-06 01:13:36,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 34 transitions, 287 flow [2022-12-06 01:13:36,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:36,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:13:36,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 01:13:36,355 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 34 transitions, 289 flow [2022-12-06 01:13:36,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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 01:13:36,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:36,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:36,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:13:36,358 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 01:13:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1096242411, now seen corresponding path program 1 times [2022-12-06 01:13:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:36,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597178550] [2022-12-06 01:13:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:36,466 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 01:13:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:36,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597178550] [2022-12-06 01:13:36,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597178550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:36,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:36,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:13:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628094455] [2022-12-06 01:13:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:36,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:13:36,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:36,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:13:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:13:36,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:13:36,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 34 transitions, 289 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 01:13:36,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:36,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:13:36,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:36,532 INFO L130 PetriNetUnfolder]: 147/274 cut-off events. [2022-12-06 01:13:36,532 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:36,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 274 events. 147/274 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1073 event pairs, 9 based on Foata normal form. 12/286 useless extension candidates. Maximal degree in co-relation 1388. Up to 275 conditions per place. [2022-12-06 01:13:36,535 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 37 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2022-12-06 01:13:36,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 514 flow [2022-12-06 01:13:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:13:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:13:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 01:13:36,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-06 01:13:36,537 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 01:13:36,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:36,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 49 transitions, 514 flow [2022-12-06 01:13:36,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 49 transitions, 514 flow [2022-12-06 01:13:36,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:36,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:13:36,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 01:13:36,642 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 49 transitions, 520 flow [2022-12-06 01:13:36,642 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 01:13:36,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:36,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:13:36,643 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 01:13:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -376199013, now seen corresponding path program 1 times [2022-12-06 01:13:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:36,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000464775] [2022-12-06 01:13:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:36,730 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 01:13:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:36,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000464775] [2022-12-06 01:13:36,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000464775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:36,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:36,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:13:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925499735] [2022-12-06 01:13:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:36,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:13:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:13:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:13:36,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:13:36,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 49 transitions, 520 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:36,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:36,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:13:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:36,787 INFO L130 PetriNetUnfolder]: 135/278 cut-off events. [2022-12-06 01:13:36,787 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:36,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 278 events. 135/278 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1198 event pairs, 4 based on Foata normal form. 20/298 useless extension candidates. Maximal degree in co-relation 1684. Up to 279 conditions per place. [2022-12-06 01:13:36,788 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 42 selfloop transitions, 8 changer transitions 22/72 dead transitions. [2022-12-06 01:13:36,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 72 transitions, 897 flow [2022-12-06 01:13:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:13:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:13:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 01:13:36,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 01:13:36,792 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-06 01:13:36,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:36,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 72 transitions, 897 flow [2022-12-06 01:13:36,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 72 transitions, 897 flow [2022-12-06 01:13:36,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:36,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:13:36,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 01:13:36,864 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 72 transitions, 905 flow [2022-12-06 01:13:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:36,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:36,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:36,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:13:36,866 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 01:13:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1222739801, now seen corresponding path program 1 times [2022-12-06 01:13:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:36,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86682481] [2022-12-06 01:13:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:36,955 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 01:13:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:36,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86682481] [2022-12-06 01:13:36,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86682481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:36,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:36,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:13:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47987896] [2022-12-06 01:13:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:36,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:13:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:13:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:13:36,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:13:36,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 72 transitions, 905 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 01:13:36,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:36,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:13:36,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:37,009 INFO L130 PetriNetUnfolder]: 119/281 cut-off events. [2022-12-06 01:13:37,010 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:37,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2007 conditions, 281 events. 119/281 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1335 event pairs, 1 based on Foata normal form. 16/297 useless extension candidates. Maximal degree in co-relation 1981. Up to 282 conditions per place. [2022-12-06 01:13:37,011 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 19 selfloop transitions, 5 changer transitions 74/98 dead transitions. [2022-12-06 01:13:37,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 98 transitions, 1405 flow [2022-12-06 01:13:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:13:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:13:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-12-06 01:13:37,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-06 01:13:37,012 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-06 01:13:37,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:37,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 98 transitions, 1405 flow [2022-12-06 01:13:37,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 98 transitions, 1405 flow [2022-12-06 01:13:37,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:37,015 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:13:37,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:13:37,016 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 98 transitions, 1405 flow [2022-12-06 01:13:37,016 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 01:13:37,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:37,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:37,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:13:37,016 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 01:13:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -766603314, now seen corresponding path program 1 times [2022-12-06 01:13:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:37,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067831587] [2022-12-06 01:13:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:37,079 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 01:13:37,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:37,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067831587] [2022-12-06 01:13:37,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067831587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:37,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:37,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:13:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389959424] [2022-12-06 01:13:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:13:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:13:37,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:13:37,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 01:13:37,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 98 transitions, 1405 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:13:37,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:37,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 01:13:37,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:37,174 INFO L130 PetriNetUnfolder]: 113/292 cut-off events. [2022-12-06 01:13:37,175 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:37,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 292 events. 113/292 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1516 event pairs, 0 based on Foata normal form. 6/298 useless extension candidates. Maximal degree in co-relation 2348. Up to 293 conditions per place. [2022-12-06 01:13:37,176 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 17 selfloop transitions, 2 changer transitions 107/126 dead transitions. [2022-12-06 01:13:37,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 126 transitions, 2055 flow [2022-12-06 01:13:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:13:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:13:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 01:13:37,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-06 01:13:37,177 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-06 01:13:37,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:37,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 126 transitions, 2055 flow [2022-12-06 01:13:37,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 126 transitions, 2055 flow [2022-12-06 01:13:37,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:37,183 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:13:37,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 01:13:37,184 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 126 transitions, 2055 flow [2022-12-06 01:13:37,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:13:37,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:37,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:37,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:13:37,184 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 01:13:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2030964869, now seen corresponding path program 1 times [2022-12-06 01:13:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867140836] [2022-12-06 01:13:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:37,290 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 01:13:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:37,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867140836] [2022-12-06 01:13:37,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867140836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:37,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:37,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:13:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30685973] [2022-12-06 01:13:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:37,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:13:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:13:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:13:37,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 01:13:37,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 126 transitions, 2055 flow. Second operand has 4 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 01:13:37,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:37,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 01:13:37,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:37,348 INFO L130 PetriNetUnfolder]: 112/291 cut-off events. [2022-12-06 01:13:37,348 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:37,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 291 events. 112/291 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1482 event pairs, 0 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 2629. Up to 292 conditions per place. [2022-12-06 01:13:37,349 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 15 selfloop transitions, 2 changer transitions 223/240 dead transitions. [2022-12-06 01:13:37,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 240 transitions, 4362 flow [2022-12-06 01:13:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:13:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:13:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 01:13:37,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 01:13:37,351 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2022-12-06 01:13:37,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:37,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 240 transitions, 4362 flow [2022-12-06 01:13:37,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 240 transitions, 4362 flow [2022-12-06 01:13:37,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:37,355 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:13:37,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:13:37,356 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 240 transitions, 4362 flow [2022-12-06 01:13:37,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 01:13:37,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:37,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:37,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:13:37,356 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 01:13:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1319792381, now seen corresponding path program 1 times [2022-12-06 01:13:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:37,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204614088] [2022-12-06 01:13:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:37,420 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 01:13:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:37,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204614088] [2022-12-06 01:13:37,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204614088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:37,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:37,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:13:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210970257] [2022-12-06 01:13:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:37,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:13:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:13:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:13:37,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 01:13:37,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 240 transitions, 4362 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:13:37,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:37,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 01:13:37,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:37,479 INFO L130 PetriNetUnfolder]: 112/289 cut-off events. [2022-12-06 01:13:37,479 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 01:13:37,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 289 events. 112/289 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1474 event pairs, 0 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 2898. Up to 290 conditions per place. [2022-12-06 01:13:37,480 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2022-12-06 01:13:37,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 257 transitions, 5185 flow [2022-12-06 01:13:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:13:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:13:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 01:13:37,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 01:13:37,482 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2022-12-06 01:13:37,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:37,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 257 transitions, 5185 flow [2022-12-06 01:13:37,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 257 transitions, 5185 flow [2022-12-06 01:13:37,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:37,486 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:13:37,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:13:37,487 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 257 transitions, 5185 flow [2022-12-06 01:13:37,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:13:37,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:13:37,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:13:37,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:13:37,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:13:37,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:13:37,489 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:37,491 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:13:37,491 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:13:37,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:13:37 BasicIcfg [2022-12-06 01:13:37,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:13:37,493 INFO L158 Benchmark]: Toolchain (without parser) took 5152.77ms. Allocated memory was 203.4MB in the beginning and 315.6MB in the end (delta: 112.2MB). Free memory was 179.2MB in the beginning and 203.1MB in the end (delta: -23.9MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,493 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 148.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:13:37,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.85ms. Allocated memory is still 203.4MB. Free memory was 178.8MB in the beginning and 155.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.90ms. Allocated memory is still 203.4MB. Free memory was 155.8MB in the beginning and 153.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,494 INFO L158 Benchmark]: Boogie Preprocessor took 14.51ms. Allocated memory is still 203.4MB. Free memory was 153.8MB in the beginning and 152.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,494 INFO L158 Benchmark]: RCFGBuilder took 406.24ms. Allocated memory is still 203.4MB. Free memory was 152.1MB in the beginning and 138.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,494 INFO L158 Benchmark]: TraceAbstraction took 4359.94ms. Allocated memory was 203.4MB in the beginning and 315.6MB in the end (delta: 112.2MB). Free memory was 138.1MB in the beginning and 203.1MB in the end (delta: -65.0MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2022-12-06 01:13:37,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 148.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.85ms. Allocated memory is still 203.4MB. Free memory was 178.8MB in the beginning and 155.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.90ms. Allocated memory is still 203.4MB. Free memory was 155.8MB in the beginning and 153.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.51ms. Allocated memory is still 203.4MB. Free memory was 153.8MB in the beginning and 152.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.24ms. Allocated memory is still 203.4MB. Free memory was 152.1MB in the beginning and 138.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4359.94ms. Allocated memory was 203.4MB in the beginning and 315.6MB in the end (delta: 112.2MB). Free memory was 138.1MB in the beginning and 203.1MB in the end (delta: -65.0MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 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: 761, independent: 722, independent conditional: 722, 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: 761, independent: 722, independent conditional: 0, independent unconditional: 722, 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: 761, independent: 722, independent conditional: 0, independent unconditional: 722, 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: 761, independent: 722, independent conditional: 0, independent unconditional: 722, 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: 656, independent: 623, independent conditional: 0, independent unconditional: 623, 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: 656, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 761, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 942, Positive conditional cache size: 0, Positive unconditional cache size: 942, 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.1s, 28 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 39 PlacesBefore, 39 PlacesAfterwards, 98 TransitionsBefore, 98 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 126 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 47 PlacesBefore, 47 PlacesAfterwards, 240 TransitionsBefore, 240 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 50 PlacesBefore, 50 PlacesAfterwards, 257 TransitionsBefore, 257 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 0 mSDtfsCounter, 330 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5185occurred in iteration=9, InterpolantAutomatonStates: 36, 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, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 370 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 01:13:37,513 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...