/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:23:00,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:23:00,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:23:00,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:23:00,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:23:00,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:23:00,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:23:00,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:23:00,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:23:00,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:23:00,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:23:00,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:23:00,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:23:00,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:23:00,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:23:00,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:23:00,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:23:00,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:23:00,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:23:00,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:23:00,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:23:00,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:23:00,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:23:00,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:23:00,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:23:00,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:23:00,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:23:00,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:23:00,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:23:00,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:23:00,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:23:00,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:23:00,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:23:00,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:23:00,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:23:00,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:23:00,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:23:00,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:23:00,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:23:00,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:23:00,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:23:00,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:23:00,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:23:00,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:23:00,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:23:00,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:23:00,482 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:23:00,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:23:00,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:23:00,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:23:00,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:23:00,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:23:00,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:23:00,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:23:00,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:00,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:23:00,485 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:23:00,485 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-13 06:23:00,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:23:00,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:23:00,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:23:00,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:23:00,787 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:23:00,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-12-13 06:23:02,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:23:02,348 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:23:02,348 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-12-13 06:23:02,362 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e3a77ed/9a40b7ce556b4b7182d23500cc051c08/FLAG6e8a53eec [2022-12-13 06:23:02,376 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e3a77ed/9a40b7ce556b4b7182d23500cc051c08 [2022-12-13 06:23:02,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:23:02,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:23:02,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:02,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:23:02,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:23:02,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7506bc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02, skipping insertion in model container [2022-12-13 06:23:02,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:23:02,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:23:02,669 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-12-13 06:23:02,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:02,804 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:23:02,814 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-12-13 06:23:02,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:02,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:02,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:02,904 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:23:02,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02 WrapperNode [2022-12-13 06:23:02,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:02,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:02,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:23:02,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:23:02,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,966 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-12-13 06:23:02,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:02,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:23:02,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:23:02,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:23:02,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,984 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:23:02,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:23:02,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:23:02,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:23:02,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (1/1) ... [2022-12-13 06:23:02,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:23:03,012 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-13 06:23:03,018 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-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:23:03,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:23:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:23:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:23:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:23:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:23:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:23:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:23:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:23:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:23:03,063 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:23:03,222 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:23:03,223 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:23:03,663 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:23:03,822 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:23:03,822 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:23:03,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:03 BoogieIcfgContainer [2022-12-13 06:23:03,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:23:03,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:23:03,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:23:03,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:23:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:23:02" (1/3) ... [2022-12-13 06:23:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574c1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:03, skipping insertion in model container [2022-12-13 06:23:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:02" (2/3) ... [2022-12-13 06:23:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574c1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:03, skipping insertion in model container [2022-12-13 06:23:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:03" (3/3) ... [2022-12-13 06:23:03,831 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-12-13 06:23:03,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:23:03,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 06:23:03,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:23:03,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:23:03,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 216 flow [2022-12-13 06:23:03,968 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2022-12-13 06:23:03,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:03,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-12-13 06:23:03,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 103 transitions, 216 flow [2022-12-13 06:23:03,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 91 transitions, 188 flow [2022-12-13 06:23:03,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:03,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 188 flow [2022-12-13 06:23:03,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 188 flow [2022-12-13 06:23:04,025 INFO L130 PetriNetUnfolder]: 1/91 cut-off events. [2022-12-13 06:23:04,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:04,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 1/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-12-13 06:23:04,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 188 flow [2022-12-13 06:23:04,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 06:23:08,953 INFO L241 LiptonReduction]: Total number of compositions: 78 [2022-12-13 06:23:08,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:23:09,007 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@459b45c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:23:09,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 06:23:09,011 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 06:23:09,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:09,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:09,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:23:09,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 509057335, now seen corresponding path program 1 times [2022-12-13 06:23:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:09,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636356407] [2022-12-13 06:23:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:09,245 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-13 06:23:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636356407] [2022-12-13 06:23:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636356407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:09,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:09,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:09,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138565568] [2022-12-13 06:23:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 06:23:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:09,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 06:23:09,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 06:23:09,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2022-12-13 06:23:09,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-13 06:23:09,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:09,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2022-12-13 06:23:09,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:09,354 INFO L130 PetriNetUnfolder]: 111/225 cut-off events. [2022-12-13 06:23:09,356 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 06:23:09,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 225 events. 111/225 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 946 event pairs, 111 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 429. Up to 201 conditions per place. [2022-12-13 06:23:09,361 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 14 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-13 06:23:09,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:23:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 06:23:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-12-13 06:23:09,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 06:23:09,376 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-13 06:23:09,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:09,380 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:09,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:09,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 06:23:09,415 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:09,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 06:23:09,417 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 74 flow [2022-12-13 06:23:09,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-13 06:23:09,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:09,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:09,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:23:09,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -422189992, now seen corresponding path program 1 times [2022-12-13 06:23:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:09,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106533395] [2022-12-13 06:23:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:09,692 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-13 06:23:09,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:09,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106533395] [2022-12-13 06:23:09,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106533395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:09,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:09,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238134602] [2022-12-13 06:23:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:09,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:09,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:09,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:09,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2022-12-13 06:23:09,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 06:23:09,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:09,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2022-12-13 06:23:09,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:09,779 INFO L130 PetriNetUnfolder]: 104/220 cut-off events. [2022-12-13 06:23:09,779 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-12-13 06:23:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 220 events. 104/220 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 965 event pairs, 24 based on Foata normal form. 4/186 useless extension candidates. Maximal degree in co-relation 600. Up to 190 conditions per place. [2022-12-13 06:23:09,782 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 06:23:09,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-13 06:23:09,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 06:23:09,783 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-13 06:23:09,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:09,786 INFO L89 Accepts]: Start accepts. Operand has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:09,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:09,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 06:23:09,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:09,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 06:23:09,807 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 132 flow [2022-12-13 06:23:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 06:23:09,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:09,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:23:09,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -202987129, now seen corresponding path program 1 times [2022-12-13 06:23:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762770740] [2022-12-13 06:23:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:10,051 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-13 06:23:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762770740] [2022-12-13 06:23:10,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762770740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:10,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:10,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304562879] [2022-12-13 06:23:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:10,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2022-12-13 06:23:10,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 06:23:10,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:10,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2022-12-13 06:23:10,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:10,113 INFO L130 PetriNetUnfolder]: 97/214 cut-off events. [2022-12-13 06:23:10,113 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 06:23:10,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 214 events. 97/214 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 932 event pairs, 9 based on Foata normal form. 4/182 useless extension candidates. Maximal degree in co-relation 748. Up to 179 conditions per place. [2022-12-13 06:23:10,116 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 26 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 06:23:10,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 06:23:10,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2022-12-13 06:23:10,120 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-13 06:23:10,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:10,122 INFO L89 Accepts]: Start accepts. Operand has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:10,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:10,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 06:23:10,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:10,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:23:10,128 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 253 flow [2022-12-13 06:23:10,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 06:23:10,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:10,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:23:10,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1997668525, now seen corresponding path program 1 times [2022-12-13 06:23:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185663067] [2022-12-13 06:23:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:10,288 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-13 06:23:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185663067] [2022-12-13 06:23:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185663067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:10,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:10,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643227621] [2022-12-13 06:23:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:10,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:10,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2022-12-13 06:23:10,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-13 06:23:10,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:10,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2022-12-13 06:23:10,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:10,399 INFO L130 PetriNetUnfolder]: 160/343 cut-off events. [2022-12-13 06:23:10,399 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-12-13 06:23:10,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 343 events. 160/343 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1664 event pairs, 9 based on Foata normal form. 16/299 useless extension candidates. Maximal degree in co-relation 1468. Up to 278 conditions per place. [2022-12-13 06:23:10,401 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 24 selfloop transitions, 3 changer transitions 21/52 dead transitions. [2022-12-13 06:23:10,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 486 flow [2022-12-13 06:23:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 06:23:10,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 06:23:10,402 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-13 06:23:10,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 52 transitions, 486 flow [2022-12-13 06:23:10,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 284 flow [2022-12-13 06:23:10,405 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:10,406 INFO L89 Accepts]: Start accepts. Operand has 34 places, 31 transitions, 284 flow [2022-12-13 06:23:10,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:10,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:10,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 31 transitions, 284 flow [2022-12-13 06:23:10,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 31 transitions, 284 flow [2022-12-13 06:23:10,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 06:23:10,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:10,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 06:23:10,433 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 284 flow [2022-12-13 06:23:10,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-13 06:23:10,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:10,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:10,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:23:10,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1798261159, now seen corresponding path program 1 times [2022-12-13 06:23:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177351883] [2022-12-13 06:23:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:11,218 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-13 06:23:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177351883] [2022-12-13 06:23:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177351883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:11,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:11,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:23:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81012655] [2022-12-13 06:23:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:23:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:23:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:23:11,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 06:23:11,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:11,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:11,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 06:23:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:11,349 INFO L130 PetriNetUnfolder]: 127/258 cut-off events. [2022-12-13 06:23:11,349 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2022-12-13 06:23:11,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 258 events. 127/258 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 986 event pairs, 9 based on Foata normal form. 3/217 useless extension candidates. Maximal degree in co-relation 1334. Up to 209 conditions per place. [2022-12-13 06:23:11,351 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 40 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-13 06:23:11,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 06:23:11,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2022-12-13 06:23:11,366 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-13 06:23:11,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:11,369 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:11,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:11,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 564 flow [2022-12-13 06:23:11,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 06:23:11,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:11,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-13 06:23:11,781 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 572 flow [2022-12-13 06:23:11,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:11,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:11,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:11,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:23:11,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1353618137, now seen corresponding path program 2 times [2022-12-13 06:23:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:11,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437615767] [2022-12-13 06:23:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:12,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-13 06:23:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437615767] [2022-12-13 06:23:12,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437615767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:12,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:12,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:23:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144563845] [2022-12-13 06:23:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:12,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:23:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:23:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:23:12,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2022-12-13 06:23:12,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:12,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:12,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2022-12-13 06:23:12,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:12,513 INFO L130 PetriNetUnfolder]: 122/250 cut-off events. [2022-12-13 06:23:12,513 INFO L131 PetriNetUnfolder]: For 476/476 co-relation queries the response was YES. [2022-12-13 06:23:12,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 250 events. 122/250 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 967 event pairs, 6 based on Foata normal form. 3/210 useless extension candidates. Maximal degree in co-relation 1553. Up to 213 conditions per place. [2022-12-13 06:23:12,515 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-13 06:23:12,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 06:23:12,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5125 [2022-12-13 06:23:12,519 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2022-12-13 06:23:12,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:12,524 INFO L89 Accepts]: Start accepts. Operand has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:12,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:12,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 49 transitions, 650 flow [2022-12-13 06:23:12,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 06:23:14,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:14,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1769 [2022-12-13 06:23:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 49 transitions, 658 flow [2022-12-13 06:23:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:14,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:14,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:23:14,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash 88477267, now seen corresponding path program 1 times [2022-12-13 06:23:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688653724] [2022-12-13 06:23:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:14,439 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-13 06:23:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:14,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688653724] [2022-12-13 06:23:14,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688653724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:14,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:14,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66021875] [2022-12-13 06:23:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:14,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:14,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 06:23:14,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 49 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-13 06:23:14,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:14,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 06:23:14,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:14,503 INFO L130 PetriNetUnfolder]: 109/242 cut-off events. [2022-12-13 06:23:14,504 INFO L131 PetriNetUnfolder]: For 1013/1014 co-relation queries the response was YES. [2022-12-13 06:23:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 242 events. 109/242 cut-off events. For 1013/1014 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1017 event pairs, 12 based on Foata normal form. 10/221 useless extension candidates. Maximal degree in co-relation 1673. Up to 210 conditions per place. [2022-12-13 06:23:14,505 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 36 selfloop transitions, 15 changer transitions 1/54 dead transitions. [2022-12-13 06:23:14,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 804 flow [2022-12-13 06:23:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 06:23:14,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 06:23:14,509 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-13 06:23:14,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 54 transitions, 804 flow [2022-12-13 06:23:14,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 53 transitions, 802 flow [2022-12-13 06:23:14,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:14,512 INFO L89 Accepts]: Start accepts. Operand has 41 places, 53 transitions, 802 flow [2022-12-13 06:23:14,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:14,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:14,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 53 transitions, 802 flow [2022-12-13 06:23:14,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 53 transitions, 802 flow [2022-12-13 06:23:14,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 06:23:14,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:14,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-13 06:23:14,859 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 53 transitions, 802 flow [2022-12-13 06:23:14,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-13 06:23:14,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:14,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:14,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:23:14,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1802265851, now seen corresponding path program 1 times [2022-12-13 06:23:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013346909] [2022-12-13 06:23:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:15,016 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-13 06:23:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013346909] [2022-12-13 06:23:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013346909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783650235] [2022-12-13 06:23:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:15,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-13 06:23:15,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 53 transitions, 802 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-13 06:23:15,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:15,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-13 06:23:15,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:15,066 INFO L130 PetriNetUnfolder]: 37/111 cut-off events. [2022-12-13 06:23:15,066 INFO L131 PetriNetUnfolder]: For 786/791 co-relation queries the response was YES. [2022-12-13 06:23:15,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 111 events. 37/111 cut-off events. For 786/791 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 402 event pairs, 0 based on Foata normal form. 26/121 useless extension candidates. Maximal degree in co-relation 860. Up to 89 conditions per place. [2022-12-13 06:23:15,067 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 23 selfloop transitions, 21 changer transitions 0/46 dead transitions. [2022-12-13 06:23:15,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 06:23:15,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 06:23:15,069 INFO L295 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-13 06:23:15,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:15,071 INFO L89 Accepts]: Start accepts. Operand has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:15,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:15,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 46 transitions, 778 flow [2022-12-13 06:23:15,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 06:23:15,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:15,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 805 [2022-12-13 06:23:15,876 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 45 transitions, 760 flow [2022-12-13 06:23:15,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-13 06:23:15,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:15,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:15,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:23:15,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:23:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1931563027, now seen corresponding path program 1 times [2022-12-13 06:23:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46591768] [2022-12-13 06:23:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:23:15,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:23:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:23:15,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:23:15,939 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:23:15,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 06:23:15,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 06:23:15,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 06:23:15,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:23:15,941 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:15,944 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:23:15,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:23:15,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:23:15 BasicIcfg [2022-12-13 06:23:15,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:23:15,981 INFO L158 Benchmark]: Toolchain (without parser) took 13598.96ms. Allocated memory was 203.4MB in the beginning and 360.7MB in the end (delta: 157.3MB). Free memory was 177.5MB in the beginning and 260.4MB in the end (delta: -82.8MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,981 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:23:15,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.20ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 152.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,981 INFO L158 Benchmark]: Boogie Preprocessor took 20.19ms. Allocated memory is still 203.4MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,982 INFO L158 Benchmark]: RCFGBuilder took 837.38ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 148.2MB in the beginning and 204.3MB in the end (delta: -56.1MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,982 INFO L158 Benchmark]: TraceAbstraction took 12153.96ms. Allocated memory was 245.4MB in the beginning and 360.7MB in the end (delta: 115.3MB). Free memory was 203.2MB in the beginning and 260.4MB in the end (delta: -57.1MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-13 06:23:15,983 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.15ms. Allocated memory is still 203.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.20ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 152.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.19ms. Allocated memory is still 203.4MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 837.38ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 148.2MB in the beginning and 204.3MB in the end (delta: -56.1MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12153.96ms. Allocated memory was 245.4MB in the beginning and 360.7MB in the end (delta: 115.3MB). Free memory was 203.2MB in the beginning and 260.4MB in the end (delta: -57.1MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 97 PlacesBefore, 27 PlacesAfterwards, 91 TransitionsBefore, 21 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 52 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 78 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 834, independent: 760, independent conditional: 760, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 834, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 834, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 834, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 480, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 480, independent: 438, independent conditional: 0, independent unconditional: 438, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 834, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 480, unknown conditional: 0, unknown unconditional: 480] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 610, Positive conditional cache size: 0, Positive unconditional cache size: 610, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 23, independent unconditional: 8, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 15, independent unconditional: 28, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 40 PlacesBefore, 40 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 41 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 43 PlacesBefore, 42 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 2, Positive unconditional cache size: 44, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={7:0}, t1930={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = 1 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 119 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=802occurred in iteration=7, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-13 06:23:16,009 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...