/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:04:46,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:04:46,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:04:47,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:04:47,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:04:47,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:04:47,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:04:47,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:04:47,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:04:47,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:04:47,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:04:47,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:04:47,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:04:47,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:04:47,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:04:47,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:04:47,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:04:47,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:04:47,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:04:47,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:04:47,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:04:47,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:04:47,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:04:47,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:04:47,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:04:47,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:04:47,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:04:47,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:04:47,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:04:47,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:04:47,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:04:47,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:04:47,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:04:47,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:04:47,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:04:47,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:04:47,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:04:47,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:04:47,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:04:47,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:04:47,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:04:47,046 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-11 21:04:47,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:04:47,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:04:47,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:04:47,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:04:47,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:04:47,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:04:47,074 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:04:47,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:04:47,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:04:47,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:04:47,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:04:47,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:47,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:04:47,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:04:47,077 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:04:47,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:04:47,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:04:47,077 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:04:47,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 21:04:47,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:04:47,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:04:47,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:04:47,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:04:47,347 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:04:47,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:48,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:04:48,652 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:04:48,653 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:48,664 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079ece297/7b31f275f81d4fdaae7830ed0236f929/FLAG2ecb26376 [2022-12-11 21:04:48,679 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079ece297/7b31f275f81d4fdaae7830ed0236f929 [2022-12-11 21:04:48,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:04:48,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:04:48,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:48,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:04:48,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:04:48,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:48" (1/1) ... [2022-12-11 21:04:48,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d53bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:48, skipping insertion in model container [2022-12-11 21:04:48,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:48" (1/1) ... [2022-12-11 21:04:48,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:04:48,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:04:48,848 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-11 21:04:48,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:48,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:48,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:48,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:48,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:48,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:49,059 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:04:49,066 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-11 21:04:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:49,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:49,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:49,157 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:04:49,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49 WrapperNode [2022-12-11 21:04:49,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:49,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:49,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:04:49,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:04:49,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,211 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-11 21:04:49,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:49,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:04:49,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:04:49,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:04:49,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:04:49,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:04:49,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:04:49,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:04:49,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (1/1) ... [2022-12-11 21:04:49,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:49,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:04:49,327 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-11 21:04:49,329 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-11 21:04:49,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:04:49,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:04:49,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:04:49,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:04:49,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:04:49,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:04:49,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:04:49,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:04:49,386 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:04:49,480 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:04:49,481 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:04:49,763 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:04:49,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:04:49,873 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:04:49,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:49 BoogieIcfgContainer [2022-12-11 21:04:49,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:04:49,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:04:49,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:04:49,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:04:49,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:04:48" (1/3) ... [2022-12-11 21:04:49,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbeff85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:49, skipping insertion in model container [2022-12-11 21:04:49,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:49" (2/3) ... [2022-12-11 21:04:49,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbeff85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:49, skipping insertion in model container [2022-12-11 21:04:49,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:49" (3/3) ... [2022-12-11 21:04:49,880 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:49,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:04:49,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:04:49,892 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:04:49,941 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:04:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-11 21:04:50,018 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-11 21:04:50,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:50,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-11 21:04:50,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-11 21:04:50,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-11 21:04:50,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:04:50,042 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;@11a372b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:04:50,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 21:04:50,068 INFO L130 PetriNetUnfolder]: 0/69 cut-off events. [2022-12-11 21:04:50,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:50,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:50,069 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] [2022-12-11 21:04:50,069 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-11 21:04:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1304970888, now seen corresponding path program 1 times [2022-12-11 21:04:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:50,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690835744] [2022-12-11 21:04:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:50,458 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-11 21:04:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690835744] [2022-12-11 21:04:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690835744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:50,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:50,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:04:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465871871] [2022-12-11 21:04:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:50,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:04:50,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:04:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:04:50,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2022-12-11 21:04:50,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-11 21:04:50,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:50,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2022-12-11 21:04:50,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:50,601 INFO L130 PetriNetUnfolder]: 126/521 cut-off events. [2022-12-11 21:04:50,601 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-11 21:04:50,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 521 events. 126/521 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2812 event pairs, 34 based on Foata normal form. 27/517 useless extension candidates. Maximal degree in co-relation 709. Up to 141 conditions per place. [2022-12-11 21:04:50,606 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 16 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-11 21:04:50,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 257 flow [2022-12-11 21:04:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:04:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:04:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2022-12-11 21:04:50,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2022-12-11 21:04:50,617 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2022-12-11 21:04:50,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 106 transitions, 257 flow [2022-12-11 21:04:50,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 106 transitions, 257 flow [2022-12-11 21:04:50,621 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 257 flow [2022-12-11 21:04:50,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-11 21:04:50,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:50,621 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] [2022-12-11 21:04:50,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:04:50,622 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-11 21:04:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1123136244, now seen corresponding path program 1 times [2022-12-11 21:04:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138878803] [2022-12-11 21:04:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:51,041 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-11 21:04:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:51,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138878803] [2022-12-11 21:04:51,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138878803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:51,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:51,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367893216] [2022-12-11 21:04:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:51,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:51,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-11 21:04:51,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-11 21:04:51,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:51,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-11 21:04:51,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:51,872 INFO L130 PetriNetUnfolder]: 1305/3002 cut-off events. [2022-12-11 21:04:51,872 INFO L131 PetriNetUnfolder]: For 648/2035 co-relation queries the response was YES. [2022-12-11 21:04:51,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 3002 events. 1305/3002 cut-off events. For 648/2035 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21798 event pairs, 144 based on Foata normal form. 1/2919 useless extension candidates. Maximal degree in co-relation 6065. Up to 912 conditions per place. [2022-12-11 21:04:51,889 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 44 selfloop transitions, 9 changer transitions 95/209 dead transitions. [2022-12-11 21:04:51,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 209 transitions, 874 flow [2022-12-11 21:04:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1067 transitions. [2022-12-11 21:04:51,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7670740474478792 [2022-12-11 21:04:51,895 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 12 predicate places. [2022-12-11 21:04:51,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 209 transitions, 874 flow [2022-12-11 21:04:51,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 114 transitions, 404 flow [2022-12-11 21:04:51,904 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 404 flow [2022-12-11 21:04:51,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 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-11 21:04:51,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:51,904 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-11 21:04:51,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:04:51,904 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-11 21:04:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash 145764470, now seen corresponding path program 1 times [2022-12-11 21:04:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722302005] [2022-12-11 21:04:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:52,261 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-11 21:04:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:52,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722302005] [2022-12-11 21:04:52,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722302005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:52,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:52,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650252268] [2022-12-11 21:04:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:52,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-11 21:04:52,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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-11 21:04:52,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:52,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-11 21:04:52,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:52,595 INFO L130 PetriNetUnfolder]: 666/1378 cut-off events. [2022-12-11 21:04:52,595 INFO L131 PetriNetUnfolder]: For 682/3614 co-relation queries the response was YES. [2022-12-11 21:04:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4176 conditions, 1378 events. 666/1378 cut-off events. For 682/3614 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7627 event pairs, 76 based on Foata normal form. 34/1354 useless extension candidates. Maximal degree in co-relation 4111. Up to 751 conditions per place. [2022-12-11 21:04:52,602 INFO L137 encePairwiseOnDemand]: 100/107 looper letters, 57 selfloop transitions, 5 changer transitions 62/195 dead transitions. [2022-12-11 21:04:52,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 195 transitions, 1091 flow [2022-12-11 21:04:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:04:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:04:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 814 transitions. [2022-12-11 21:04:52,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8452751817237798 [2022-12-11 21:04:52,605 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2022-12-11 21:04:52,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 195 transitions, 1091 flow [2022-12-11 21:04:52,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 133 transitions, 643 flow [2022-12-11 21:04:52,613 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 133 transitions, 643 flow [2022-12-11 21:04:52,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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-11 21:04:52,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:52,614 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] [2022-12-11 21:04:52,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:04:52,614 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-11 21:04:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1281774955, now seen corresponding path program 1 times [2022-12-11 21:04:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:52,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624049540] [2022-12-11 21:04:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:53,512 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-11 21:04:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:53,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624049540] [2022-12-11 21:04:53,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624049540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:53,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:04:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875085553] [2022-12-11 21:04:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:04:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:04:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:04:53,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-11 21:04:53,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 133 transitions, 643 flow. Second operand has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 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-11 21:04:53,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:53,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-11 21:04:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:54,178 INFO L130 PetriNetUnfolder]: 585/1274 cut-off events. [2022-12-11 21:04:54,178 INFO L131 PetriNetUnfolder]: For 1283/10087 co-relation queries the response was YES. [2022-12-11 21:04:54,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 1274 events. 585/1274 cut-off events. For 1283/10087 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6779 event pairs, 37 based on Foata normal form. 86/1295 useless extension candidates. Maximal degree in co-relation 4655. Up to 858 conditions per place. [2022-12-11 21:04:54,185 INFO L137 encePairwiseOnDemand]: 86/107 looper letters, 62 selfloop transitions, 38 changer transitions 40/201 dead transitions. [2022-12-11 21:04:54,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 201 transitions, 1433 flow [2022-12-11 21:04:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:04:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:04:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1494 transitions. [2022-12-11 21:04:54,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.734874569601574 [2022-12-11 21:04:54,188 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 13 predicate places. [2022-12-11 21:04:54,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 201 transitions, 1433 flow [2022-12-11 21:04:54,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 161 transitions, 1057 flow [2022-12-11 21:04:54,193 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1057 flow [2022-12-11 21:04:54,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 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-11 21:04:54,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:54,194 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-11 21:04:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:04:54,194 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-11 21:04:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1044353707, now seen corresponding path program 1 times [2022-12-11 21:04:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15303484] [2022-12-11 21:04:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:54,356 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-11 21:04:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15303484] [2022-12-11 21:04:54,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15303484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:54,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:54,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871438563] [2022-12-11 21:04:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:54,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-11 21:04:54,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-11 21:04:54,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:54,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-11 21:04:54,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:54,653 INFO L130 PetriNetUnfolder]: 632/1500 cut-off events. [2022-12-11 21:04:54,653 INFO L131 PetriNetUnfolder]: For 1859/10566 co-relation queries the response was YES. [2022-12-11 21:04:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 1500 events. 632/1500 cut-off events. For 1859/10566 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9053 event pairs, 35 based on Foata normal form. 49/1486 useless extension candidates. Maximal degree in co-relation 6284. Up to 955 conditions per place. [2022-12-11 21:04:54,660 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 90 selfloop transitions, 7 changer transitions 31/202 dead transitions. [2022-12-11 21:04:54,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 202 transitions, 1697 flow [2022-12-11 21:04:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:04:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:04:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 807 transitions. [2022-12-11 21:04:54,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.838006230529595 [2022-12-11 21:04:54,662 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 12 predicate places. [2022-12-11 21:04:54,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 202 transitions, 1697 flow [2022-12-11 21:04:54,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 171 transitions, 1345 flow [2022-12-11 21:04:54,668 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 171 transitions, 1345 flow [2022-12-11 21:04:54,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-11 21:04:54,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:54,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] [2022-12-11 21:04:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:04:54,669 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-11 21:04:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -884077385, now seen corresponding path program 1 times [2022-12-11 21:04:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:54,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826159016] [2022-12-11 21:04:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:55,681 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-11 21:04:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826159016] [2022-12-11 21:04:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826159016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:55,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:55,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 21:04:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874759175] [2022-12-11 21:04:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 21:04:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 21:04:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-11 21:04:55,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 107 [2022-12-11 21:04:55,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 171 transitions, 1345 flow. Second operand has 14 states, 14 states have (on average 72.92857142857143) internal successors, (1021), 14 states have internal predecessors, (1021), 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-11 21:04:55,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:55,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 107 [2022-12-11 21:04:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:56,712 INFO L130 PetriNetUnfolder]: 850/2057 cut-off events. [2022-12-11 21:04:56,712 INFO L131 PetriNetUnfolder]: For 4231/45024 co-relation queries the response was YES. [2022-12-11 21:04:56,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10235 conditions, 2057 events. 850/2057 cut-off events. For 4231/45024 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13909 event pairs, 8 based on Foata normal form. 202/2196 useless extension candidates. Maximal degree in co-relation 10138. Up to 1339 conditions per place. [2022-12-11 21:04:56,728 INFO L137 encePairwiseOnDemand]: 90/107 looper letters, 135 selfloop transitions, 86 changer transitions 98/378 dead transitions. [2022-12-11 21:04:56,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 378 transitions, 4345 flow [2022-12-11 21:04:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-11 21:04:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-11 21:04:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1621 transitions. [2022-12-11 21:04:56,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7214063195371606 [2022-12-11 21:04:56,734 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 26 predicate places. [2022-12-11 21:04:56,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 378 transitions, 4345 flow [2022-12-11 21:04:56,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 280 transitions, 3039 flow [2022-12-11 21:04:56,749 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 280 transitions, 3039 flow [2022-12-11 21:04:56,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 72.92857142857143) internal successors, (1021), 14 states have internal predecessors, (1021), 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-11 21:04:56,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:56,750 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-11 21:04:56,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:04:56,750 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-11 21:04:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1717637463, now seen corresponding path program 2 times [2022-12-11 21:04:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994474582] [2022-12-11 21:04:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:57,510 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-11 21:04:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:57,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994474582] [2022-12-11 21:04:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994474582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:57,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:57,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:04:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880574421] [2022-12-11 21:04:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:57,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:04:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:04:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:04:57,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 107 [2022-12-11 21:04:57,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 280 transitions, 3039 flow. Second operand has 13 states, 13 states have (on average 76.84615384615384) internal successors, (999), 13 states have internal predecessors, (999), 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-11 21:04:57,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:57,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 107 [2022-12-11 21:04:57,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:58,398 INFO L130 PetriNetUnfolder]: 750/2020 cut-off events. [2022-12-11 21:04:58,398 INFO L131 PetriNetUnfolder]: For 5982/33011 co-relation queries the response was YES. [2022-12-11 21:04:58,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 2020 events. 750/2020 cut-off events. For 5982/33011 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14816 event pairs, 18 based on Foata normal form. 242/2187 useless extension candidates. Maximal degree in co-relation 10643. Up to 1233 conditions per place. [2022-12-11 21:04:58,407 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 143 selfloop transitions, 57 changer transitions 85/383 dead transitions. [2022-12-11 21:04:58,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 383 transitions, 5009 flow [2022-12-11 21:04:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 21:04:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 21:04:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1198 transitions. [2022-12-11 21:04:58,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.746417445482866 [2022-12-11 21:04:58,411 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 31 predicate places. [2022-12-11 21:04:58,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 383 transitions, 5009 flow [2022-12-11 21:04:58,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 298 transitions, 3691 flow [2022-12-11 21:04:58,418 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 298 transitions, 3691 flow [2022-12-11 21:04:58,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 76.84615384615384) internal successors, (999), 13 states have internal predecessors, (999), 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-11 21:04:58,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:58,419 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] [2022-12-11 21:04:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:04:58,419 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-11 21:04:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1008618945, now seen corresponding path program 1 times [2022-12-11 21:04:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66319271] [2022-12-11 21:04:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:59,645 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-11 21:04:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66319271] [2022-12-11 21:04:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66319271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-11 21:04:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787001040] [2022-12-11 21:04:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:59,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 21:04:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 21:04:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-11 21:04:59,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 107 [2022-12-11 21:04:59,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 298 transitions, 3691 flow. Second operand has 17 states, 17 states have (on average 76.47058823529412) internal successors, (1300), 17 states have internal predecessors, (1300), 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-11 21:04:59,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:59,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 107 [2022-12-11 21:04:59,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:00,386 INFO L130 PetriNetUnfolder]: 557/1568 cut-off events. [2022-12-11 21:05:00,386 INFO L131 PetriNetUnfolder]: For 7091/73203 co-relation queries the response was YES. [2022-12-11 21:05:00,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9109 conditions, 1568 events. 557/1568 cut-off events. For 7091/73203 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11203 event pairs, 20 based on Foata normal form. 129/1641 useless extension candidates. Maximal degree in co-relation 8986. Up to 928 conditions per place. [2022-12-11 21:05:00,395 INFO L137 encePairwiseOnDemand]: 91/107 looper letters, 174 selfloop transitions, 21 changer transitions 66/359 dead transitions. [2022-12-11 21:05:00,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 359 transitions, 5153 flow [2022-12-11 21:05:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 21:05:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 21:05:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1423 transitions. [2022-12-11 21:05:00,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7388369678089304 [2022-12-11 21:05:00,402 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 42 predicate places. [2022-12-11 21:05:00,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 359 transitions, 5153 flow [2022-12-11 21:05:00,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 293 transitions, 3995 flow [2022-12-11 21:05:00,411 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 293 transitions, 3995 flow [2022-12-11 21:05:00,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 76.47058823529412) internal successors, (1300), 17 states have internal predecessors, (1300), 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-11 21:05:00,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:00,412 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] [2022-12-11 21:05:00,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:05:00,412 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-11 21:05:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 893875993, now seen corresponding path program 2 times [2022-12-11 21:05:00,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:00,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804748640] [2022-12-11 21:05:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:00,957 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-11 21:05:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:00,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804748640] [2022-12-11 21:05:00,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804748640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:00,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:00,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:05:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830212378] [2022-12-11 21:05:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:00,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:05:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:05:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:05:00,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2022-12-11 21:05:00,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 293 transitions, 3995 flow. Second operand has 13 states, 13 states have (on average 77.84615384615384) internal successors, (1012), 13 states have internal predecessors, (1012), 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-11 21:05:00,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:00,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2022-12-11 21:05:00,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:01,615 INFO L130 PetriNetUnfolder]: 549/1517 cut-off events. [2022-12-11 21:05:01,615 INFO L131 PetriNetUnfolder]: For 12520/88958 co-relation queries the response was YES. [2022-12-11 21:05:01,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 1517 events. 549/1517 cut-off events. For 12520/88958 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10565 event pairs, 8 based on Foata normal form. 238/1706 useless extension candidates. Maximal degree in co-relation 9596. Up to 907 conditions per place. [2022-12-11 21:05:01,625 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 177 selfloop transitions, 38 changer transitions 48/362 dead transitions. [2022-12-11 21:05:01,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 362 transitions, 5733 flow [2022-12-11 21:05:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:05:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:05:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1281 transitions. [2022-12-11 21:05:01,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7482476635514018 [2022-12-11 21:05:01,628 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 48 predicate places. [2022-12-11 21:05:01,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 362 transitions, 5733 flow [2022-12-11 21:05:01,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 314 transitions, 4809 flow [2022-12-11 21:05:01,636 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 314 transitions, 4809 flow [2022-12-11 21:05:01,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 77.84615384615384) internal successors, (1012), 13 states have internal predecessors, (1012), 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-11 21:05:01,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:01,637 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] [2022-12-11 21:05:01,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:05:01,637 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-11 21:05:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1114377923, now seen corresponding path program 3 times [2022-12-11 21:05:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:01,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606462589] [2022-12-11 21:05:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:05:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606462589] [2022-12-11 21:05:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606462589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:02,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:02,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 21:05:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556167891] [2022-12-11 21:05:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:02,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 21:05:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:02,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 21:05:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-11 21:05:02,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2022-12-11 21:05:02,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 314 transitions, 4809 flow. Second operand has 14 states, 14 states have (on average 79.57142857142857) internal successors, (1114), 14 states have internal predecessors, (1114), 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-11 21:05:02,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:02,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2022-12-11 21:05:02,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:02,772 INFO L130 PetriNetUnfolder]: 608/1754 cut-off events. [2022-12-11 21:05:02,772 INFO L131 PetriNetUnfolder]: For 18387/111125 co-relation queries the response was YES. [2022-12-11 21:05:02,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12031 conditions, 1754 events. 608/1754 cut-off events. For 18387/111125 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13193 event pairs, 15 based on Foata normal form. 232/1936 useless extension candidates. Maximal degree in co-relation 11886. Up to 1042 conditions per place. [2022-12-11 21:05:02,782 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 176 selfloop transitions, 40 changer transitions 85/397 dead transitions. [2022-12-11 21:05:02,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 397 transitions, 7037 flow [2022-12-11 21:05:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:05:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:05:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1073 transitions. [2022-12-11 21:05:02,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7713874910136592 [2022-12-11 21:05:02,784 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 54 predicate places. [2022-12-11 21:05:02,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 397 transitions, 7037 flow [2022-12-11 21:05:02,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 312 transitions, 5235 flow [2022-12-11 21:05:02,793 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 312 transitions, 5235 flow [2022-12-11 21:05:02,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.57142857142857) internal successors, (1114), 14 states have internal predecessors, (1114), 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-11 21:05:02,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:02,793 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] [2022-12-11 21:05:02,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:05:02,794 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-11 21:05:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1992765565, now seen corresponding path program 4 times [2022-12-11 21:05:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724540571] [2022-12-11 21:05:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:05:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:03,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724540571] [2022-12-11 21:05:03,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724540571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:03,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:03,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:05:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648999543] [2022-12-11 21:05:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:05:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:05:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:05:03,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-11 21:05:03,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 312 transitions, 5235 flow. Second operand has 13 states, 13 states have (on average 75.07692307692308) internal successors, (976), 13 states have internal predecessors, (976), 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-11 21:05:03,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:03,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-11 21:05:03,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:04,485 INFO L130 PetriNetUnfolder]: 466/1353 cut-off events. [2022-12-11 21:05:04,485 INFO L131 PetriNetUnfolder]: For 16416/124285 co-relation queries the response was YES. [2022-12-11 21:05:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 1353 events. 466/1353 cut-off events. For 16416/124285 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9729 event pairs, 12 based on Foata normal form. 139/1456 useless extension candidates. Maximal degree in co-relation 9956. Up to 793 conditions per place. [2022-12-11 21:05:04,495 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 147 selfloop transitions, 40 changer transitions 89/359 dead transitions. [2022-12-11 21:05:04,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 359 transitions, 6793 flow [2022-12-11 21:05:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 21:05:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 21:05:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1311 transitions. [2022-12-11 21:05:04,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7207256734469488 [2022-12-11 21:05:04,498 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 63 predicate places. [2022-12-11 21:05:04,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 359 transitions, 6793 flow [2022-12-11 21:05:04,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 270 transitions, 4783 flow [2022-12-11 21:05:04,506 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 270 transitions, 4783 flow [2022-12-11 21:05:04,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 75.07692307692308) internal successors, (976), 13 states have internal predecessors, (976), 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-11 21:05:04,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:04,506 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-11 21:05:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 21:05:04,506 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-11 21:05:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -950795098, now seen corresponding path program 1 times [2022-12-11 21:05:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:04,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209830274] [2022-12-11 21:05:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:04,656 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-11 21:05:04,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:04,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209830274] [2022-12-11 21:05:04,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209830274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:04,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:04,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:05:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032190215] [2022-12-11 21:05:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:05:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:05:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:05:04,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-12-11 21:05:04,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 270 transitions, 4783 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 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-11 21:05:04,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:04,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-12-11 21:05:04,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:05,188 INFO L130 PetriNetUnfolder]: 1453/2878 cut-off events. [2022-12-11 21:05:05,188 INFO L131 PetriNetUnfolder]: For 66284/67927 co-relation queries the response was YES. [2022-12-11 21:05:05,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18659 conditions, 2878 events. 1453/2878 cut-off events. For 66284/67927 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19305 event pairs, 46 based on Foata normal form. 152/2972 useless extension candidates. Maximal degree in co-relation 18495. Up to 1211 conditions per place. [2022-12-11 21:05:05,206 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 173 selfloop transitions, 7 changer transitions 198/465 dead transitions. [2022-12-11 21:05:05,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 465 transitions, 9634 flow [2022-12-11 21:05:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:05:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:05:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 907 transitions. [2022-12-11 21:05:05,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8476635514018691 [2022-12-11 21:05:05,210 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 63 predicate places. [2022-12-11 21:05:05,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 465 transitions, 9634 flow [2022-12-11 21:05:05,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 267 transitions, 4948 flow [2022-12-11 21:05:05,221 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 267 transitions, 4948 flow [2022-12-11 21:05:05,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 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-11 21:05:05,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:05,221 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] [2022-12-11 21:05:05,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 21:05:05,222 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-11 21:05:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -232523299, now seen corresponding path program 1 times [2022-12-11 21:05:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:05,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516321545] [2022-12-11 21:05:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:05,363 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-11 21:05:05,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516321545] [2022-12-11 21:05:05,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516321545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:05,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:05,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:05:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643790239] [2022-12-11 21:05:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:05:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:05:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:05:05,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-12-11 21:05:05,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 267 transitions, 4948 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 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-11 21:05:05,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:05,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-12-11 21:05:05,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:05,745 INFO L130 PetriNetUnfolder]: 567/1426 cut-off events. [2022-12-11 21:05:05,745 INFO L131 PetriNetUnfolder]: For 23672/24452 co-relation queries the response was YES. [2022-12-11 21:05:05,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9309 conditions, 1426 events. 567/1426 cut-off events. For 23672/24452 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9218 event pairs, 39 based on Foata normal form. 63/1477 useless extension candidates. Maximal degree in co-relation 9141. Up to 533 conditions per place. [2022-12-11 21:05:05,753 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 157 selfloop transitions, 22 changer transitions 76/340 dead transitions. [2022-12-11 21:05:05,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 340 transitions, 6636 flow [2022-12-11 21:05:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:05:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:05:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 979 transitions. [2022-12-11 21:05:05,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8317757009345794 [2022-12-11 21:05:05,756 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 69 predicate places. [2022-12-11 21:05:05,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 340 transitions, 6636 flow [2022-12-11 21:05:05,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 264 transitions, 4860 flow [2022-12-11 21:05:05,763 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 264 transitions, 4860 flow [2022-12-11 21:05:05,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 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-11 21:05:05,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:05,763 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-11 21:05:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 21:05:05,763 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-11 21:05:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 981298834, now seen corresponding path program 1 times [2022-12-11 21:05:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164515220] [2022-12-11 21:05:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:05,944 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-11 21:05:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:05,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164515220] [2022-12-11 21:05:05,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164515220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:05,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:05:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346722916] [2022-12-11 21:05:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:05:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:05:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:05:05,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-12-11 21:05:05,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 264 transitions, 4860 flow. Second operand has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 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-11 21:05:05,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:05,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-12-11 21:05:05,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:06,311 INFO L130 PetriNetUnfolder]: 374/1177 cut-off events. [2022-12-11 21:05:06,311 INFO L131 PetriNetUnfolder]: For 14054/14742 co-relation queries the response was YES. [2022-12-11 21:05:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 1177 events. 374/1177 cut-off events. For 14054/14742 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8499 event pairs, 40 based on Foata normal form. 54/1230 useless extension candidates. Maximal degree in co-relation 7306. Up to 346 conditions per place. [2022-12-11 21:05:06,317 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 145 selfloop transitions, 26 changer transitions 29/285 dead transitions. [2022-12-11 21:05:06,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 285 transitions, 5518 flow [2022-12-11 21:05:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:05:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:05:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1211 transitions. [2022-12-11 21:05:06,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8084112149532711 [2022-12-11 21:05:06,320 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 82 predicate places. [2022-12-11 21:05:06,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 285 transitions, 5518 flow [2022-12-11 21:05:06,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 256 transitions, 4956 flow [2022-12-11 21:05:06,325 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 256 transitions, 4956 flow [2022-12-11 21:05:06,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 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-11 21:05:06,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:06,325 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, 1, 1] [2022-12-11 21:05:06,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 21:05:06,326 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-11 21:05:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -79275115, now seen corresponding path program 1 times [2022-12-11 21:05:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:06,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012714031] [2022-12-11 21:05:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:06,773 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-11 21:05:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012714031] [2022-12-11 21:05:06,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012714031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:06,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:06,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:05:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575425029] [2022-12-11 21:05:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:06,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:05:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:05:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:05:06,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 107 [2022-12-11 21:05:06,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 256 transitions, 4956 flow. Second operand has 9 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 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-11 21:05:06,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:06,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 107 [2022-12-11 21:05:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:07,078 INFO L130 PetriNetUnfolder]: 471/1702 cut-off events. [2022-12-11 21:05:07,079 INFO L131 PetriNetUnfolder]: For 18528/19381 co-relation queries the response was YES. [2022-12-11 21:05:07,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9845 conditions, 1702 events. 471/1702 cut-off events. For 18528/19381 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14723 event pairs, 49 based on Foata normal form. 26/1726 useless extension candidates. Maximal degree in co-relation 9664. Up to 483 conditions per place. [2022-12-11 21:05:07,087 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 123 selfloop transitions, 29 changer transitions 29/290 dead transitions. [2022-12-11 21:05:07,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 290 transitions, 6302 flow [2022-12-11 21:05:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:05:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:05:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 833 transitions. [2022-12-11 21:05:07,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7785046728971963 [2022-12-11 21:05:07,089 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 88 predicate places. [2022-12-11 21:05:07,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 290 transitions, 6302 flow [2022-12-11 21:05:07,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 261 transitions, 5392 flow [2022-12-11 21:05:07,096 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 261 transitions, 5392 flow [2022-12-11 21:05:07,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 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-11 21:05:07,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:07,096 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, 1, 1] [2022-12-11 21:05:07,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 21:05:07,097 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-11 21:05:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash -936529547, now seen corresponding path program 2 times [2022-12-11 21:05:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057665236] [2022-12-11 21:05:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:08,515 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-11 21:05:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057665236] [2022-12-11 21:05:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057665236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:08,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-11 21:05:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831718896] [2022-12-11 21:05:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 21:05:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 21:05:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-12-11 21:05:08,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 107 [2022-12-11 21:05:08,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 261 transitions, 5392 flow. Second operand has 18 states, 18 states have (on average 75.55555555555556) internal successors, (1360), 18 states have internal predecessors, (1360), 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-11 21:05:08,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:08,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 107 [2022-12-11 21:05:08,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:09,196 INFO L130 PetriNetUnfolder]: 470/1756 cut-off events. [2022-12-11 21:05:09,197 INFO L131 PetriNetUnfolder]: For 22492/23003 co-relation queries the response was YES. [2022-12-11 21:05:09,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10278 conditions, 1756 events. 470/1756 cut-off events. For 22492/23003 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15518 event pairs, 47 based on Foata normal form. 43/1798 useless extension candidates. Maximal degree in co-relation 10083. Up to 495 conditions per place. [2022-12-11 21:05:09,204 INFO L137 encePairwiseOnDemand]: 92/107 looper letters, 24 selfloop transitions, 12 changer transitions 185/288 dead transitions. [2022-12-11 21:05:09,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 288 transitions, 6576 flow [2022-12-11 21:05:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 21:05:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 21:05:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1761 transitions. [2022-12-11 21:05:09,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7155627793579845 [2022-12-11 21:05:09,222 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 105 predicate places. [2022-12-11 21:05:09,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 288 transitions, 6576 flow [2022-12-11 21:05:09,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 103 transitions, 1279 flow [2022-12-11 21:05:09,225 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 103 transitions, 1279 flow [2022-12-11 21:05:09,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 75.55555555555556) internal successors, (1360), 18 states have internal predecessors, (1360), 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-11 21:05:09,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:09,226 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, 1, 1] [2022-12-11 21:05:09,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 21:05:09,227 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:05:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 56554279, now seen corresponding path program 3 times [2022-12-11 21:05:09,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:09,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892419322] [2022-12-11 21:05:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:05:09,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:05:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:05:09,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:05:09,369 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:05:09,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:05:09,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 21:05:09,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:05:09,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 21:05:09,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 21:05:09,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:05:09,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 21:05:09,376 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:05:09,382 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:05:09,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:05:09,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:05:09 BasicIcfg [2022-12-11 21:05:09,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:05:09,476 INFO L158 Benchmark]: Toolchain (without parser) took 20794.09ms. Allocated memory was 224.4MB in the beginning and 740.3MB in the end (delta: 515.9MB). Free memory was 199.3MB in the beginning and 287.9MB in the end (delta: -88.6MB). Peak memory consumption was 428.2MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,476 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 224.4MB. Free memory was 200.6MB in the beginning and 200.5MB in the end (delta: 83.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:05:09,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.28ms. Allocated memory is still 224.4MB. Free memory was 199.3MB in the beginning and 169.8MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 224.4MB. Free memory was 169.8MB in the beginning and 167.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,477 INFO L158 Benchmark]: Boogie Preprocessor took 42.34ms. Allocated memory is still 224.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,477 INFO L158 Benchmark]: RCFGBuilder took 615.20ms. Allocated memory is still 224.4MB. Free memory was 165.0MB in the beginning and 116.3MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,477 INFO L158 Benchmark]: TraceAbstraction took 19599.19ms. Allocated memory was 224.4MB in the beginning and 740.3MB in the end (delta: 515.9MB). Free memory was 115.2MB in the beginning and 287.9MB in the end (delta: -172.7MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. [2022-12-11 21:05:09,478 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.09ms. Allocated memory is still 224.4MB. Free memory was 200.6MB in the beginning and 200.5MB in the end (delta: 83.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.28ms. Allocated memory is still 224.4MB. Free memory was 199.3MB in the beginning and 169.8MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 224.4MB. Free memory was 169.8MB in the beginning and 167.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.34ms. Allocated memory is still 224.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.20ms. Allocated memory is still 224.4MB. Free memory was 165.0MB in the beginning and 116.3MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 19599.19ms. Allocated memory was 224.4MB in the beginning and 740.3MB in the end (delta: 515.9MB). Free memory was 115.2MB in the beginning and 287.9MB in the end (delta: -172.7MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 852]: 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: 854]: 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, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1153 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1153 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1048 mSDsCounter, 362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3103 IncrementalHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 362 mSolverCounterUnsat, 205 mSDtfsCounter, 3103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5392occurred in iteration=15, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 23395 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 8590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-11 21:05:09,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...