/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:43:22,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:43:22,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:43:22,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:43:22,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:43:22,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:43:22,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:43:22,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:43:22,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:43:22,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:43:22,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:43:22,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:43:22,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:43:22,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:43:22,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:43:22,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:43:22,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:43:22,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:43:22,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:43:22,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:43:22,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:43:22,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:43:22,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:43:22,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:43:22,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:43:22,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:43:22,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:43:22,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:43:22,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:43:22,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:43:22,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:43:22,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:43:22,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:43:22,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:43:22,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:43:22,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:43:22,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:43:22,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:43:22,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:43:22,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:43:22,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:43:22,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:43:22,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:43:22,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:43:22,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:43:22,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:43:22,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:43:22,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:43:22,292 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:43:22,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:43:22,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:43:22,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:43:22,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:43:22,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:43:22,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:43:22,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:43:22,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:43:22,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:43:22,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:43:22,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:22,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:43:22,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:43:22,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:43:22,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:43:22,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:43:22,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:43:22,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:43:22,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:43:22,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:43:22,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:43:22,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:43:22,841 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:43:22,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:43:23,901 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:43:24,209 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:43:24,209 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:43:24,222 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d7087da/4dc1cdbe3b9d48a78c0b12996754531d/FLAGd6c96d58a [2022-12-12 21:43:24,237 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d7087da/4dc1cdbe3b9d48a78c0b12996754531d [2022-12-12 21:43:24,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:43:24,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:43:24,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:24,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:43:24,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:43:24,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1957236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24, skipping insertion in model container [2022-12-12 21:43:24,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:43:24,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:43:24,419 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 21:43:24,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:24,598 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:43:24,608 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 21:43:24,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:24,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:24,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:24,690 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:43:24,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24 WrapperNode [2022-12-12 21:43:24,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:24,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:24,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:43:24,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:43:24,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,746 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-12 21:43:24,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:24,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:43:24,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:43:24,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:43:24,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:43:24,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:43:24,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:43:24,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:43:24,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (1/1) ... [2022-12-12 21:43:24,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:43:24,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:43:24,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:43:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:43:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:43:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:43:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:43:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:43:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:43:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:43:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:43:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:43:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:43:24,860 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:43:24,949 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:43:24,950 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:43:25,162 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:43:25,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:43:25,302 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:43:25,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:25 BoogieIcfgContainer [2022-12-12 21:43:25,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:43:25,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:43:25,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:43:25,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:43:25,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:43:24" (1/3) ... [2022-12-12 21:43:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab1fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:25, skipping insertion in model container [2022-12-12 21:43:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:24" (2/3) ... [2022-12-12 21:43:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab1fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:25, skipping insertion in model container [2022-12-12 21:43:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:25" (3/3) ... [2022-12-12 21:43:25,323 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:43:25,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:43:25,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:43:25,347 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:43:25,412 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:43:25,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 21:43:25,483 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 21:43:25,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:25,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:43:25,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 21:43:25,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-12 21:43:25,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:43:25,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 21:43:25,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-12 21:43:25,533 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 21:43:25,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:25,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:43:25,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 21:43:25,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-12 21:43:28,819 INFO L241 LiptonReduction]: Total number of compositions: 85 [2022-12-12 21:43:28,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:43:28,841 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;@2aa9c314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:43:28,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:43:28,848 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-12 21:43:28,848 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:28,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:28,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:43:28,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 463088845, now seen corresponding path program 1 times [2022-12-12 21:43:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:28,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078622118] [2022-12-12 21:43:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:29,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078622118] [2022-12-12 21:43:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078622118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:29,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:29,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100306179] [2022-12-12 21:43:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:29,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:29,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-12 21:43:29,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:29,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:29,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-12 21:43:29,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:30,169 INFO L130 PetriNetUnfolder]: 7624/12014 cut-off events. [2022-12-12 21:43:30,169 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-12 21:43:30,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 12014 events. 7624/12014 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 83455 event pairs, 2133 based on Foata normal form. 0/7312 useless extension candidates. Maximal degree in co-relation 22980. Up to 9237 conditions per place. [2022-12-12 21:43:30,195 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 32 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2022-12-12 21:43:30,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 370 flow [2022-12-12 21:43:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-12 21:43:30,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-12 21:43:30,206 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2022-12-12 21:43:30,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 95 transitions, 370 flow [2022-12-12 21:43:30,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 170 flow [2022-12-12 21:43:30,221 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 170 flow [2022-12-12 21:43:30,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:30,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:30,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:30,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:43:30,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 912458532, now seen corresponding path program 1 times [2022-12-12 21:43:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:30,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44801196] [2022-12-12 21:43:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44801196] [2022-12-12 21:43:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44801196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:30,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596140194] [2022-12-12 21:43:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:30,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 21:43:30,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:30,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:30,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 21:43:30,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:30,594 INFO L130 PetriNetUnfolder]: 1399/2329 cut-off events. [2022-12-12 21:43:30,594 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-12 21:43:30,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6392 conditions, 2329 events. 1399/2329 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12775 event pairs, 123 based on Foata normal form. 25/1967 useless extension candidates. Maximal degree in co-relation 6378. Up to 1676 conditions per place. [2022-12-12 21:43:30,602 INFO L137 encePairwiseOnDemand]: 57/60 looper letters, 47 selfloop transitions, 3 changer transitions 2/62 dead transitions. [2022-12-12 21:43:30,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 340 flow [2022-12-12 21:43:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-12 21:43:30,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-12 21:43:30,604 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-12 21:43:30,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 62 transitions, 340 flow [2022-12-12 21:43:30,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 60 transitions, 332 flow [2022-12-12 21:43:30,611 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 60 transitions, 332 flow [2022-12-12 21:43:30,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:30,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:30,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:30,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:43:30,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1778556934, now seen corresponding path program 1 times [2022-12-12 21:43:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:30,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094360357] [2022-12-12 21:43:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:30,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:30,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094360357] [2022-12-12 21:43:30,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094360357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:30,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:30,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:43:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589878914] [2022-12-12 21:43:30,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:30,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:43:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:43:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:43:30,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-12 21:43:30,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 60 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:30,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:30,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-12 21:43:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:31,018 INFO L130 PetriNetUnfolder]: 1708/2817 cut-off events. [2022-12-12 21:43:31,018 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-12 21:43:31,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10373 conditions, 2817 events. 1708/2817 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15672 event pairs, 219 based on Foata normal form. 120/2434 useless extension candidates. Maximal degree in co-relation 10356. Up to 2257 conditions per place. [2022-12-12 21:43:31,029 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 44 selfloop transitions, 3 changer transitions 33/89 dead transitions. [2022-12-12 21:43:31,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 669 flow [2022-12-12 21:43:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:43:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:43:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-12 21:43:31,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-12 21:43:31,031 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2022-12-12 21:43:31,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 89 transitions, 669 flow [2022-12-12 21:43:31,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 56 transitions, 405 flow [2022-12-12 21:43:31,040 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 405 flow [2022-12-12 21:43:31,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:31,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:31,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:43:31,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 202855566, now seen corresponding path program 1 times [2022-12-12 21:43:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:31,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905962557] [2022-12-12 21:43:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:31,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905962557] [2022-12-12 21:43:31,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905962557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:31,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:31,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:43:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472061737] [2022-12-12 21:43:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:43:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:31,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:43:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:43:31,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 21:43:31,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:31,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:31,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 21:43:31,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:31,467 INFO L130 PetriNetUnfolder]: 1729/2746 cut-off events. [2022-12-12 21:43:31,467 INFO L131 PetriNetUnfolder]: For 2786/2819 co-relation queries the response was YES. [2022-12-12 21:43:31,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12187 conditions, 2746 events. 1729/2746 cut-off events. For 2786/2819 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14298 event pairs, 289 based on Foata normal form. 195/2497 useless extension candidates. Maximal degree in co-relation 12167. Up to 2159 conditions per place. [2022-12-12 21:43:31,486 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 61 selfloop transitions, 18 changer transitions 56/142 dead transitions. [2022-12-12 21:43:31,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 142 transitions, 1321 flow [2022-12-12 21:43:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:43:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:43:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-12 21:43:31,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-12 21:43:31,491 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -17 predicate places. [2022-12-12 21:43:31,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 142 transitions, 1321 flow [2022-12-12 21:43:31,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 86 transitions, 797 flow [2022-12-12 21:43:31,510 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 86 transitions, 797 flow [2022-12-12 21:43:31,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:31,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:31,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:31,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:43:31,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1556512969, now seen corresponding path program 1 times [2022-12-12 21:43:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:31,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012408313] [2022-12-12 21:43:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:31,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012408313] [2022-12-12 21:43:31,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012408313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:31,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:31,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:43:31,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221901029] [2022-12-12 21:43:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:31,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:43:31,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:31,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:43:31,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:43:31,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 21:43:31,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 86 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:31,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:31,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 21:43:31,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:32,186 INFO L130 PetriNetUnfolder]: 1051/1848 cut-off events. [2022-12-12 21:43:32,186 INFO L131 PetriNetUnfolder]: For 2351/2385 co-relation queries the response was YES. [2022-12-12 21:43:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10023 conditions, 1848 events. 1051/1848 cut-off events. For 2351/2385 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10051 event pairs, 69 based on Foata normal form. 198/1763 useless extension candidates. Maximal degree in co-relation 10000. Up to 1674 conditions per place. [2022-12-12 21:43:32,201 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 60 selfloop transitions, 31 changer transitions 40/138 dead transitions. [2022-12-12 21:43:32,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 138 transitions, 1528 flow [2022-12-12 21:43:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:43:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:43:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-12 21:43:32,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2022-12-12 21:43:32,204 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-12 21:43:32,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 138 transitions, 1528 flow [2022-12-12 21:43:32,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 98 transitions, 1084 flow [2022-12-12 21:43:32,214 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 98 transitions, 1084 flow [2022-12-12 21:43:32,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:32,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:32,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:43:32,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1792670231, now seen corresponding path program 1 times [2022-12-12 21:43:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721669326] [2022-12-12 21:43:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:32,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721669326] [2022-12-12 21:43:32,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721669326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:32,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:32,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:43:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144107299] [2022-12-12 21:43:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:32,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:43:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:43:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:43:32,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 21:43:32,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 98 transitions, 1084 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:32,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:32,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 21:43:32,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:32,632 INFO L130 PetriNetUnfolder]: 525/1028 cut-off events. [2022-12-12 21:43:32,632 INFO L131 PetriNetUnfolder]: For 1885/1920 co-relation queries the response was YES. [2022-12-12 21:43:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 1028 events. 525/1028 cut-off events. For 1885/1920 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5276 event pairs, 8 based on Foata normal form. 128/1002 useless extension candidates. Maximal degree in co-relation 6545. Up to 875 conditions per place. [2022-12-12 21:43:32,640 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 49 selfloop transitions, 40 changer transitions 16/112 dead transitions. [2022-12-12 21:43:32,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 112 transitions, 1444 flow [2022-12-12 21:43:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:43:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:43:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-12 21:43:32,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-12 21:43:32,642 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2022-12-12 21:43:32,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 112 transitions, 1444 flow [2022-12-12 21:43:32,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 96 transitions, 1238 flow [2022-12-12 21:43:32,649 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 96 transitions, 1238 flow [2022-12-12 21:43:32,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:32,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:32,650 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] [2022-12-12 21:43:32,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:43:32,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1288911398, now seen corresponding path program 1 times [2022-12-12 21:43:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:32,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513029434] [2022-12-12 21:43:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513029434] [2022-12-12 21:43:32,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513029434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:32,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:32,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:43:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116012678] [2022-12-12 21:43:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:32,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:43:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:43:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:43:32,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-12 21:43:32,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 96 transitions, 1238 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:32,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:32,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-12 21:43:32,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:32,981 INFO L130 PetriNetUnfolder]: 642/1223 cut-off events. [2022-12-12 21:43:32,981 INFO L131 PetriNetUnfolder]: For 3570/3601 co-relation queries the response was YES. [2022-12-12 21:43:32,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 1223 events. 642/1223 cut-off events. For 3570/3601 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6423 event pairs, 0 based on Foata normal form. 36/1045 useless extension candidates. Maximal degree in co-relation 8799. Up to 1057 conditions per place. [2022-12-12 21:43:32,986 INFO L137 encePairwiseOnDemand]: 54/60 looper letters, 84 selfloop transitions, 16 changer transitions 55/170 dead transitions. [2022-12-12 21:43:32,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 170 transitions, 2602 flow [2022-12-12 21:43:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:43:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:43:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-12 21:43:32,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-12 21:43:32,988 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -8 predicate places. [2022-12-12 21:43:32,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 170 transitions, 2602 flow [2022-12-12 21:43:32,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 115 transitions, 1695 flow [2022-12-12 21:43:32,993 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 115 transitions, 1695 flow [2022-12-12 21:43:32,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:32,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:32,993 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] [2022-12-12 21:43:32,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:43:32,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 948829674, now seen corresponding path program 1 times [2022-12-12 21:43:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932311259] [2022-12-12 21:43:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:33,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932311259] [2022-12-12 21:43:33,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932311259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:33,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:33,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:43:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411625593] [2022-12-12 21:43:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:33,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:43:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:43:33,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:43:33,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-12 21:43:33,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 115 transitions, 1695 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:33,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:33,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-12 21:43:33,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:33,640 INFO L130 PetriNetUnfolder]: 532/1120 cut-off events. [2022-12-12 21:43:33,641 INFO L131 PetriNetUnfolder]: For 3139/3158 co-relation queries the response was YES. [2022-12-12 21:43:33,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8729 conditions, 1120 events. 532/1120 cut-off events. For 3139/3158 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6663 event pairs, 0 based on Foata normal form. 46/966 useless extension candidates. Maximal degree in co-relation 8697. Up to 976 conditions per place. [2022-12-12 21:43:33,646 INFO L137 encePairwiseOnDemand]: 51/60 looper letters, 60 selfloop transitions, 14 changer transitions 85/171 dead transitions. [2022-12-12 21:43:33,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 171 transitions, 2879 flow [2022-12-12 21:43:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 21:43:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 21:43:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 208 transitions. [2022-12-12 21:43:33,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24761904761904763 [2022-12-12 21:43:33,652 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2022-12-12 21:43:33,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 171 transitions, 2879 flow [2022-12-12 21:43:33,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 86 transitions, 1409 flow [2022-12-12 21:43:33,659 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 86 transitions, 1409 flow [2022-12-12 21:43:33,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:33,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:33,659 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] [2022-12-12 21:43:33,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:43:33,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2013671171, now seen corresponding path program 1 times [2022-12-12 21:43:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:33,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986761091] [2022-12-12 21:43:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:34,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986761091] [2022-12-12 21:43:34,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986761091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:34,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:34,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:43:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421466565] [2022-12-12 21:43:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:34,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:43:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:43:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:43:34,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 21:43:34,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 86 transitions, 1409 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:34,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:34,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 21:43:34,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:34,423 INFO L130 PetriNetUnfolder]: 367/803 cut-off events. [2022-12-12 21:43:34,423 INFO L131 PetriNetUnfolder]: For 2404/2405 co-relation queries the response was YES. [2022-12-12 21:43:34,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 803 events. 367/803 cut-off events. For 2404/2405 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4565 event pairs, 0 based on Foata normal form. 28/668 useless extension candidates. Maximal degree in co-relation 6984. Up to 747 conditions per place. [2022-12-12 21:43:34,427 INFO L137 encePairwiseOnDemand]: 54/60 looper letters, 53 selfloop transitions, 6 changer transitions 53/125 dead transitions. [2022-12-12 21:43:34,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 125 transitions, 2333 flow [2022-12-12 21:43:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:43:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:43:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-12 21:43:34,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26904761904761904 [2022-12-12 21:43:34,428 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2022-12-12 21:43:34,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 125 transitions, 2333 flow [2022-12-12 21:43:34,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 72 transitions, 1281 flow [2022-12-12 21:43:34,432 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 1281 flow [2022-12-12 21:43:34,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:34,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:34,432 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] [2022-12-12 21:43:34,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:43:34,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 698598576, now seen corresponding path program 2 times [2022-12-12 21:43:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:34,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045588142] [2022-12-12 21:43:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:43:34,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:43:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:43:34,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:43:34,497 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:43:34,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:43:34,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:43:34,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:43:34,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:43:34,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:43:34,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:43:34,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:43:34,500 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:34,503 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:43:34,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:43:34,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:43:34 BasicIcfg [2022-12-12 21:43:34,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:43:34,541 INFO L158 Benchmark]: Toolchain (without parser) took 10300.87ms. Allocated memory was 187.7MB in the beginning and 660.6MB in the end (delta: 472.9MB). Free memory was 162.2MB in the beginning and 354.7MB in the end (delta: -192.6MB). Peak memory consumption was 281.2MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,542 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 187.7MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:43:34,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.75ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 135.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.11ms. Allocated memory is still 187.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,542 INFO L158 Benchmark]: Boogie Preprocessor took 40.41ms. Allocated memory is still 187.7MB. Free memory was 132.6MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,542 INFO L158 Benchmark]: RCFGBuilder took 529.21ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 98.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,543 INFO L158 Benchmark]: TraceAbstraction took 9222.36ms. Allocated memory was 187.7MB in the beginning and 660.6MB in the end (delta: 472.9MB). Free memory was 97.5MB in the beginning and 354.7MB in the end (delta: -257.2MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. [2022-12-12 21:43:34,544 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.30ms. Allocated memory is still 187.7MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.75ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 135.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.11ms. Allocated memory is still 187.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.41ms. Allocated memory is still 187.7MB. Free memory was 132.6MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 529.21ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 98.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9222.36ms. Allocated memory was 187.7MB in the beginning and 660.6MB in the end (delta: 472.9MB). Free memory was 97.5MB in the beginning and 354.7MB in the end (delta: -257.2MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 113 PlacesBefore, 69 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 3294, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1828, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 171, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3408, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 3423, Positive cache size: 3380, Positive conditional cache size: 0, Positive unconditional cache size: 3380, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-1, t2345={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, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=0, t2345={5:0}, t2346={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, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=1, t2345={5:0}, t2346={6:0}, t2347={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, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 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) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 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) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 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 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 836]: 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: 838]: 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: 834]: 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: 9.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 3 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 9 MinimizatonAttempts, 5075 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:43:34,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...