/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:04:41,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:04:41,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:04:41,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:04:41,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:04:41,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:04:41,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:04:41,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:04:41,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:04:41,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:04:41,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:04:41,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:04:41,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:04:41,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:04:41,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:04:41,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:04:41,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:04:41,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:04:41,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:04:41,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:04:41,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:04:41,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:04:41,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:04:41,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:04:41,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:04:41,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:04:41,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:04:41,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:04:41,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:04:41,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:04:41,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:04:41,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:04:41,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:04:41,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:04:41,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:04:41,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:04:41,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:04:41,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:04:41,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:04:41,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:04:41,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:04:41,749 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-NoLbe.epf [2022-12-12 12:04:41,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:04:41,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:04:41,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:04:41,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:04:41,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:04:41,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:04:41,785 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:04:41,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:04:41,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:04:41,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:04:41,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:04:41,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:04:41,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:04:41,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:04:41,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:04:41,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:04:41,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:04:41,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:04:41,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:04:41,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:04:41,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:04:41,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:04:41,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:04:41,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:04:41,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:04:41,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:04:41,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 12:04:42,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:04:42,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:04:42,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:04:42,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:04:42,122 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:04:42,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-12 12:04:43,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:04:43,481 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:04:43,482 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-12 12:04:43,502 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203588d7c/4ef4c2306ac04dcfbde01dea8def1088/FLAGd85e6ef55 [2022-12-12 12:04:43,520 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203588d7c/4ef4c2306ac04dcfbde01dea8def1088 [2022-12-12 12:04:43,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:04:43,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:04:43,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:04:43,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:04:43,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:04:43,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:04:43" (1/1) ... [2022-12-12 12:04:43,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a866186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:43, skipping insertion in model container [2022-12-12 12:04:43,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:04:43" (1/1) ... [2022-12-12 12:04:43,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:04:43,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:04:43,756 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 12:04:43,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:43,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:43,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:04:44,016 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:04:44,029 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 12:04:44,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:44,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:44,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:04:44,142 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:04:44,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44 WrapperNode [2022-12-12 12:04:44,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:04:44,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:04:44,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:04:44,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:04:44,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,214 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-12 12:04:44,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:04:44,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:04:44,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:04:44,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:04:44,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,251 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:04:44,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:04:44,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:04:44,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:04:44,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (1/1) ... [2022-12-12 12:04:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:04:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:04:44,306 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 12:04:44,314 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 12:04:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:04:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:04:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:04:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:04:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:04:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 12:04:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 12:04:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 12:04:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 12:04:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 12:04:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 12:04:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:04:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:04:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:04:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:04:44,348 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 12:04:44,474 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:04:44,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:04:44,764 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:04:44,917 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:04:44,917 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 12:04:44,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:04:44 BoogieIcfgContainer [2022-12-12 12:04:44,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:04:44,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:04:44,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:04:44,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:04:44,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:04:43" (1/3) ... [2022-12-12 12:04:44,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce4e2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:04:44, skipping insertion in model container [2022-12-12 12:04:44,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:44" (2/3) ... [2022-12-12 12:04:44,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce4e2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:04:44, skipping insertion in model container [2022-12-12 12:04:44,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:04:44" (3/3) ... [2022-12-12 12:04:44,933 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-12 12:04:44,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:04:44,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 12:04:44,950 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:04:45,038 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 12:04:45,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-12 12:04:45,152 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-12 12:04:45,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:04:45,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 12:04:45,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-12 12:04:45,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-12 12:04:45,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:04:45,177 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;@6a709232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:04:45,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 12:04:45,201 INFO L130 PetriNetUnfolder]: 0/67 cut-off events. [2022-12-12 12:04:45,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:04:45,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:45,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:45,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2011799754, now seen corresponding path program 1 times [2022-12-12 12:04:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232281867] [2022-12-12 12:04:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:45,846 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 12:04:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232281867] [2022-12-12 12:04:45,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232281867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:45,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:45,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:04:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302149838] [2022-12-12 12:04:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:45,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:04:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:04:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:04:45,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2022-12-12 12:04:45,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 12:04:45,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:45,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2022-12-12 12:04:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:46,046 INFO L130 PetriNetUnfolder]: 17/219 cut-off events. [2022-12-12 12:04:46,047 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 12:04:46,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 219 events. 17/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 668 event pairs, 7 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 224. Up to 27 conditions per place. [2022-12-12 12:04:46,052 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-12 12:04:46,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 235 flow [2022-12-12 12:04:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:04:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:04:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2022-12-12 12:04:46,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9301587301587302 [2022-12-12 12:04:46,074 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2022-12-12 12:04:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 235 flow [2022-12-12 12:04:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 228 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 12:04:46,081 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 228 flow [2022-12-12 12:04:46,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 12:04:46,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:46,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:04:46,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1074363893, now seen corresponding path program 1 times [2022-12-12 12:04:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:46,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584844846] [2022-12-12 12:04:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:46,564 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 12:04:46,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:46,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584844846] [2022-12-12 12:04:46,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584844846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:46,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:46,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:04:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928302741] [2022-12-12 12:04:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:46,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:04:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:04:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:04:46,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2022-12-12 12:04:46,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 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 12:04:46,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:46,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2022-12-12 12:04:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:46,982 INFO L130 PetriNetUnfolder]: 282/892 cut-off events. [2022-12-12 12:04:46,982 INFO L131 PetriNetUnfolder]: For 160/248 co-relation queries the response was YES. [2022-12-12 12:04:46,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 892 events. 282/892 cut-off events. For 160/248 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5893 event pairs, 38 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1559. Up to 249 conditions per place. [2022-12-12 12:04:46,994 INFO L137 encePairwiseOnDemand]: 98/105 looper letters, 25 selfloop transitions, 3 changer transitions 53/153 dead transitions. [2022-12-12 12:04:46,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 538 flow [2022-12-12 12:04:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:04:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:04:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2022-12-12 12:04:47,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8656084656084656 [2022-12-12 12:04:47,000 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2022-12-12 12:04:47,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 538 flow [2022-12-12 12:04:47,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 153 transitions, 534 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 12:04:47,007 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 153 transitions, 534 flow [2022-12-12 12:04:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 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 12:04:47,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:47,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:47,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:04:47,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 594987084, now seen corresponding path program 1 times [2022-12-12 12:04:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:47,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238337312] [2022-12-12 12:04:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:47,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:48,269 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 12:04:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238337312] [2022-12-12 12:04:48,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238337312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:48,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-12 12:04:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989764] [2022-12-12 12:04:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:48,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 12:04:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 12:04:48,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-12 12:04:48,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-12 12:04:48,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 153 transitions, 534 flow. Second operand has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 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 12:04:48,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:48,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-12 12:04:48,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:50,161 INFO L130 PetriNetUnfolder]: 2736/7392 cut-off events. [2022-12-12 12:04:50,162 INFO L131 PetriNetUnfolder]: For 1817/4703 co-relation queries the response was YES. [2022-12-12 12:04:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16003 conditions, 7392 events. 2736/7392 cut-off events. For 1817/4703 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 73050 event pairs, 48 based on Foata normal form. 18/7296 useless extension candidates. Maximal degree in co-relation 15946. Up to 1653 conditions per place. [2022-12-12 12:04:50,199 INFO L137 encePairwiseOnDemand]: 86/105 looper letters, 51 selfloop transitions, 37 changer transitions 322/471 dead transitions. [2022-12-12 12:04:50,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 471 transitions, 2742 flow [2022-12-12 12:04:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-12 12:04:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-12 12:04:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1871 transitions. [2022-12-12 12:04:50,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7747412008281573 [2022-12-12 12:04:50,205 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 27 predicate places. [2022-12-12 12:04:50,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 471 transitions, 2742 flow [2022-12-12 12:04:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 471 transitions, 2666 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-12 12:04:50,218 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 471 transitions, 2666 flow [2022-12-12 12:04:50,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.81818181818181) internal successors, (823), 11 states have internal predecessors, (823), 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 12:04:50,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:50,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:50,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:04:50,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1733056795, now seen corresponding path program 1 times [2022-12-12 12:04:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:50,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154460479] [2022-12-12 12:04:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:50,927 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 12:04:50,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:50,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154460479] [2022-12-12 12:04:50,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154460479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:50,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:50,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:04:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951186458] [2022-12-12 12:04:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:04:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:04:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:04:50,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-12-12 12:04:50,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 471 transitions, 2666 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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 12:04:50,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:50,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-12-12 12:04:50,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:52,757 INFO L130 PetriNetUnfolder]: 4032/11667 cut-off events. [2022-12-12 12:04:52,757 INFO L131 PetriNetUnfolder]: For 3592/9004 co-relation queries the response was YES. [2022-12-12 12:04:52,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31058 conditions, 11667 events. 4032/11667 cut-off events. For 3592/9004 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 131120 event pairs, 14 based on Foata normal form. 78/11636 useless extension candidates. Maximal degree in co-relation 30996. Up to 2778 conditions per place. [2022-12-12 12:04:52,809 INFO L137 encePairwiseOnDemand]: 90/105 looper letters, 95 selfloop transitions, 31 changer transitions 710/897 dead transitions. [2022-12-12 12:04:52,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 897 transitions, 6872 flow [2022-12-12 12:04:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:04:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:04:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1078 transitions. [2022-12-12 12:04:52,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2022-12-12 12:04:52,813 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 37 predicate places. [2022-12-12 12:04:52,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 897 transitions, 6872 flow [2022-12-12 12:04:52,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 897 transitions, 6422 flow, removed 225 selfloop flow, removed 0 redundant places. [2022-12-12 12:04:52,847 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 897 transitions, 6422 flow [2022-12-12 12:04:52,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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 12:04:52,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:52,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:52,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:04:52,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1699686984, now seen corresponding path program 1 times [2022-12-12 12:04:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:52,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100039718] [2022-12-12 12:04:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:54,323 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 12:04:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100039718] [2022-12-12 12:04:54,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100039718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:54,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:54,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:04:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093242786] [2022-12-12 12:04:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:04:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:04:54,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:04:54,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2022-12-12 12:04:54,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 897 transitions, 6422 flow. Second operand has 12 states, 12 states have (on average 75.66666666666667) internal successors, (908), 12 states have internal predecessors, (908), 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 12:04:54,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:54,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2022-12-12 12:04:54,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:57,284 INFO L130 PetriNetUnfolder]: 6424/19331 cut-off events. [2022-12-12 12:04:57,284 INFO L131 PetriNetUnfolder]: For 4841/18421 co-relation queries the response was YES. [2022-12-12 12:04:57,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57540 conditions, 19331 events. 6424/19331 cut-off events. For 4841/18421 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 241332 event pairs, 32 based on Foata normal form. 182/19426 useless extension candidates. Maximal degree in co-relation 57475. Up to 4344 conditions per place. [2022-12-12 12:04:57,350 INFO L137 encePairwiseOnDemand]: 89/105 looper letters, 138 selfloop transitions, 60 changer transitions 1980/2240 dead transitions. [2022-12-12 12:04:57,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 2240 transitions, 20598 flow [2022-12-12 12:04:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-12 12:04:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-12 12:04:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2012 transitions. [2022-12-12 12:04:57,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7664761904761904 [2022-12-12 12:04:57,357 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 61 predicate places. [2022-12-12 12:04:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 2240 transitions, 20598 flow [2022-12-12 12:04:57,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 2240 transitions, 20432 flow, removed 79 selfloop flow, removed 4 redundant places. [2022-12-12 12:04:57,423 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 2240 transitions, 20432 flow [2022-12-12 12:04:57,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.66666666666667) internal successors, (908), 12 states have internal predecessors, (908), 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 12:04:57,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:57,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:57,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:04:57,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:04:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash 955206300, now seen corresponding path program 1 times [2022-12-12 12:04:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:57,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6246011] [2022-12-12 12:04:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:57,647 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 12:04:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6246011] [2022-12-12 12:04:57,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6246011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:57,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:04:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431307152] [2022-12-12 12:04:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:04:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:04:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:04:57,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2022-12-12 12:04:57,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 2240 transitions, 20432 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 12:04:57,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:57,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2022-12-12 12:04:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:01,462 INFO L130 PetriNetUnfolder]: 7914/26316 cut-off events. [2022-12-12 12:05:01,462 INFO L131 PetriNetUnfolder]: For 9524/36873 co-relation queries the response was YES. [2022-12-12 12:05:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86080 conditions, 26316 events. 7914/26316 cut-off events. For 9524/36873 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 363463 event pairs, 49 based on Foata normal form. 147/26366 useless extension candidates. Maximal degree in co-relation 86019. Up to 5599 conditions per place. [2022-12-12 12:05:01,563 INFO L137 encePairwiseOnDemand]: 99/105 looper letters, 136 selfloop transitions, 15 changer transitions 2979/3242 dead transitions. [2022-12-12 12:05:01,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 3242 transitions, 35440 flow [2022-12-12 12:05:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:05:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:05:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 817 transitions. [2022-12-12 12:05:01,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8645502645502645 [2022-12-12 12:05:01,569 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 65 predicate places. [2022-12-12 12:05:01,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 3242 transitions, 35440 flow [2022-12-12 12:05:01,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 3242 transitions, 34970 flow, removed 235 selfloop flow, removed 0 redundant places. [2022-12-12 12:05:01,663 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 3242 transitions, 34970 flow [2022-12-12 12:05:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 12:05:01,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:01,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:05:01,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:05:01,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -309517371, now seen corresponding path program 1 times [2022-12-12 12:05:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:01,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772500831] [2022-12-12 12:05:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:02,014 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 12:05:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772500831] [2022-12-12 12:05:02,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772500831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:02,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:02,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:05:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143233472] [2022-12-12 12:05:02,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:02,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:05:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:02,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:05:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:05:02,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-12-12 12:05:02,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 3242 transitions, 34970 flow. Second operand has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 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 12:05:02,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:02,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-12-12 12:05:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:08,049 INFO L130 PetriNetUnfolder]: 8651/29504 cut-off events. [2022-12-12 12:05:08,050 INFO L131 PetriNetUnfolder]: For 18285/30375 co-relation queries the response was YES. [2022-12-12 12:05:08,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106607 conditions, 29504 events. 8651/29504 cut-off events. For 18285/30375 co-relation queries the response was YES. Maximal size of possible extension queue 2221. Compared 418136 event pairs, 64 based on Foata normal form. 390/29803 useless extension candidates. Maximal degree in co-relation 106543. Up to 9192 conditions per place. [2022-12-12 12:05:08,151 INFO L137 encePairwiseOnDemand]: 96/105 looper letters, 130 selfloop transitions, 23 changer transitions 3600/3873 dead transitions. [2022-12-12 12:05:08,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 3873 transitions, 48874 flow [2022-12-12 12:05:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 12:05:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 12:05:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1227 transitions. [2022-12-12 12:05:08,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8346938775510204 [2022-12-12 12:05:08,157 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 78 predicate places. [2022-12-12 12:05:08,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 3873 transitions, 48874 flow [2022-12-12 12:05:08,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 3873 transitions, 46122 flow, removed 1101 selfloop flow, removed 3 redundant places. [2022-12-12 12:05:08,335 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 3873 transitions, 46122 flow [2022-12-12 12:05:08,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 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 12:05:08,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:08,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:05:08,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:05:08,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1657300972, now seen corresponding path program 1 times [2022-12-12 12:05:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281901706] [2022-12-12 12:05:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:09,210 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 12:05:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281901706] [2022-12-12 12:05:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281901706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:09,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:09,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:05:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833586427] [2022-12-12 12:05:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:09,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:05:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:05:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:05:09,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-12 12:05:09,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 3873 transitions, 46122 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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 12:05:09,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:09,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-12 12:05:09,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:17,960 INFO L130 PetriNetUnfolder]: 10893/38189 cut-off events. [2022-12-12 12:05:17,960 INFO L131 PetriNetUnfolder]: For 31566/96935 co-relation queries the response was YES. [2022-12-12 12:05:18,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148414 conditions, 38189 events. 10893/38189 cut-off events. For 31566/96935 co-relation queries the response was YES. Maximal size of possible extension queue 2985. Compared 571629 event pairs, 19 based on Foata normal form. 371/38462 useless extension candidates. Maximal degree in co-relation 148348. Up to 11135 conditions per place. [2022-12-12 12:05:18,060 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 139 selfloop transitions, 44 changer transitions 5229/5530 dead transitions. [2022-12-12 12:05:18,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 5530 transitions, 77440 flow [2022-12-12 12:05:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 12:05:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 12:05:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1455 transitions. [2022-12-12 12:05:18,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8151260504201681 [2022-12-12 12:05:18,066 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 91 predicate places. [2022-12-12 12:05:18,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 5530 transitions, 77440 flow [2022-12-12 12:05:18,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 5530 transitions, 73899 flow, removed 1768 selfloop flow, removed 3 redundant places. [2022-12-12 12:05:18,208 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 5530 transitions, 73899 flow [2022-12-12 12:05:18,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 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 12:05:18,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:18,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:05:18,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:05:18,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1118935799, now seen corresponding path program 1 times [2022-12-12 12:05:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:18,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798010846] [2022-12-12 12:05:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:18,689 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 12:05:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:18,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798010846] [2022-12-12 12:05:18,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798010846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:18,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:18,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 12:05:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100447546] [2022-12-12 12:05:18,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:18,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 12:05:18,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 12:05:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-12 12:05:18,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-12-12 12:05:18,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 5530 transitions, 73899 flow. Second operand has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 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 12:05:18,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:18,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-12-12 12:05:18,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:05:35,428 INFO L130 PetriNetUnfolder]: 11415/41439 cut-off events. [2022-12-12 12:05:35,430 INFO L131 PetriNetUnfolder]: For 47621/111161 co-relation queries the response was YES. [2022-12-12 12:05:35,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169352 conditions, 41439 events. 11415/41439 cut-off events. For 47621/111161 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 636336 event pairs, 3 based on Foata normal form. 449/41827 useless extension candidates. Maximal degree in co-relation 169284. Up to 11158 conditions per place. [2022-12-12 12:05:35,664 INFO L137 encePairwiseOnDemand]: 94/105 looper letters, 113 selfloop transitions, 44 changer transitions 6180/6455 dead transitions. [2022-12-12 12:05:35,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 6455 transitions, 98303 flow [2022-12-12 12:05:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 12:05:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 12:05:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1363 transitions. [2022-12-12 12:05:35,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8113095238095238 [2022-12-12 12:05:35,684 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 103 predicate places. [2022-12-12 12:05:35,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 6455 transitions, 98303 flow [2022-12-12 12:05:36,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 6455 transitions, 92576 flow, removed 2783 selfloop flow, removed 5 redundant places. [2022-12-12 12:05:36,205 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 6455 transitions, 92576 flow [2022-12-12 12:05:36,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 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 12:05:36,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:05:36,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:05:36,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:05:36,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:05:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:05:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 937859640, now seen corresponding path program 1 times [2022-12-12 12:05:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:05:36,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268562649] [2022-12-12 12:05:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:05:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:05:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:05:37,081 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 12:05:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:05:37,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268562649] [2022-12-12 12:05:37,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268562649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:05:37,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:05:37,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:05:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888233033] [2022-12-12 12:05:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:05:37,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:05:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:05:37,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:05:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:05:37,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-12-12 12:05:37,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 6455 transitions, 92576 flow. Second operand has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 12 states have internal predecessors, (968), 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 12:05:37,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:05:37,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-12-12 12:05:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:06:03,098 INFO L130 PetriNetUnfolder]: 13551/49735 cut-off events. [2022-12-12 12:06:03,099 INFO L131 PetriNetUnfolder]: For 65318/182237 co-relation queries the response was YES. [2022-12-12 12:06:03,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213843 conditions, 49735 events. 13551/49735 cut-off events. For 65318/182237 co-relation queries the response was YES. Maximal size of possible extension queue 4031. Compared 786484 event pairs, 9 based on Foata normal form. 403/50078 useless extension candidates. Maximal degree in co-relation 213772. Up to 14344 conditions per place. [2022-12-12 12:06:03,384 INFO L137 encePairwiseOnDemand]: 93/105 looper letters, 148 selfloop transitions, 27 changer transitions 7975/8266 dead transitions. [2022-12-12 12:06:03,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 8266 transitions, 136162 flow [2022-12-12 12:06:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 12:06:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 12:06:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1587 transitions. [2022-12-12 12:06:03,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7954887218045112 [2022-12-12 12:06:03,410 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 116 predicate places. [2022-12-12 12:06:03,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 8266 transitions, 136162 flow [2022-12-12 12:06:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 8266 transitions, 133264 flow, removed 1391 selfloop flow, removed 4 redundant places. [2022-12-12 12:06:03,995 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 8266 transitions, 133264 flow [2022-12-12 12:06:03,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.66666666666667) internal successors, (968), 12 states have internal predecessors, (968), 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 12:06:03,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:06:03,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:06:03,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 12:06:03,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:06:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:06:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1275835822, now seen corresponding path program 2 times [2022-12-12 12:06:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:06:04,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146729339] [2022-12-12 12:06:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:06:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:06:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:06:05,067 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 12:06:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:06:05,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146729339] [2022-12-12 12:06:05,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146729339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:06:05,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:06:05,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:06:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741709047] [2022-12-12 12:06:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:06:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:06:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:06:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:06:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:06:05,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2022-12-12 12:06:05,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 8266 transitions, 133264 flow. Second operand has 12 states, 12 states have (on average 75.91666666666667) internal successors, (911), 12 states have internal predecessors, (911), 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 12:06:05,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:06:05,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2022-12-12 12:06:05,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:06:37,847 INFO L130 PetriNetUnfolder]: 16123/59297 cut-off events. [2022-12-12 12:06:37,847 INFO L131 PetriNetUnfolder]: For 73672/199317 co-relation queries the response was YES. [2022-12-12 12:06:38,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280891 conditions, 59297 events. 16123/59297 cut-off events. For 73672/199317 co-relation queries the response was YES. Maximal size of possible extension queue 4772. Compared 958861 event pairs, 6 based on Foata normal form. 814/60052 useless extension candidates. Maximal degree in co-relation 280817. Up to 16323 conditions per place. [2022-12-12 12:06:38,098 INFO L137 encePairwiseOnDemand]: 89/105 looper letters, 152 selfloop transitions, 101 changer transitions 11027/11342 dead transitions. [2022-12-12 12:06:38,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 11342 transitions, 202594 flow [2022-12-12 12:06:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 12:06:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 12:06:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1649 transitions. [2022-12-12 12:06:38,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7852380952380953 [2022-12-12 12:06:38,102 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 131 predicate places. [2022-12-12 12:06:38,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 11342 transitions, 202594 flow [2022-12-12 12:06:38,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 11342 transitions, 201155 flow, removed 717 selfloop flow, removed 3 redundant places. [2022-12-12 12:06:38,740 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 11342 transitions, 201155 flow [2022-12-12 12:06:38,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.91666666666667) internal successors, (911), 12 states have internal predecessors, (911), 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 12:06:38,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:06:38,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:06:38,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 12:06:38,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:06:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:06:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -263535896, now seen corresponding path program 3 times [2022-12-12 12:06:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:06:38,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463702018] [2022-12-12 12:06:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:06:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:06:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:06:39,403 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 12:06:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:06:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463702018] [2022-12-12 12:06:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463702018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:06:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:06:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:06:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853093856] [2022-12-12 12:06:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:06:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:06:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:06:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:06:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:06:39,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2022-12-12 12:06:39,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 11342 transitions, 201155 flow. Second operand has 12 states, 12 states have (on average 81.58333333333333) internal successors, (979), 12 states have internal predecessors, (979), 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 12:06:39,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:06:39,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2022-12-12 12:06:39,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:07:27,074 INFO L130 PetriNetUnfolder]: 16357/65270 cut-off events. [2022-12-12 12:07:27,074 INFO L131 PetriNetUnfolder]: For 107081/254365 co-relation queries the response was YES. [2022-12-12 12:07:27,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321076 conditions, 65270 events. 16357/65270 cut-off events. For 107081/254365 co-relation queries the response was YES. Maximal size of possible extension queue 5469. Compared 1103337 event pairs, 0 based on Foata normal form. 609/65829 useless extension candidates. Maximal degree in co-relation 321002. Up to 17474 conditions per place. [2022-12-12 12:07:27,322 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 134 selfloop transitions, 30 changer transitions 12095/12370 dead transitions. [2022-12-12 12:07:27,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 12370 transitions, 243543 flow [2022-12-12 12:07:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:07:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:07:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1097 transitions. [2022-12-12 12:07:27,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8036630036630037 [2022-12-12 12:07:27,324 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 140 predicate places. [2022-12-12 12:07:27,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 12370 transitions, 243543 flow [2022-12-12 12:07:27,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 12370 transitions, 223518 flow, removed 10010 selfloop flow, removed 3 redundant places. [2022-12-12 12:07:27,853 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 12370 transitions, 223518 flow [2022-12-12 12:07:27,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.58333333333333) internal successors, (979), 12 states have internal predecessors, (979), 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 12:07:27,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:07:27,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:07:27,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 12:07:27,854 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:07:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:07:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1685466456, now seen corresponding path program 1 times [2022-12-12 12:07:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:07:27,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727667810] [2022-12-12 12:07:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:07:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:07:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:07:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:07:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:07:27,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727667810] [2022-12-12 12:07:27,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727667810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:07:27,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:07:27,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:07:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201830769] [2022-12-12 12:07:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:07:27,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:07:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:07:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:07:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:07:27,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-12 12:07:27,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 12370 transitions, 223518 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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 12:07:27,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:07:27,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-12 12:07:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:08:26,449 INFO L130 PetriNetUnfolder]: 13305/43681 cut-off events. [2022-12-12 12:08:26,450 INFO L131 PetriNetUnfolder]: For 213035/233314 co-relation queries the response was YES. [2022-12-12 12:08:26,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198757 conditions, 43681 events. 13305/43681 cut-off events. For 213035/233314 co-relation queries the response was YES. Maximal size of possible extension queue 3066. Compared 631514 event pairs, 1195 based on Foata normal form. 2907/45504 useless extension candidates. Maximal degree in co-relation 198687. Up to 14077 conditions per place. [2022-12-12 12:08:26,623 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 130 selfloop transitions, 15 changer transitions 4837/5136 dead transitions. [2022-12-12 12:08:26,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 5136 transitions, 98762 flow [2022-12-12 12:08:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:08:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:08:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 894 transitions. [2022-12-12 12:08:26,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8514285714285714 [2022-12-12 12:08:26,625 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 140 predicate places. [2022-12-12 12:08:26,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 5136 transitions, 98762 flow [2022-12-12 12:08:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 5136 transitions, 93140 flow, removed 2810 selfloop flow, removed 1 redundant places. [2022-12-12 12:08:26,841 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 5136 transitions, 93140 flow [2022-12-12 12:08:26,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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 12:08:26,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:08:26,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:08:26,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 12:08:26,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:08:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:08:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1829470324, now seen corresponding path program 1 times [2022-12-12 12:08:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:08:26,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671990109] [2022-12-12 12:08:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:08:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:08:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:08:26,998 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 12:08:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:08:26,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671990109] [2022-12-12 12:08:26,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671990109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:08:26,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:08:26,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:08:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906395194] [2022-12-12 12:08:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:08:27,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:08:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:08:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:08:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:08:27,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-12 12:08:27,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 5136 transitions, 93140 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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 12:08:27,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:08:27,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-12 12:08:27,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:08:36,521 INFO L130 PetriNetUnfolder]: 6039/15606 cut-off events. [2022-12-12 12:08:36,522 INFO L131 PetriNetUnfolder]: For 150463/167959 co-relation queries the response was YES. [2022-12-12 12:08:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74779 conditions, 15606 events. 6039/15606 cut-off events. For 150463/167959 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 168941 event pairs, 79 based on Foata normal form. 2767/18126 useless extension candidates. Maximal degree in co-relation 74707. Up to 3921 conditions per place. [2022-12-12 12:08:36,573 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 92 selfloop transitions, 28 changer transitions 1703/1949 dead transitions. [2022-12-12 12:08:36,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1949 transitions, 39811 flow [2022-12-12 12:08:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:08:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:08:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1164 transitions. [2022-12-12 12:08:36,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8527472527472527 [2022-12-12 12:08:36,579 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 106 predicate places. [2022-12-12 12:08:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1949 transitions, 39811 flow [2022-12-12 12:08:36,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1949 transitions, 31266 flow, removed 3915 selfloop flow, removed 12 redundant places. [2022-12-12 12:08:36,668 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 1949 transitions, 31266 flow [2022-12-12 12:08:36,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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 12:08:36,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:08:36,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:08:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 12:08:36,669 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:08:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:08:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 753821159, now seen corresponding path program 1 times [2022-12-12 12:08:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:08:36,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767210850] [2022-12-12 12:08:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:08:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:08:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:08:36,840 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 12:08:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:08:36,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767210850] [2022-12-12 12:08:36,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767210850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:08:36,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:08:36,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:08:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155013226] [2022-12-12 12:08:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:08:36,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:08:36,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:08:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:08:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:08:36,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2022-12-12 12:08:36,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 1949 transitions, 31266 flow. Second operand has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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 12:08:36,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:08:36,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2022-12-12 12:08:36,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:08:40,130 INFO L130 PetriNetUnfolder]: 5618/12436 cut-off events. [2022-12-12 12:08:40,130 INFO L131 PetriNetUnfolder]: For 90634/104518 co-relation queries the response was YES. [2022-12-12 12:08:40,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61025 conditions, 12436 events. 5618/12436 cut-off events. For 90634/104518 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 127163 event pairs, 75 based on Foata normal form. 2997/15265 useless extension candidates. Maximal degree in co-relation 60955. Up to 2885 conditions per place. [2022-12-12 12:08:40,184 INFO L137 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 12 changer transitions 1286/1387 dead transitions. [2022-12-12 12:08:40,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1387 transitions, 25903 flow [2022-12-12 12:08:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 12:08:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 12:08:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1403 transitions. [2022-12-12 12:08:40,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8351190476190476 [2022-12-12 12:08:40,189 INFO L295 CegarLoopForPetriNet]: 110 programPoint places, 70 predicate places. [2022-12-12 12:08:40,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1387 transitions, 25903 flow [2022-12-12 12:08:40,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1387 transitions, 23527 flow, removed 1090 selfloop flow, removed 8 redundant places. [2022-12-12 12:08:40,244 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 1387 transitions, 23527 flow [2022-12-12 12:08:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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 12:08:40,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:08:40,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:08:40,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 12:08:40,245 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:08:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:08:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2034858332, now seen corresponding path program 1 times [2022-12-12 12:08:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:08:40,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322797408] [2022-12-12 12:08:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:08:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:08:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:08:40,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:08:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:08:40,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:08:40,348 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:08:40,349 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 12:08:40,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 12:08:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 12:08:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 12:08:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 12:08:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 12:08:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 12:08:40,354 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:08:40,360 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:08:40,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:08:40,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:08:40 BasicIcfg [2022-12-12 12:08:40,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:08:40,456 INFO L158 Benchmark]: Toolchain (without parser) took 236932.88ms. Allocated memory was 174.1MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 149.9MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 12:08:40,456 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:08:40,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.73ms. Allocated memory is still 174.1MB. Free memory was 149.6MB in the beginning and 123.8MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 12:08:40,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.86ms. Allocated memory is still 174.1MB. Free memory was 123.8MB in the beginning and 121.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:08:40,457 INFO L158 Benchmark]: Boogie Preprocessor took 39.04ms. Allocated memory is still 174.1MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 12:08:40,457 INFO L158 Benchmark]: RCFGBuilder took 657.62ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 87.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-12 12:08:40,458 INFO L158 Benchmark]: TraceAbstraction took 235528.33ms. Allocated memory was 174.1MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 86.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-12 12:08:40,459 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.13ms. Allocated memory is still 174.1MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 617.73ms. Allocated memory is still 174.1MB. Free memory was 149.6MB in the beginning and 123.8MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.86ms. Allocated memory is still 174.1MB. Free memory was 123.8MB in the beginning and 121.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.04ms. Allocated memory is still 174.1MB. Free memory was 120.8MB in the beginning and 119.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 657.62ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 87.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 235528.33ms. Allocated memory was 174.1MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 86.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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=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, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=2, 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=1, 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, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, 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=1, 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, z=2] [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 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, 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=2, y=1, 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=1, 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, z=2] [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 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, 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=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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=2, y=2, 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=1, 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, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2, y=2, 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=1, 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, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 812]: 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: 816]: 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, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 235.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 222.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1333 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1333 mSDsluCounter, 1594 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1279 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2504 IncrementalHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 315 mSDtfsCounter, 2504 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223518occurred in iteration=12, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 54098 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1060 ConstructedInterpolants, 0 QuantifiedInterpolants, 6343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 12:08:40,478 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...