/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:41:49,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:41:49,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:41:49,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:41:49,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:41:49,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:41:49,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:41:49,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:41:49,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:41:49,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:41:49,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:41:49,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:41:49,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:41:49,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:41:49,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:41:49,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:41:49,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:41:49,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:41:49,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:41:49,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:41:49,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:41:49,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:41:49,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:41:49,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:41:49,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:41:49,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:41:49,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:41:49,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:41:49,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:41:49,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:41:49,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:41:49,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:41:49,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:41:49,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:41:49,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:41:49,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:41:49,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:41:49,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:41:49,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:41:49,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:41:49,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:41:49,600 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-SemanticLbe.epf [2022-12-12 14:41:49,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:41:49,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:41:49,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:41:49,634 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:41:49,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:41:49,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:41:49,636 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:41:49,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:41:49,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:41:49,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:41:49,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:41:49,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:41:49,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:41:49,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:41:49,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:41:49,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:41:49,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:41:49,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:41:49,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:41:49,984 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:41:49,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 14:41:51,168 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:41:51,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:41:51,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 14:41:51,462 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a208ccb6a/d0505e4f63604c07bf1703db7fb35e40/FLAG403cfdb5c [2022-12-12 14:41:51,479 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a208ccb6a/d0505e4f63604c07bf1703db7fb35e40 [2022-12-12 14:41:51,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:41:51,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:41:51,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:41:51,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:41:51,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:41:51,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:41:51" (1/1) ... [2022-12-12 14:41:51,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a51fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:51, skipping insertion in model container [2022-12-12 14:41:51,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:41:51" (1/1) ... [2022-12-12 14:41:51,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:41:51,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:41:51,718 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 14:41:51,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:51,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:51,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:41:51,989 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:41:51,999 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 14:41:52,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:52,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:52,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:41:52,086 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:41:52,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52 WrapperNode [2022-12-12 14:41:52,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:41:52,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:41:52,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:41:52,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:41:52,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,158 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-12 14:41:52,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:41:52,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:41:52,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:41:52,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:41:52,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:41:52,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:41:52,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:41:52,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:41:52,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (1/1) ... [2022-12-12 14:41:52,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:41:52,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:41:52,248 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-12 14:41:52,272 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-12 14:41:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:41:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:41:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:41:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:41:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:41:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:41:52,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:41:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:41:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:41:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:41:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:41:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:41:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:41:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:41:52,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:41:52,292 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:41:52,454 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:41:52,456 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:41:52,918 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:41:53,104 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:41:53,105 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:41:53,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:41:53 BoogieIcfgContainer [2022-12-12 14:41:53,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:41:53,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:41:53,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:41:53,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:41:53,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:41:51" (1/3) ... [2022-12-12 14:41:53,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aaf3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:41:53, skipping insertion in model container [2022-12-12 14:41:53,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:52" (2/3) ... [2022-12-12 14:41:53,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aaf3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:41:53, skipping insertion in model container [2022-12-12 14:41:53,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:41:53" (3/3) ... [2022-12-12 14:41:53,114 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 14:41:53,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:41:53,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:41:53,130 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:41:53,175 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:41:53,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-12 14:41:53,269 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-12 14:41:53,270 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:41:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 14:41:53,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-12 14:41:53,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-12 14:41:53,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:41:53,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-12 14:41:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-12 14:41:53,356 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-12 14:41:53,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:41:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 14:41:53,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-12 14:41:53,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 2022 [2022-12-12 14:42:01,929 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 14:42:01,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:42:01,954 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=PETRI_NET, 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;@27025ab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:42:01,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:42:01,958 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 14:42:01,958 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:42:01,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:01,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:42:01,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 534766748, now seen corresponding path program 1 times [2022-12-12 14:42:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:01,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782285373] [2022-12-12 14:42:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:02,335 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-12 14:42:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:02,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782285373] [2022-12-12 14:42:02,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782285373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:02,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:02,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:42:02,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612153941] [2022-12-12 14:42:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:02,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:02,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:02,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:02,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 14:42:02,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:02,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:05,401 INFO L130 PetriNetUnfolder]: 13749/21906 cut-off events. [2022-12-12 14:42:05,402 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-12 14:42:05,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41431 conditions, 21906 events. 13749/21906 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 167836 event pairs, 1853 based on Foata normal form. 0/14290 useless extension candidates. Maximal degree in co-relation 41420. Up to 16433 conditions per place. [2022-12-12 14:42:05,477 INFO L137 encePairwiseOnDemand]: 57/63 looper letters, 38 selfloop transitions, 2 changer transitions 52/101 dead transitions. [2022-12-12 14:42:05,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 398 flow [2022-12-12 14:42:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-12-12 14:42:05,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 14:42:05,489 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 135 flow. Second operand 3 states and 126 transitions. [2022-12-12 14:42:05,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 398 flow [2022-12-12 14:42:05,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:05,494 INFO L231 Difference]: Finished difference. Result has 68 places, 33 transitions, 76 flow [2022-12-12 14:42:05,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=68, PETRI_TRANSITIONS=33} [2022-12-12 14:42:05,498 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2022-12-12 14:42:05,499 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 33 transitions, 76 flow [2022-12-12 14:42:05,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 14:42:05,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:05,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:05,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:42:05,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1359137346, now seen corresponding path program 1 times [2022-12-12 14:42:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:05,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786477550] [2022-12-12 14:42:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:05,795 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-12 14:42:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:05,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786477550] [2022-12-12 14:42:05,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786477550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:05,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:05,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:42:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635824218] [2022-12-12 14:42:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:05,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:05,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:05,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:05,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:05,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:05,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:05,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:06,225 INFO L130 PetriNetUnfolder]: 1774/2785 cut-off events. [2022-12-12 14:42:06,225 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-12 14:42:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 2785 events. 1774/2785 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14731 event pairs, 670 based on Foata normal form. 90/2451 useless extension candidates. Maximal degree in co-relation 5638. Up to 1723 conditions per place. [2022-12-12 14:42:06,241 INFO L137 encePairwiseOnDemand]: 60/63 looper letters, 37 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2022-12-12 14:42:06,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 190 flow [2022-12-12 14:42:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 14:42:06,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3544973544973545 [2022-12-12 14:42:06,244 INFO L175 Difference]: Start difference. First operand has 68 places, 33 transitions, 76 flow. Second operand 3 states and 67 transitions. [2022-12-12 14:42:06,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 190 flow [2022-12-12 14:42:06,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:06,247 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 80 flow [2022-12-12 14:42:06,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-12 14:42:06,248 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -29 predicate places. [2022-12-12 14:42:06,248 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 80 flow [2022-12-12 14:42:06,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:06,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:06,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:42:06,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1524847112, now seen corresponding path program 1 times [2022-12-12 14:42:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913319063] [2022-12-12 14:42:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:06,491 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-12 14:42:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:06,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913319063] [2022-12-12 14:42:06,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913319063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:42:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290715901] [2022-12-12 14:42:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:06,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:06,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:06,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:06,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:06,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:06,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:06,889 INFO L130 PetriNetUnfolder]: 1723/2689 cut-off events. [2022-12-12 14:42:06,889 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-12 14:42:06,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5622 conditions, 2689 events. 1723/2689 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13431 event pairs, 348 based on Foata normal form. 20/2293 useless extension candidates. Maximal degree in co-relation 5611. Up to 2081 conditions per place. [2022-12-12 14:42:06,905 INFO L137 encePairwiseOnDemand]: 60/63 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-12 14:42:06,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 179 flow [2022-12-12 14:42:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-12 14:42:06,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3386243386243386 [2022-12-12 14:42:06,908 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 80 flow. Second operand 3 states and 64 transitions. [2022-12-12 14:42:06,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 179 flow [2022-12-12 14:42:06,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:06,910 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 84 flow [2022-12-12 14:42:06,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-12 14:42:06,911 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -28 predicate places. [2022-12-12 14:42:06,911 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 84 flow [2022-12-12 14:42:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:06,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:06,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:06,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:42:06,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash -638826841, now seen corresponding path program 1 times [2022-12-12 14:42:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:06,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185466194] [2022-12-12 14:42:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:07,684 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-12 14:42:07,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185466194] [2022-12-12 14:42:07,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185466194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:07,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:07,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347721996] [2022-12-12 14:42:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:07,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:07,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 63 [2022-12-12 14:42:07,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:07,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:07,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 63 [2022-12-12 14:42:07,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:08,301 INFO L130 PetriNetUnfolder]: 2244/3497 cut-off events. [2022-12-12 14:42:08,301 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-12 14:42:08,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7504 conditions, 3497 events. 2244/3497 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18638 event pairs, 290 based on Foata normal form. 12/3038 useless extension candidates. Maximal degree in co-relation 7492. Up to 2195 conditions per place. [2022-12-12 14:42:08,319 INFO L137 encePairwiseOnDemand]: 52/63 looper letters, 51 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2022-12-12 14:42:08,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 321 flow [2022-12-12 14:42:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-12 14:42:08,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.346031746031746 [2022-12-12 14:42:08,322 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 84 flow. Second operand 5 states and 109 transitions. [2022-12-12 14:42:08,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 321 flow [2022-12-12 14:42:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:08,328 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 197 flow [2022-12-12 14:42:08,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2022-12-12 14:42:08,330 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-12 14:42:08,330 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 197 flow [2022-12-12 14:42:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:08,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:08,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:08,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:42:08,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1464054053, now seen corresponding path program 2 times [2022-12-12 14:42:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:08,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792814501] [2022-12-12 14:42:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:08,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792814501] [2022-12-12 14:42:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792814501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:08,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:08,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:42:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378609790] [2022-12-12 14:42:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:08,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 63 [2022-12-12 14:42:08,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-12 14:42:08,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:08,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 63 [2022-12-12 14:42:08,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:09,510 INFO L130 PetriNetUnfolder]: 3013/4717 cut-off events. [2022-12-12 14:42:09,511 INFO L131 PetriNetUnfolder]: For 4577/4577 co-relation queries the response was YES. [2022-12-12 14:42:09,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13443 conditions, 4717 events. 3013/4717 cut-off events. For 4577/4577 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26425 event pairs, 446 based on Foata normal form. 120/4135 useless extension candidates. Maximal degree in co-relation 13428. Up to 1863 conditions per place. [2022-12-12 14:42:09,541 INFO L137 encePairwiseOnDemand]: 59/63 looper letters, 46 selfloop transitions, 3 changer transitions 20/77 dead transitions. [2022-12-12 14:42:09,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 444 flow [2022-12-12 14:42:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 14:42:09,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3531746031746032 [2022-12-12 14:42:09,547 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 197 flow. Second operand 4 states and 89 transitions. [2022-12-12 14:42:09,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 444 flow [2022-12-12 14:42:09,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:09,552 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 146 flow [2022-12-12 14:42:09,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2022-12-12 14:42:09,555 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2022-12-12 14:42:09,555 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 146 flow [2022-12-12 14:42:09,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-12 14:42:09,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:09,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:09,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:42:09,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash -33532036, now seen corresponding path program 1 times [2022-12-12 14:42:09,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:09,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913434037] [2022-12-12 14:42:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:10,382 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-12 14:42:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913434037] [2022-12-12 14:42:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913434037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:10,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079123023] [2022-12-12 14:42:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:10,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:10,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 14:42:10,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:10,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:10,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:10,777 INFO L130 PetriNetUnfolder]: 1428/2294 cut-off events. [2022-12-12 14:42:10,777 INFO L131 PetriNetUnfolder]: For 2819/2819 co-relation queries the response was YES. [2022-12-12 14:42:10,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 2294 events. 1428/2294 cut-off events. For 2819/2819 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11052 event pairs, 434 based on Foata normal form. 1/1928 useless extension candidates. Maximal degree in co-relation 6869. Up to 2013 conditions per place. [2022-12-12 14:42:10,791 INFO L137 encePairwiseOnDemand]: 54/63 looper letters, 48 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2022-12-12 14:42:10,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 409 flow [2022-12-12 14:42:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-12 14:42:10,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29894179894179895 [2022-12-12 14:42:10,793 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 146 flow. Second operand 6 states and 113 transitions. [2022-12-12 14:42:10,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 409 flow [2022-12-12 14:42:10,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 379 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:10,803 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 236 flow [2022-12-12 14:42:10,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-12 14:42:10,806 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2022-12-12 14:42:10,806 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 236 flow [2022-12-12 14:42:10,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 14:42:10,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:10,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:10,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:42:10,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash 950666620, now seen corresponding path program 2 times [2022-12-12 14:42:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:10,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210473167] [2022-12-12 14:42:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:11,888 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-12 14:42:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:11,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210473167] [2022-12-12 14:42:11,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210473167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:11,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:11,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:42:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234114993] [2022-12-12 14:42:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:11,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:42:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:42:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:42:11,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:11,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 236 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-12 14:42:11,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:11,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:12,396 INFO L130 PetriNetUnfolder]: 1532/2457 cut-off events. [2022-12-12 14:42:12,396 INFO L131 PetriNetUnfolder]: For 4361/4369 co-relation queries the response was YES. [2022-12-12 14:42:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8015 conditions, 2457 events. 1532/2457 cut-off events. For 4361/4369 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12120 event pairs, 389 based on Foata normal form. 12/2094 useless extension candidates. Maximal degree in co-relation 7997. Up to 2089 conditions per place. [2022-12-12 14:42:12,413 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 51 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2022-12-12 14:42:12,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 519 flow [2022-12-12 14:42:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-12 14:42:12,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31746031746031744 [2022-12-12 14:42:12,415 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 236 flow. Second operand 5 states and 100 transitions. [2022-12-12 14:42:12,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 519 flow [2022-12-12 14:42:12,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 509 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-12 14:42:12,420 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 374 flow [2022-12-12 14:42:12,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2022-12-12 14:42:12,421 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2022-12-12 14:42:12,421 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 374 flow [2022-12-12 14:42:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-12 14:42:12,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:12,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:42:12,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 550275580, now seen corresponding path program 3 times [2022-12-12 14:42:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:12,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473782948] [2022-12-12 14:42:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:12,949 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-12 14:42:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:12,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473782948] [2022-12-12 14:42:12,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473782948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416631886] [2022-12-12 14:42:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:42:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:42:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:42:12,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:12,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 14:42:12,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:12,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:13,533 INFO L130 PetriNetUnfolder]: 1845/2942 cut-off events. [2022-12-12 14:42:13,534 INFO L131 PetriNetUnfolder]: For 7749/7773 co-relation queries the response was YES. [2022-12-12 14:42:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10939 conditions, 2942 events. 1845/2942 cut-off events. For 7749/7773 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15218 event pairs, 386 based on Foata normal form. 28/2529 useless extension candidates. Maximal degree in co-relation 10918. Up to 2168 conditions per place. [2022-12-12 14:42:13,559 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 63 selfloop transitions, 22 changer transitions 0/94 dead transitions. [2022-12-12 14:42:13,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 774 flow [2022-12-12 14:42:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-12 14:42:13,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-12 14:42:13,561 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 374 flow. Second operand 6 states and 112 transitions. [2022-12-12 14:42:13,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 774 flow [2022-12-12 14:42:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 693 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:13,579 INFO L231 Difference]: Finished difference. Result has 63 places, 70 transitions, 527 flow [2022-12-12 14:42:13,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=63, PETRI_TRANSITIONS=70} [2022-12-12 14:42:13,581 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2022-12-12 14:42:13,581 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 70 transitions, 527 flow [2022-12-12 14:42:13,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12 14:42:13,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:13,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:13,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:42:13,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash 943386656, now seen corresponding path program 1 times [2022-12-12 14:42:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:13,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211050232] [2022-12-12 14:42:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:14,615 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-12 14:42:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211050232] [2022-12-12 14:42:14,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211050232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:14,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:14,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:42:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167314538] [2022-12-12 14:42:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:42:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:42:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:42:14,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:14,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 70 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-12 14:42:14,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:14,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:14,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:15,385 INFO L130 PetriNetUnfolder]: 1939/3072 cut-off events. [2022-12-12 14:42:15,385 INFO L131 PetriNetUnfolder]: For 12992/13016 co-relation queries the response was YES. [2022-12-12 14:42:15,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12821 conditions, 3072 events. 1939/3072 cut-off events. For 12992/13016 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15739 event pairs, 418 based on Foata normal form. 27/2650 useless extension candidates. Maximal degree in co-relation 12798. Up to 2355 conditions per place. [2022-12-12 14:42:15,405 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 88 selfloop transitions, 63 changer transitions 0/160 dead transitions. [2022-12-12 14:42:15,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 1362 flow [2022-12-12 14:42:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 14:42:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 14:42:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2022-12-12 14:42:15,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31024531024531027 [2022-12-12 14:42:15,409 INFO L175 Difference]: Start difference. First operand has 63 places, 70 transitions, 527 flow. Second operand 11 states and 215 transitions. [2022-12-12 14:42:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 1362 flow [2022-12-12 14:42:15,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 160 transitions, 1341 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-12 14:42:15,421 INFO L231 Difference]: Finished difference. Result has 76 places, 102 transitions, 1041 flow [2022-12-12 14:42:15,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1041, PETRI_PLACES=76, PETRI_TRANSITIONS=102} [2022-12-12 14:42:15,422 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2022-12-12 14:42:15,422 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1041 flow [2022-12-12 14:42:15,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-12 14:42:15,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:15,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:15,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:42:15,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1984892818, now seen corresponding path program 2 times [2022-12-12 14:42:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:15,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467285] [2022-12-12 14:42:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:16,817 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-12 14:42:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:16,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067467285] [2022-12-12 14:42:16,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067467285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:16,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:16,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428292857] [2022-12-12 14:42:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:16,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:16,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 1041 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-12 14:42:16,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:16,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:16,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:17,625 INFO L130 PetriNetUnfolder]: 2041/3246 cut-off events. [2022-12-12 14:42:17,626 INFO L131 PetriNetUnfolder]: For 16314/16330 co-relation queries the response was YES. [2022-12-12 14:42:17,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15009 conditions, 3246 events. 2041/3246 cut-off events. For 16314/16330 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17042 event pairs, 475 based on Foata normal form. 22/2806 useless extension candidates. Maximal degree in co-relation 14981. Up to 2686 conditions per place. [2022-12-12 14:42:17,653 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 90 selfloop transitions, 55 changer transitions 0/154 dead transitions. [2022-12-12 14:42:17,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 154 transitions, 1646 flow [2022-12-12 14:42:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 14:42:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 14:42:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2022-12-12 14:42:17,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2998236331569665 [2022-12-12 14:42:17,655 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1041 flow. Second operand 9 states and 170 transitions. [2022-12-12 14:42:17,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 154 transitions, 1646 flow [2022-12-12 14:42:17,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 154 transitions, 1519 flow, removed 46 selfloop flow, removed 3 redundant places. [2022-12-12 14:42:17,682 INFO L231 Difference]: Finished difference. Result has 86 places, 119 transitions, 1323 flow [2022-12-12 14:42:17,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1323, PETRI_PLACES=86, PETRI_TRANSITIONS=119} [2022-12-12 14:42:17,682 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2022-12-12 14:42:17,683 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 119 transitions, 1323 flow [2022-12-12 14:42:17,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-12 14:42:17,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:17,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:17,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:42:17,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2065631124, now seen corresponding path program 3 times [2022-12-12 14:42:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577396713] [2022-12-12 14:42:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:19,141 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-12 14:42:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:19,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577396713] [2022-12-12 14:42:19,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577396713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:19,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:19,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:42:19,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135405608] [2022-12-12 14:42:19,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:19,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:42:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:19,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:42:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:42:19,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:19,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 119 transitions, 1323 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-12 14:42:19,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:19,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:19,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:19,706 INFO L130 PetriNetUnfolder]: 2113/3350 cut-off events. [2022-12-12 14:42:19,706 INFO L131 PetriNetUnfolder]: For 22991/23007 co-relation queries the response was YES. [2022-12-12 14:42:19,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17004 conditions, 3350 events. 2113/3350 cut-off events. For 22991/23007 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17557 event pairs, 539 based on Foata normal form. 7/2881 useless extension candidates. Maximal degree in co-relation 16972. Up to 1853 conditions per place. [2022-12-12 14:42:19,744 INFO L137 encePairwiseOnDemand]: 55/63 looper letters, 129 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2022-12-12 14:42:19,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1985 flow [2022-12-12 14:42:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-12 14:42:19,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-12 14:42:19,746 INFO L175 Difference]: Start difference. First operand has 86 places, 119 transitions, 1323 flow. Second operand 7 states and 135 transitions. [2022-12-12 14:42:19,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1985 flow [2022-12-12 14:42:19,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 167 transitions, 1885 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-12 14:42:19,801 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 1418 flow [2022-12-12 14:42:19,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1418, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2022-12-12 14:42:19,802 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 19 predicate places. [2022-12-12 14:42:19,802 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 125 transitions, 1418 flow [2022-12-12 14:42:19,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-12 14:42:19,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:19,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:42:19,803 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1079996158, now seen corresponding path program 1 times [2022-12-12 14:42:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:19,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021738502] [2022-12-12 14:42:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:19,972 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-12 14:42:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:19,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021738502] [2022-12-12 14:42:19,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021738502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:19,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:19,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:42:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814640895] [2022-12-12 14:42:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:19,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:42:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:42:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:42:19,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 63 [2022-12-12 14:42:19,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 125 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-12 14:42:19,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:19,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 63 [2022-12-12 14:42:19,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:20,440 INFO L130 PetriNetUnfolder]: 2564/3960 cut-off events. [2022-12-12 14:42:20,440 INFO L131 PetriNetUnfolder]: For 36529/36535 co-relation queries the response was YES. [2022-12-12 14:42:20,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20212 conditions, 3960 events. 2564/3960 cut-off events. For 36529/36535 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20349 event pairs, 561 based on Foata normal form. 77/3066 useless extension candidates. Maximal degree in co-relation 20178. Up to 3607 conditions per place. [2022-12-12 14:42:20,470 INFO L137 encePairwiseOnDemand]: 52/63 looper letters, 125 selfloop transitions, 10 changer transitions 0/141 dead transitions. [2022-12-12 14:42:20,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 141 transitions, 1762 flow [2022-12-12 14:42:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:42:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:42:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 14:42:20,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2022-12-12 14:42:20,472 INFO L175 Difference]: Start difference. First operand has 91 places, 125 transitions, 1418 flow. Second operand 3 states and 68 transitions. [2022-12-12 14:42:20,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 141 transitions, 1762 flow [2022-12-12 14:42:20,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 141 transitions, 1564 flow, removed 57 selfloop flow, removed 7 redundant places. [2022-12-12 14:42:20,524 INFO L231 Difference]: Finished difference. Result has 87 places, 106 transitions, 980 flow [2022-12-12 14:42:20,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=87, PETRI_TRANSITIONS=106} [2022-12-12 14:42:20,525 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 15 predicate places. [2022-12-12 14:42:20,526 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 106 transitions, 980 flow [2022-12-12 14:42:20,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-12 14:42:20,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:20,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:20,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:42:20,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1037893859, now seen corresponding path program 1 times [2022-12-12 14:42:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:20,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168130846] [2022-12-12 14:42:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:20,693 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-12 14:42:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:20,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168130846] [2022-12-12 14:42:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168130846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:20,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:42:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27763709] [2022-12-12 14:42:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:42:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:42:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:42:20,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 63 [2022-12-12 14:42:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 106 transitions, 980 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:20,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:20,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 63 [2022-12-12 14:42:20,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:21,038 INFO L130 PetriNetUnfolder]: 1364/2349 cut-off events. [2022-12-12 14:42:21,039 INFO L131 PetriNetUnfolder]: For 16079/16082 co-relation queries the response was YES. [2022-12-12 14:42:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12482 conditions, 2349 events. 1364/2349 cut-off events. For 16079/16082 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12590 event pairs, 156 based on Foata normal form. 177/1951 useless extension candidates. Maximal degree in co-relation 12450. Up to 1297 conditions per place. [2022-12-12 14:42:21,056 INFO L137 encePairwiseOnDemand]: 52/63 looper letters, 125 selfloop transitions, 19 changer transitions 0/150 dead transitions. [2022-12-12 14:42:21,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 150 transitions, 1676 flow [2022-12-12 14:42:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:42:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:42:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-12 14:42:21,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-12 14:42:21,058 INFO L175 Difference]: Start difference. First operand has 87 places, 106 transitions, 980 flow. Second operand 4 states and 93 transitions. [2022-12-12 14:42:21,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 150 transitions, 1676 flow [2022-12-12 14:42:21,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 150 transitions, 1442 flow, removed 75 selfloop flow, removed 8 redundant places. [2022-12-12 14:42:21,093 INFO L231 Difference]: Finished difference. Result has 82 places, 103 transitions, 827 flow [2022-12-12 14:42:21,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=827, PETRI_PLACES=82, PETRI_TRANSITIONS=103} [2022-12-12 14:42:21,094 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2022-12-12 14:42:21,094 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 827 flow [2022-12-12 14:42:21,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:21,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:21,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:42:21,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1223584558, now seen corresponding path program 1 times [2022-12-12 14:42:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:21,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061420796] [2022-12-12 14:42:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:21,263 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-12 14:42:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:21,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061420796] [2022-12-12 14:42:21,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061420796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:21,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:21,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917736320] [2022-12-12 14:42:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:21,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:21,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 63 [2022-12-12 14:42:21,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:21,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:21,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 63 [2022-12-12 14:42:21,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:21,538 INFO L130 PetriNetUnfolder]: 905/1593 cut-off events. [2022-12-12 14:42:21,539 INFO L131 PetriNetUnfolder]: For 6401/6401 co-relation queries the response was YES. [2022-12-12 14:42:21,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 1593 events. 905/1593 cut-off events. For 6401/6401 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8089 event pairs, 75 based on Foata normal form. 117/1297 useless extension candidates. Maximal degree in co-relation 7850. Up to 702 conditions per place. [2022-12-12 14:42:21,550 INFO L137 encePairwiseOnDemand]: 52/63 looper letters, 116 selfloop transitions, 28 changer transitions 0/150 dead transitions. [2022-12-12 14:42:21,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 1518 flow [2022-12-12 14:42:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:42:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:42:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-12 14:42:21,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-12 14:42:21,552 INFO L175 Difference]: Start difference. First operand has 82 places, 103 transitions, 827 flow. Second operand 5 states and 99 transitions. [2022-12-12 14:42:21,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 1518 flow [2022-12-12 14:42:21,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 150 transitions, 1426 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-12 14:42:21,567 INFO L231 Difference]: Finished difference. Result has 83 places, 103 transitions, 829 flow [2022-12-12 14:42:21,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=829, PETRI_PLACES=83, PETRI_TRANSITIONS=103} [2022-12-12 14:42:21,568 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 11 predicate places. [2022-12-12 14:42:21,568 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 103 transitions, 829 flow [2022-12-12 14:42:21,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:42:21,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:21,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:21,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:42:21,568 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -617583939, now seen corresponding path program 1 times [2022-12-12 14:42:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:21,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941670218] [2022-12-12 14:42:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:22,787 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-12 14:42:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941670218] [2022-12-12 14:42:22,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941670218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:22,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 14:42:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726517627] [2022-12-12 14:42:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 14:42:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 14:42:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-12 14:42:22,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:22,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 103 transitions, 829 flow. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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-12 14:42:22,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:22,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:22,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:23,246 INFO L130 PetriNetUnfolder]: 896/1721 cut-off events. [2022-12-12 14:42:23,246 INFO L131 PetriNetUnfolder]: For 5725/5880 co-relation queries the response was YES. [2022-12-12 14:42:23,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 1721 events. 896/1721 cut-off events. For 5725/5880 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9964 event pairs, 100 based on Foata normal form. 117/1540 useless extension candidates. Maximal degree in co-relation 7996. Up to 696 conditions per place. [2022-12-12 14:42:23,258 INFO L137 encePairwiseOnDemand]: 56/63 looper letters, 101 selfloop transitions, 14 changer transitions 36/166 dead transitions. [2022-12-12 14:42:23,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 166 transitions, 1589 flow [2022-12-12 14:42:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:42:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:42:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-12-12 14:42:23,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2896825396825397 [2022-12-12 14:42:23,260 INFO L175 Difference]: Start difference. First operand has 83 places, 103 transitions, 829 flow. Second operand 8 states and 146 transitions. [2022-12-12 14:42:23,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 166 transitions, 1589 flow [2022-12-12 14:42:23,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 166 transitions, 1414 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-12 14:42:23,295 INFO L231 Difference]: Finished difference. Result has 88 places, 101 transitions, 760 flow [2022-12-12 14:42:23,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=88, PETRI_TRANSITIONS=101} [2022-12-12 14:42:23,296 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2022-12-12 14:42:23,296 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 101 transitions, 760 flow [2022-12-12 14:42:23,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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-12 14:42:23,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:23,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:23,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:42:23,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1243477777, now seen corresponding path program 1 times [2022-12-12 14:42:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:23,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404373751] [2022-12-12 14:42:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:23,711 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-12 14:42:23,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:23,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404373751] [2022-12-12 14:42:23,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404373751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:23,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:23,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:42:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126578922] [2022-12-12 14:42:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:23,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:42:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:23,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:42:23,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:42:23,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:23,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 101 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-12 14:42:23,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:23,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:23,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:24,098 INFO L130 PetriNetUnfolder]: 1118/2132 cut-off events. [2022-12-12 14:42:24,098 INFO L131 PetriNetUnfolder]: For 6564/6711 co-relation queries the response was YES. [2022-12-12 14:42:24,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9002 conditions, 2132 events. 1118/2132 cut-off events. For 6564/6711 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12930 event pairs, 203 based on Foata normal form. 139/1892 useless extension candidates. Maximal degree in co-relation 8973. Up to 1049 conditions per place. [2022-12-12 14:42:24,108 INFO L137 encePairwiseOnDemand]: 54/63 looper letters, 74 selfloop transitions, 22 changer transitions 61/172 dead transitions. [2022-12-12 14:42:24,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 172 transitions, 1560 flow [2022-12-12 14:42:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-12 14:42:24,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328042328042328 [2022-12-12 14:42:24,109 INFO L175 Difference]: Start difference. First operand has 88 places, 101 transitions, 760 flow. Second operand 6 states and 124 transitions. [2022-12-12 14:42:24,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 172 transitions, 1560 flow [2022-12-12 14:42:24,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 172 transitions, 1517 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:24,159 INFO L231 Difference]: Finished difference. Result has 88 places, 102 transitions, 826 flow [2022-12-12 14:42:24,160 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2022-12-12 14:42:24,160 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2022-12-12 14:42:24,160 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 826 flow [2022-12-12 14:42:24,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-12 14:42:24,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:24,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:24,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:42:24,161 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1518236751, now seen corresponding path program 2 times [2022-12-12 14:42:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:24,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275467] [2022-12-12 14:42:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:24,751 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-12 14:42:24,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:24,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275467] [2022-12-12 14:42:24,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:24,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:24,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694176314] [2022-12-12 14:42:24,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:24,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:24,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:24,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:24,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 826 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:24,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:24,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:24,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:25,277 INFO L130 PetriNetUnfolder]: 1398/2627 cut-off events. [2022-12-12 14:42:25,277 INFO L131 PetriNetUnfolder]: For 8476/8643 co-relation queries the response was YES. [2022-12-12 14:42:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11286 conditions, 2627 events. 1398/2627 cut-off events. For 8476/8643 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16820 event pairs, 47 based on Foata normal form. 155/2275 useless extension candidates. Maximal degree in co-relation 11257. Up to 991 conditions per place. [2022-12-12 14:42:25,290 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 109 selfloop transitions, 43 changer transitions 49/216 dead transitions. [2022-12-12 14:42:25,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 216 transitions, 1995 flow [2022-12-12 14:42:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:42:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:42:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-12-12 14:42:25,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32341269841269843 [2022-12-12 14:42:25,292 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 826 flow. Second operand 8 states and 163 transitions. [2022-12-12 14:42:25,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 216 transitions, 1995 flow [2022-12-12 14:42:25,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 216 transitions, 1928 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-12 14:42:25,356 INFO L231 Difference]: Finished difference. Result has 93 places, 119 transitions, 1133 flow [2022-12-12 14:42:25,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1133, PETRI_PLACES=93, PETRI_TRANSITIONS=119} [2022-12-12 14:42:25,356 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 21 predicate places. [2022-12-12 14:42:25,357 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 119 transitions, 1133 flow [2022-12-12 14:42:25,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:25,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:25,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:25,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 14:42:25,357 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1144374045, now seen corresponding path program 3 times [2022-12-12 14:42:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:25,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300103450] [2022-12-12 14:42:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:26,416 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-12 14:42:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:26,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300103450] [2022-12-12 14:42:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300103450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:26,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:26,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:42:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382586764] [2022-12-12 14:42:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:26,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:42:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:42:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:42:26,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:26,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 119 transitions, 1133 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 14:42:26,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:26,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:26,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:26,889 INFO L130 PetriNetUnfolder]: 1002/1926 cut-off events. [2022-12-12 14:42:26,889 INFO L131 PetriNetUnfolder]: For 9176/9299 co-relation queries the response was YES. [2022-12-12 14:42:26,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 1926 events. 1002/1926 cut-off events. For 9176/9299 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11564 event pairs, 116 based on Foata normal form. 113/1703 useless extension candidates. Maximal degree in co-relation 9351. Up to 926 conditions per place. [2022-12-12 14:42:26,899 INFO L137 encePairwiseOnDemand]: 57/63 looper letters, 108 selfloop transitions, 27 changer transitions 22/172 dead transitions. [2022-12-12 14:42:26,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 172 transitions, 1759 flow [2022-12-12 14:42:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-12 14:42:26,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30385487528344673 [2022-12-12 14:42:26,900 INFO L175 Difference]: Start difference. First operand has 93 places, 119 transitions, 1133 flow. Second operand 7 states and 134 transitions. [2022-12-12 14:42:26,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 172 transitions, 1759 flow [2022-12-12 14:42:26,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 172 transitions, 1685 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-12 14:42:26,939 INFO L231 Difference]: Finished difference. Result has 94 places, 119 transitions, 1181 flow [2022-12-12 14:42:26,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1181, PETRI_PLACES=94, PETRI_TRANSITIONS=119} [2022-12-12 14:42:26,939 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2022-12-12 14:42:26,940 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 119 transitions, 1181 flow [2022-12-12 14:42:26,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 14:42:26,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:26,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:26,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 14:42:26,940 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 474441185, now seen corresponding path program 4 times [2022-12-12 14:42:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705679322] [2022-12-12 14:42:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:28,126 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-12 14:42:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705679322] [2022-12-12 14:42:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705679322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:28,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:28,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:42:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673695514] [2022-12-12 14:42:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:28,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:42:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:42:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:42:28,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:28,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 119 transitions, 1181 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 14:42:28,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:28,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:28,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:28,636 INFO L130 PetriNetUnfolder]: 1368/2566 cut-off events. [2022-12-12 14:42:28,636 INFO L131 PetriNetUnfolder]: For 10957/11155 co-relation queries the response was YES. [2022-12-12 14:42:28,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11956 conditions, 2566 events. 1368/2566 cut-off events. For 10957/11155 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16212 event pairs, 163 based on Foata normal form. 174/2252 useless extension candidates. Maximal degree in co-relation 11923. Up to 1108 conditions per place. [2022-12-12 14:42:28,653 INFO L137 encePairwiseOnDemand]: 54/63 looper letters, 113 selfloop transitions, 20 changer transitions 38/186 dead transitions. [2022-12-12 14:42:28,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 186 transitions, 1967 flow [2022-12-12 14:42:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-12 14:42:28,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29705215419501135 [2022-12-12 14:42:28,661 INFO L175 Difference]: Start difference. First operand has 94 places, 119 transitions, 1181 flow. Second operand 7 states and 131 transitions. [2022-12-12 14:42:28,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 186 transitions, 1967 flow [2022-12-12 14:42:28,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 186 transitions, 1916 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:28,722 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 1072 flow [2022-12-12 14:42:28,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1072, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2022-12-12 14:42:28,723 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 25 predicate places. [2022-12-12 14:42:28,723 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1072 flow [2022-12-12 14:42:28,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 14:42:28,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:28,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:28,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-12 14:42:28,724 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash -978855811, now seen corresponding path program 5 times [2022-12-12 14:42:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:28,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800159776] [2022-12-12 14:42:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:28,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:29,918 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-12 14:42:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800159776] [2022-12-12 14:42:29,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800159776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:29,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:29,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 14:42:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463470867] [2022-12-12 14:42:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:29,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 14:42:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 14:42:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-12 14:42:29,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:29,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1072 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-12 14:42:29,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:29,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:30,439 INFO L130 PetriNetUnfolder]: 1341/2503 cut-off events. [2022-12-12 14:42:30,439 INFO L131 PetriNetUnfolder]: For 11330/11491 co-relation queries the response was YES. [2022-12-12 14:42:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11630 conditions, 2503 events. 1341/2503 cut-off events. For 11330/11491 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 15973 event pairs, 167 based on Foata normal form. 133/2150 useless extension candidates. Maximal degree in co-relation 11595. Up to 1371 conditions per place. [2022-12-12 14:42:30,451 INFO L137 encePairwiseOnDemand]: 55/63 looper letters, 108 selfloop transitions, 21 changer transitions 35/179 dead transitions. [2022-12-12 14:42:30,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 179 transitions, 1894 flow [2022-12-12 14:42:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:42:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:42:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-12 14:42:30,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29563492063492064 [2022-12-12 14:42:30,453 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 1072 flow. Second operand 8 states and 149 transitions. [2022-12-12 14:42:30,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 179 transitions, 1894 flow [2022-12-12 14:42:30,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 179 transitions, 1759 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-12 14:42:30,504 INFO L231 Difference]: Finished difference. Result has 95 places, 112 transitions, 1074 flow [2022-12-12 14:42:30,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1074, PETRI_PLACES=95, PETRI_TRANSITIONS=112} [2022-12-12 14:42:30,504 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2022-12-12 14:42:30,504 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 112 transitions, 1074 flow [2022-12-12 14:42:30,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-12 14:42:30,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:30,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:30,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-12 14:42:30,505 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1884631871, now seen corresponding path program 6 times [2022-12-12 14:42:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:30,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080624418] [2022-12-12 14:42:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:31,500 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-12 14:42:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:31,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080624418] [2022-12-12 14:42:31,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080624418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:31,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:31,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 14:42:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004734113] [2022-12-12 14:42:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 14:42:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:31,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 14:42:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 14:42:31,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:31,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 112 transitions, 1074 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:31,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:31,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:31,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:31,967 INFO L130 PetriNetUnfolder]: 1432/2674 cut-off events. [2022-12-12 14:42:31,968 INFO L131 PetriNetUnfolder]: For 10879/11083 co-relation queries the response was YES. [2022-12-12 14:42:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12181 conditions, 2674 events. 1432/2674 cut-off events. For 10879/11083 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 17263 event pairs, 325 based on Foata normal form. 162/2297 useless extension candidates. Maximal degree in co-relation 12147. Up to 1308 conditions per place. [2022-12-12 14:42:31,980 INFO L137 encePairwiseOnDemand]: 56/63 looper letters, 87 selfloop transitions, 16 changer transitions 44/162 dead transitions. [2022-12-12 14:42:31,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 162 transitions, 1710 flow [2022-12-12 14:42:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-12 14:42:31,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2834467120181406 [2022-12-12 14:42:31,982 INFO L175 Difference]: Start difference. First operand has 95 places, 112 transitions, 1074 flow. Second operand 7 states and 125 transitions. [2022-12-12 14:42:31,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 162 transitions, 1710 flow [2022-12-12 14:42:32,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1644 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-12 14:42:32,040 INFO L231 Difference]: Finished difference. Result has 97 places, 103 transitions, 970 flow [2022-12-12 14:42:32,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=970, PETRI_PLACES=97, PETRI_TRANSITIONS=103} [2022-12-12 14:42:32,041 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 25 predicate places. [2022-12-12 14:42:32,041 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 970 flow [2022-12-12 14:42:32,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:32,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:32,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:32,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-12 14:42:32,042 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash 364541583, now seen corresponding path program 7 times [2022-12-12 14:42:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:32,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215748526] [2022-12-12 14:42:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:33,032 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-12 14:42:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215748526] [2022-12-12 14:42:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215748526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:33,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 14:42:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660601527] [2022-12-12 14:42:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:33,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 14:42:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 14:42:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-12 14:42:33,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:33,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 970 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-12 14:42:33,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:33,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:33,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:33,645 INFO L130 PetriNetUnfolder]: 1265/2390 cut-off events. [2022-12-12 14:42:33,645 INFO L131 PetriNetUnfolder]: For 8253/8416 co-relation queries the response was YES. [2022-12-12 14:42:33,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10382 conditions, 2390 events. 1265/2390 cut-off events. For 8253/8416 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15297 event pairs, 61 based on Foata normal form. 134/2031 useless extension candidates. Maximal degree in co-relation 10347. Up to 789 conditions per place. [2022-12-12 14:42:33,657 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 144 selfloop transitions, 40 changer transitions 27/226 dead transitions. [2022-12-12 14:42:33,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 226 transitions, 2098 flow [2022-12-12 14:42:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 14:42:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 14:42:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2022-12-12 14:42:33,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2972582972582973 [2022-12-12 14:42:33,659 INFO L175 Difference]: Start difference. First operand has 97 places, 103 transitions, 970 flow. Second operand 11 states and 206 transitions. [2022-12-12 14:42:33,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 226 transitions, 2098 flow [2022-12-12 14:42:33,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 226 transitions, 2023 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-12 14:42:33,705 INFO L231 Difference]: Finished difference. Result has 100 places, 107 transitions, 1041 flow [2022-12-12 14:42:33,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1041, PETRI_PLACES=100, PETRI_TRANSITIONS=107} [2022-12-12 14:42:33,705 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 28 predicate places. [2022-12-12 14:42:33,706 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 1041 flow [2022-12-12 14:42:33,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-12 14:42:33,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:33,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:33,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-12 14:42:33,706 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 809377099, now seen corresponding path program 8 times [2022-12-12 14:42:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:33,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566128668] [2022-12-12 14:42:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:34,611 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-12 14:42:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:34,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566128668] [2022-12-12 14:42:34,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566128668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:34,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:34,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 14:42:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124211689] [2022-12-12 14:42:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:34,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 14:42:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 14:42:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 14:42:34,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:34,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 1041 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:34,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:34,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:34,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:35,472 INFO L130 PetriNetUnfolder]: 1786/3321 cut-off events. [2022-12-12 14:42:35,473 INFO L131 PetriNetUnfolder]: For 11556/11805 co-relation queries the response was YES. [2022-12-12 14:42:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 3321 events. 1786/3321 cut-off events. For 11556/11805 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 22600 event pairs, 84 based on Foata normal form. 205/2808 useless extension candidates. Maximal degree in co-relation 14530. Up to 1201 conditions per place. [2022-12-12 14:42:35,493 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 178 selfloop transitions, 58 changer transitions 29/280 dead transitions. [2022-12-12 14:42:35,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 280 transitions, 2626 flow [2022-12-12 14:42:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 14:42:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 14:42:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 306 transitions. [2022-12-12 14:42:35,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-12 14:42:35,495 INFO L175 Difference]: Start difference. First operand has 100 places, 107 transitions, 1041 flow. Second operand 17 states and 306 transitions. [2022-12-12 14:42:35,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 280 transitions, 2626 flow [2022-12-12 14:42:35,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 280 transitions, 2530 flow, removed 25 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:35,575 INFO L231 Difference]: Finished difference. Result has 111 places, 121 transitions, 1291 flow [2022-12-12 14:42:35,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1291, PETRI_PLACES=111, PETRI_TRANSITIONS=121} [2022-12-12 14:42:35,576 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 39 predicate places. [2022-12-12 14:42:35,576 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 121 transitions, 1291 flow [2022-12-12 14:42:35,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:35,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:35,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:35,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-12 14:42:35,576 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1090978125, now seen corresponding path program 9 times [2022-12-12 14:42:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129497960] [2022-12-12 14:42:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:36,195 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-12 14:42:36,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:36,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129497960] [2022-12-12 14:42:36,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129497960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:36,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:36,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804241705] [2022-12-12 14:42:36,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:36,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:36,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:36,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 121 transitions, 1291 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:36,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:36,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:36,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:36,744 INFO L130 PetriNetUnfolder]: 2239/4163 cut-off events. [2022-12-12 14:42:36,744 INFO L131 PetriNetUnfolder]: For 13847/14139 co-relation queries the response was YES. [2022-12-12 14:42:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17734 conditions, 4163 events. 2239/4163 cut-off events. For 13847/14139 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 30020 event pairs, 84 based on Foata normal form. 239/3465 useless extension candidates. Maximal degree in co-relation 17697. Up to 1538 conditions per place. [2022-12-12 14:42:36,768 INFO L137 encePairwiseOnDemand]: 55/63 looper letters, 107 selfloop transitions, 31 changer transitions 50/203 dead transitions. [2022-12-12 14:42:36,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 203 transitions, 2132 flow [2022-12-12 14:42:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-12 14:42:36,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-12 14:42:36,769 INFO L175 Difference]: Start difference. First operand has 111 places, 121 transitions, 1291 flow. Second operand 7 states and 135 transitions. [2022-12-12 14:42:36,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 203 transitions, 2132 flow [2022-12-12 14:42:36,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 203 transitions, 2015 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-12 14:42:36,876 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 1086 flow [2022-12-12 14:42:36,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1086, PETRI_PLACES=110, PETRI_TRANSITIONS=109} [2022-12-12 14:42:36,877 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 38 predicate places. [2022-12-12 14:42:36,877 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 1086 flow [2022-12-12 14:42:36,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:36,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:36,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:36,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-12 14:42:36,877 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1199718923, now seen corresponding path program 10 times [2022-12-12 14:42:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:36,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436853754] [2022-12-12 14:42:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:37,263 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-12 14:42:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436853754] [2022-12-12 14:42:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436853754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:37,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:37,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:37,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812230451] [2022-12-12 14:42:37,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:37,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:37,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:37,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 1086 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:37,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:37,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:37,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:37,692 INFO L130 PetriNetUnfolder]: 1655/3120 cut-off events. [2022-12-12 14:42:37,692 INFO L131 PetriNetUnfolder]: For 10653/10884 co-relation queries the response was YES. [2022-12-12 14:42:37,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13526 conditions, 3120 events. 1655/3120 cut-off events. For 10653/10884 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 21852 event pairs, 306 based on Foata normal form. 177/2578 useless extension candidates. Maximal degree in co-relation 13489. Up to 1803 conditions per place. [2022-12-12 14:42:37,713 INFO L137 encePairwiseOnDemand]: 57/63 looper letters, 88 selfloop transitions, 2 changer transitions 57/161 dead transitions. [2022-12-12 14:42:37,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 161 transitions, 1723 flow [2022-12-12 14:42:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:42:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:42:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-12 14:42:37,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.272108843537415 [2022-12-12 14:42:37,715 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 1086 flow. Second operand 7 states and 120 transitions. [2022-12-12 14:42:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 161 transitions, 1723 flow [2022-12-12 14:42:37,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 161 transitions, 1589 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-12 14:42:37,788 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 922 flow [2022-12-12 14:42:37,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=922, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2022-12-12 14:42:37,788 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 36 predicate places. [2022-12-12 14:42:37,788 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 922 flow [2022-12-12 14:42:37,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:37,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:37,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:37,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-12 14:42:37,789 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1285594111, now seen corresponding path program 11 times [2022-12-12 14:42:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439971706] [2022-12-12 14:42:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439971706] [2022-12-12 14:42:38,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439971706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:38,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:38,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:42:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724587667] [2022-12-12 14:42:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:38,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:42:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:42:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:42:38,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:38,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 922 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:38,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:38,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:38,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:38,808 INFO L130 PetriNetUnfolder]: 1603/3013 cut-off events. [2022-12-12 14:42:38,809 INFO L131 PetriNetUnfolder]: For 8064/8268 co-relation queries the response was YES. [2022-12-12 14:42:38,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 3013 events. 1603/3013 cut-off events. For 8064/8268 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 20983 event pairs, 267 based on Foata normal form. 151/2466 useless extension candidates. Maximal degree in co-relation 12344. Up to 1705 conditions per place. [2022-12-12 14:42:38,822 INFO L137 encePairwiseOnDemand]: 54/63 looper letters, 83 selfloop transitions, 16 changer transitions 32/145 dead transitions. [2022-12-12 14:42:38,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 1494 flow [2022-12-12 14:42:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-12 14:42:38,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2671957671957672 [2022-12-12 14:42:38,823 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 922 flow. Second operand 6 states and 101 transitions. [2022-12-12 14:42:38,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 1494 flow [2022-12-12 14:42:38,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 1432 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-12-12 14:42:38,867 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 970 flow [2022-12-12 14:42:38,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=970, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2022-12-12 14:42:38,868 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 25 predicate places. [2022-12-12 14:42:38,868 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 970 flow [2022-12-12 14:42:38,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-12 14:42:38,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:38,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:38,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-12 14:42:38,868 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 864160081, now seen corresponding path program 12 times [2022-12-12 14:42:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:38,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491701916] [2022-12-12 14:42:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:39,396 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-12 14:42:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:39,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491701916] [2022-12-12 14:42:39,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491701916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:39,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:39,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 14:42:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657738038] [2022-12-12 14:42:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:39,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 14:42:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:39,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 14:42:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 14:42:39,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:39,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 970 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-12 14:42:39,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:39,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:39,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:40,088 INFO L130 PetriNetUnfolder]: 1944/3639 cut-off events. [2022-12-12 14:42:40,088 INFO L131 PetriNetUnfolder]: For 8648/8950 co-relation queries the response was YES. [2022-12-12 14:42:40,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 3639 events. 1944/3639 cut-off events. For 8648/8950 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 26292 event pairs, 207 based on Foata normal form. 218/2997 useless extension candidates. Maximal degree in co-relation 14903. Up to 1377 conditions per place. [2022-12-12 14:42:40,107 INFO L137 encePairwiseOnDemand]: 54/63 looper letters, 83 selfloop transitions, 18 changer transitions 100/213 dead transitions. [2022-12-12 14:42:40,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 2008 flow [2022-12-12 14:42:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 14:42:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 14:42:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2022-12-12 14:42:40,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26587301587301587 [2022-12-12 14:42:40,109 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 970 flow. Second operand 12 states and 201 transitions. [2022-12-12 14:42:40,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 2008 flow [2022-12-12 14:42:40,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 213 transitions, 1936 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:40,163 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 668 flow [2022-12-12 14:42:40,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=668, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2022-12-12 14:42:40,164 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 31 predicate places. [2022-12-12 14:42:40,164 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 668 flow [2022-12-12 14:42:40,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-12 14:42:40,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:40,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-12 14:42:40,165 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -437205379, now seen corresponding path program 13 times [2022-12-12 14:42:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129692655] [2022-12-12 14:42:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:41,230 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-12 14:42:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129692655] [2022-12-12 14:42:41,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129692655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:41,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:41,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 14:42:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834641339] [2022-12-12 14:42:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 14:42:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 14:42:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 14:42:41,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:41,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 668 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:41,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:41,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:41,611 INFO L130 PetriNetUnfolder]: 1287/2453 cut-off events. [2022-12-12 14:42:41,611 INFO L131 PetriNetUnfolder]: For 5285/5472 co-relation queries the response was YES. [2022-12-12 14:42:41,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 2453 events. 1287/2453 cut-off events. For 5285/5472 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 17321 event pairs, 54 based on Foata normal form. 152/2012 useless extension candidates. Maximal degree in co-relation 9773. Up to 1192 conditions per place. [2022-12-12 14:42:41,622 INFO L137 encePairwiseOnDemand]: 56/63 looper letters, 72 selfloop transitions, 13 changer transitions 22/119 dead transitions. [2022-12-12 14:42:41,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 119 transitions, 1109 flow [2022-12-12 14:42:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-12 14:42:41,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-12 14:42:41,624 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 668 flow. Second operand 6 states and 102 transitions. [2022-12-12 14:42:41,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 119 transitions, 1109 flow [2022-12-12 14:42:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 1024 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-12-12 14:42:41,647 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 599 flow [2022-12-12 14:42:41,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2022-12-12 14:42:41,648 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 13 predicate places. [2022-12-12 14:42:41,648 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 599 flow [2022-12-12 14:42:41,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:41,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:41,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:41,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-12 14:42:41,648 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -41866757, now seen corresponding path program 14 times [2022-12-12 14:42:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:41,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955456180] [2022-12-12 14:42:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:42:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:42:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:42:42,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955456180] [2022-12-12 14:42:42,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955456180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:42:42,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:42:42,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 14:42:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979299112] [2022-12-12 14:42:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:42:42,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 14:42:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:42:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 14:42:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-12 14:42:42,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-12 14:42:42,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 599 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:42,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:42:42,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-12 14:42:42,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:42:43,043 INFO L130 PetriNetUnfolder]: 1010/2073 cut-off events. [2022-12-12 14:42:43,043 INFO L131 PetriNetUnfolder]: For 4297/4416 co-relation queries the response was YES. [2022-12-12 14:42:43,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 2073 events. 1010/2073 cut-off events. For 4297/4416 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 15091 event pairs, 94 based on Foata normal form. 94/1667 useless extension candidates. Maximal degree in co-relation 7980. Up to 925 conditions per place. [2022-12-12 14:42:43,050 INFO L137 encePairwiseOnDemand]: 56/63 looper letters, 53 selfloop transitions, 4 changer transitions 43/112 dead transitions. [2022-12-12 14:42:43,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 112 transitions, 997 flow [2022-12-12 14:42:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:42:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:42:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-12 14:42:43,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-12 14:42:43,052 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 599 flow. Second operand 6 states and 105 transitions. [2022-12-12 14:42:43,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 112 transitions, 997 flow [2022-12-12 14:42:43,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 958 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-12 14:42:43,069 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 437 flow [2022-12-12 14:42:43,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2022-12-12 14:42:43,070 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 13 predicate places. [2022-12-12 14:42:43,070 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 437 flow [2022-12-12 14:42:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-12 14:42:43,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:42:43,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:43,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-12 14:42:43,071 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:42:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:42:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1055846195, now seen corresponding path program 15 times [2022-12-12 14:42:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:42:43,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533721415] [2022-12-12 14:42:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:42:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:42:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:42:43,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:42:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:42:43,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:42:43,203 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:42:43,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:42:43,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:42:43,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:42:43,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:42:43,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:42:43,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:42:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-12 14:42:43,210 INFO L445 BasicCegarLoop]: Path program histogram: [15, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:42:43,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:42:43,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:42:43,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:42:43 BasicIcfg [2022-12-12 14:42:43,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:42:43,308 INFO L158 Benchmark]: Toolchain (without parser) took 51825.53ms. Allocated memory was 202.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 177.5MB in the beginning and 671.6MB in the end (delta: -494.1MB). Peak memory consumption was 771.0MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,308 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 202.4MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:42:43,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.62ms. Allocated memory is still 202.4MB. Free memory was 177.5MB in the beginning and 148.3MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.02ms. Allocated memory is still 202.4MB. Free memory was 148.3MB in the beginning and 145.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,309 INFO L158 Benchmark]: Boogie Preprocessor took 46.33ms. Allocated memory is still 202.4MB. Free memory was 145.2MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,310 INFO L158 Benchmark]: RCFGBuilder took 899.98ms. Allocated memory was 202.4MB in the beginning and 280.0MB in the end (delta: 77.6MB). Free memory was 143.0MB in the beginning and 246.7MB in the end (delta: -103.7MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,310 INFO L158 Benchmark]: TraceAbstraction took 50198.97ms. Allocated memory was 280.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 245.7MB in the beginning and 671.6MB in the end (delta: -425.9MB). Peak memory consumption was 761.6MB. Max. memory is 8.0GB. [2022-12-12 14:42:43,311 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.16ms. Allocated memory is still 202.4MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 602.62ms. Allocated memory is still 202.4MB. Free memory was 177.5MB in the beginning and 148.3MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.02ms. Allocated memory is still 202.4MB. Free memory was 148.3MB in the beginning and 145.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.33ms. Allocated memory is still 202.4MB. Free memory was 145.2MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 899.98ms. Allocated memory was 202.4MB in the beginning and 280.0MB in the end (delta: 77.6MB). Free memory was 143.0MB in the beginning and 246.7MB in the end (delta: -103.7MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 50198.97ms. Allocated memory was 280.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 245.7MB in the beginning and 671.6MB in the end (delta: -425.9MB). Peak memory consumption was 761.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 114 PlacesBefore, 72 PlacesAfterwards, 106 TransitionsBefore, 63 TransitionsAfterwards, 2022 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 2892, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1819, independent: 1761, independent conditional: 0, independent unconditional: 1761, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1819, independent: 1746, independent conditional: 0, independent unconditional: 1746, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 541, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 509, dependent conditional: 0, dependent unconditional: 509, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3019, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1819, unknown conditional: 0, unknown unconditional: 1819] , Statistics on independence cache: Total cache size (in pairs): 3487, Positive cache size: 3429, Positive conditional cache size: 0, Positive unconditional cache size: 3429, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1812 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1812 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4458 IncrementalHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 3 mSDtfsCounter, 4458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1418occurred in iteration=11, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 8131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:42:43,337 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...