/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:31:36,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:31:36,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:31:36,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:31:36,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:31:36,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:31:36,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:31:36,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:31:36,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:31:36,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:31:36,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:31:36,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:31:36,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:31:36,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:31:36,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:31:36,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:31:36,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:31:36,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:31:36,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:31:36,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:31:36,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:31:36,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:31:36,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:31:36,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:31:36,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:31:36,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:31:36,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:31:36,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:31:36,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:31:36,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:31:36,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:31:36,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:31:36,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:31:36,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:31:36,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:31:36,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:31:36,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:31:36,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:31:36,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:31:36,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:31:36,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:31:36,335 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:31:36,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:31:36,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:31:36,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:31:36,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:31:36,356 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:31:36,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:31:36,356 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:31:36,357 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:31:36,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:31:36,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:31:36,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:31:36,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:31:36,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:31:36,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:31:36,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:31:36,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:31:36,683 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:31:36,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2022-12-06 04:31:37,756 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:31:37,950 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:31:37,950 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2022-12-06 04:31:37,985 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da02b068/3831618874964f57b2442ab2e4ce2962/FLAG4c39a47dc [2022-12-06 04:31:37,997 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da02b068/3831618874964f57b2442ab2e4ce2962 [2022-12-06 04:31:37,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:31:38,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:31:38,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:31:38,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:31:38,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:31:38,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:31:37" (1/1) ... [2022-12-06 04:31:38,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5361ce7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38, skipping insertion in model container [2022-12-06 04:31:38,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:31:37" (1/1) ... [2022-12-06 04:31:38,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:31:38,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:31:38,202 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/safe020_rmo.i[988,1001] [2022-12-06 04:31:38,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:31:38,428 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:31:38,441 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/safe020_rmo.i[988,1001] [2022-12-06 04:31:38,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:31:38,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:31:38,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:31:38,545 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:31:38,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38 WrapperNode [2022-12-06 04:31:38,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:31:38,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:31:38,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:31:38,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:31:38,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,628 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-12-06 04:31:38,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:31:38,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:31:38,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:31:38,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:31:38,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,683 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:31:38,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:31:38,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:31:38,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:31:38,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (1/1) ... [2022-12-06 04:31:38,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:31:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:31:38,729 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-06 04:31:38,747 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-06 04:31:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:31:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:31:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:31:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:31:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:31:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:31:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:31:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:31:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:31:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:31:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:31:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:31:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:31:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:31:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:31:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:31:38,768 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:31:38,966 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:31:38,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:31:39,367 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:31:39,582 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:31:39,582 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:31:39,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:39 BoogieIcfgContainer [2022-12-06 04:31:39,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:31:39,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:31:39,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:31:39,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:31:39,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:31:37" (1/3) ... [2022-12-06 04:31:39,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91cac23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:39, skipping insertion in model container [2022-12-06 04:31:39,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:31:38" (2/3) ... [2022-12-06 04:31:39,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91cac23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:39, skipping insertion in model container [2022-12-06 04:31:39,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:39" (3/3) ... [2022-12-06 04:31:39,594 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2022-12-06 04:31:39,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:31:39,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:31:39,642 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:31:39,699 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:31:39,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 04:31:39,782 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-06 04:31:39,782 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:39,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 04:31:39,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 04:31:39,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-06 04:31:39,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:39,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 04:31:39,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-06 04:31:39,857 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-06 04:31:39,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:39,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:31:39,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 04:31:39,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 04:31:45,666 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 04:31:45,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:31:45,682 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;@269228ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:31:45,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:31:45,686 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:31:45,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:45,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:45,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:45,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:45,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1401885519, now seen corresponding path program 1 times [2022-12-06 04:31:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:45,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016498617] [2022-12-06 04:31:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:45,900 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-06 04:31:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:45,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016498617] [2022-12-06 04:31:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016498617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:45,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:45,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28634503] [2022-12-06 04:31:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:45,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:31:45,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:31:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:31:45,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:31:45,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 04:31:45,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:45,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:31:45,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:46,143 INFO L130 PetriNetUnfolder]: 567/888 cut-off events. [2022-12-06 04:31:46,144 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:31:46,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 888 events. 567/888 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3521 event pairs, 567 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1788. Up to 865 conditions per place. [2022-12-06 04:31:46,155 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 04:31:46,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 83 flow [2022-12-06 04:31:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:31:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:31:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 04:31:46,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 04:31:46,165 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 21 transitions. [2022-12-06 04:31:46,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 83 flow [2022-12-06 04:31:46,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:46,168 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 04:31:46,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 04:31:46,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 04:31:46,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:46,174 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 04:31:46,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:46,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:46,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 04:31:46,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 04:31:46,182 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:31:46,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:31:46,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 04:31:46,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:31:46,322 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:46,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 04:31:46,324 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 04:31:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 04:31:46,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:46,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:46,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:31:46,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1407740472, now seen corresponding path program 1 times [2022-12-06 04:31:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:46,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083250339] [2022-12-06 04:31:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:46,724 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-06 04:31:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:46,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083250339] [2022-12-06 04:31:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083250339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:46,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:46,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200892450] [2022-12-06 04:31:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:46,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:46,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:46,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:31:46,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:46,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:46,890 INFO L130 PetriNetUnfolder]: 527/856 cut-off events. [2022-12-06 04:31:46,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:46,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 856 events. 527/856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3508 event pairs, 143 based on Foata normal form. 16/872 useless extension candidates. Maximal degree in co-relation 1700. Up to 609 conditions per place. [2022-12-06 04:31:46,895 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 04:31:46,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 112 flow [2022-12-06 04:31:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 04:31:46,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:31:46,898 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 30 transitions. [2022-12-06 04:31:46,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 112 flow [2022-12-06 04:31:46,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:31:46,899 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:31:46,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:31:46,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:46,901 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:46,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:46,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,907 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:31:46,907 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:31:46,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:31:46,966 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:46,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 04:31:46,967 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:31:46,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:31:46,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:46,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:46,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:31:46,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -690282182, now seen corresponding path program 1 times [2022-12-06 04:31:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761271432] [2022-12-06 04:31:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:47,128 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-06 04:31:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761271432] [2022-12-06 04:31:47,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761271432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:47,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:47,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:47,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968406194] [2022-12-06 04:31:47,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:47,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:47,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:31:47,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-06 04:31:47,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:47,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:31:47,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:47,299 INFO L130 PetriNetUnfolder]: 660/1001 cut-off events. [2022-12-06 04:31:47,299 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 04:31:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1001 events. 660/1001 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3902 event pairs, 177 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 2194. Up to 938 conditions per place. [2022-12-06 04:31:47,304 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 04:31:47,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 145 flow [2022-12-06 04:31:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:31:47,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:31:47,305 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:31:47,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 145 flow [2022-12-06 04:31:47,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:47,306 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-06 04:31:47,307 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 04:31:47,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:47,307 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:47,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:47,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,315 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 04:31:47,315 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:31:47,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-06 04:31:47,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 04:31:47,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:47,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 04:31:47,427 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 67 flow [2022-12-06 04:31:47,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-06 04:31:47,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:47,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:47,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:31:47,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 18024305, now seen corresponding path program 1 times [2022-12-06 04:31:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:47,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104251586] [2022-12-06 04:31:47,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:48,801 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-06 04:31:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104251586] [2022-12-06 04:31:48,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104251586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:48,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:48,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:48,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154489831] [2022-12-06 04:31:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:48,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:48,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:48,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 67 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-06 04:31:48,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:48,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:49,036 INFO L130 PetriNetUnfolder]: 531/857 cut-off events. [2022-12-06 04:31:49,037 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-06 04:31:49,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 857 events. 531/857 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3438 event pairs, 153 based on Foata normal form. 15/872 useless extension candidates. Maximal degree in co-relation 2013. Up to 664 conditions per place. [2022-12-06 04:31:49,042 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 04:31:49,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 184 flow [2022-12-06 04:31:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:31:49,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-06 04:31:49,044 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 67 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:31:49,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 184 flow [2022-12-06 04:31:49,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:49,046 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-06 04:31:49,050 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-06 04:31:49,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:49,050 INFO L89 Accepts]: Start accepts. Operand has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:49,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:49,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,059 INFO L130 PetriNetUnfolder]: 5/38 cut-off events. [2022-12-06 04:31:49,059 INFO L131 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2022-12-06 04:31:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 38 events. 5/38 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 67. Up to 13 conditions per place. [2022-12-06 04:31:49,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 04:31:49,100 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:49,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:31:49,105 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 86 flow [2022-12-06 04:31:49,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-06 04:31:49,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:49,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:49,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:31:49,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -927633386, now seen corresponding path program 1 times [2022-12-06 04:31:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099084732] [2022-12-06 04:31:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:49,273 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-06 04:31:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:49,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099084732] [2022-12-06 04:31:49,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099084732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:49,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:49,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600135763] [2022-12-06 04:31:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:49,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:49,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:49,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-06 04:31:49,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:49,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:49,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:49,444 INFO L130 PetriNetUnfolder]: 454/756 cut-off events. [2022-12-06 04:31:49,444 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 04:31:49,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 756 events. 454/756 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3226 event pairs, 91 based on Foata normal form. 76/826 useless extension candidates. Maximal degree in co-relation 1931. Up to 428 conditions per place. [2022-12-06 04:31:49,448 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 4 changer transitions 25/64 dead transitions. [2022-12-06 04:31:49,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 350 flow [2022-12-06 04:31:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:31:49,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:31:49,450 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 86 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:31:49,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 350 flow [2022-12-06 04:31:49,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 64 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:49,452 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 119 flow [2022-12-06 04:31:49,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:31:49,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-06 04:31:49,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:49,452 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 119 flow [2022-12-06 04:31:49,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:49,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:49,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 119 flow [2022-12-06 04:31:49,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 119 flow [2022-12-06 04:31:49,465 INFO L130 PetriNetUnfolder]: 46/118 cut-off events. [2022-12-06 04:31:49,465 INFO L131 PetriNetUnfolder]: For 94/107 co-relation queries the response was YES. [2022-12-06 04:31:49,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 118 events. 46/118 cut-off events. For 94/107 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 458 event pairs, 21 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 313. Up to 62 conditions per place. [2022-12-06 04:31:49,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 119 flow [2022-12-06 04:31:49,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 04:31:49,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:49,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 04:31:49,476 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 119 flow [2022-12-06 04:31:49,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-06 04:31:49,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:49,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:49,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:31:49,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -838198224, now seen corresponding path program 1 times [2022-12-06 04:31:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:49,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482458764] [2022-12-06 04:31:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:49,712 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-06 04:31:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482458764] [2022-12-06 04:31:49,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482458764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:49,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490177275] [2022-12-06 04:31:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:49,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:31:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:31:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:31:49,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:49,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 04:31:49,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:49,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:49,941 INFO L130 PetriNetUnfolder]: 228/416 cut-off events. [2022-12-06 04:31:49,942 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-06 04:31:49,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 416 events. 228/416 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1591 event pairs, 51 based on Foata normal form. 40/454 useless extension candidates. Maximal degree in co-relation 1285. Up to 139 conditions per place. [2022-12-06 04:31:49,945 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 7 changer transitions 22/72 dead transitions. [2022-12-06 04:31:49,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 441 flow [2022-12-06 04:31:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 04:31:49,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 04:31:49,947 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 119 flow. Second operand 6 states and 69 transitions. [2022-12-06 04:31:49,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 441 flow [2022-12-06 04:31:49,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 435 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:49,951 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 169 flow [2022-12-06 04:31:49,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2022-12-06 04:31:49,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2022-12-06 04:31:49,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:49,952 INFO L89 Accepts]: Start accepts. Operand has 44 places, 29 transitions, 169 flow [2022-12-06 04:31:49,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:49,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:49,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 169 flow [2022-12-06 04:31:49,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 169 flow [2022-12-06 04:31:49,966 INFO L130 PetriNetUnfolder]: 19/70 cut-off events. [2022-12-06 04:31:49,966 INFO L131 PetriNetUnfolder]: For 119/137 co-relation queries the response was YES. [2022-12-06 04:31:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 70 events. 19/70 cut-off events. For 119/137 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 4 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 228. Up to 33 conditions per place. [2022-12-06 04:31:49,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 169 flow [2022-12-06 04:31:49,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 04:31:49,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:49,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 04:31:49,984 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 169 flow [2022-12-06 04:31:49,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 04:31:49,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:49,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:49,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:31:49,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 533631755, now seen corresponding path program 1 times [2022-12-06 04:31:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:49,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028787516] [2022-12-06 04:31:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:50,240 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-06 04:31:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028787516] [2022-12-06 04:31:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028787516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491729086] [2022-12-06 04:31:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:50,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:50,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-06 04:31:50,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:50,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:50,426 INFO L130 PetriNetUnfolder]: 150/281 cut-off events. [2022-12-06 04:31:50,426 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-06 04:31:50,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 281 events. 150/281 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 956 event pairs, 47 based on Foata normal form. 11/291 useless extension candidates. Maximal degree in co-relation 918. Up to 111 conditions per place. [2022-12-06 04:31:50,429 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 38 selfloop transitions, 10 changer transitions 10/60 dead transitions. [2022-12-06 04:31:50,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 411 flow [2022-12-06 04:31:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:31:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:31:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 04:31:50,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45864661654135336 [2022-12-06 04:31:50,431 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 169 flow. Second operand 7 states and 61 transitions. [2022-12-06 04:31:50,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 411 flow [2022-12-06 04:31:50,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 356 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 04:31:50,435 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 160 flow [2022-12-06 04:31:50,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-06 04:31:50,436 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2022-12-06 04:31:50,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:50,436 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 160 flow [2022-12-06 04:31:50,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:50,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:50,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 160 flow [2022-12-06 04:31:50,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 160 flow [2022-12-06 04:31:50,447 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 04:31:50,447 INFO L131 PetriNetUnfolder]: For 55/61 co-relation queries the response was YES. [2022-12-06 04:31:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 45 events. 10/45 cut-off events. For 55/61 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2022-12-06 04:31:50,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 160 flow [2022-12-06 04:31:50,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 04:31:51,799 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:31:51,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1364 [2022-12-06 04:31:51,800 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 156 flow [2022-12-06 04:31:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-06 04:31:51,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:51,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:31:51,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1931539679, now seen corresponding path program 1 times [2022-12-06 04:31:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:51,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222602451] [2022-12-06 04:31:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:52,036 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-06 04:31:52,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:52,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222602451] [2022-12-06 04:31:52,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222602451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:52,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:52,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635320625] [2022-12-06 04:31:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:52,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:31:52,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 156 flow. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-06 04:31:52,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:52,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:31:52,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:52,142 INFO L130 PetriNetUnfolder]: 198/356 cut-off events. [2022-12-06 04:31:52,142 INFO L131 PetriNetUnfolder]: For 510/510 co-relation queries the response was YES. [2022-12-06 04:31:52,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 356 events. 198/356 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1290 event pairs, 92 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1129. Up to 249 conditions per place. [2022-12-06 04:31:52,145 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 30 selfloop transitions, 2 changer transitions 8/40 dead transitions. [2022-12-06 04:31:52,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 323 flow [2022-12-06 04:31:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 04:31:52,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-06 04:31:52,147 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 156 flow. Second operand 3 states and 26 transitions. [2022-12-06 04:31:52,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 323 flow [2022-12-06 04:31:52,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 255 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-06 04:31:52,152 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 118 flow [2022-12-06 04:31:52,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:31:52,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-06 04:31:52,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:52,154 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 118 flow [2022-12-06 04:31:52,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:52,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:52,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 118 flow [2022-12-06 04:31:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 118 flow [2022-12-06 04:31:52,170 INFO L130 PetriNetUnfolder]: 7/36 cut-off events. [2022-12-06 04:31:52,171 INFO L131 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2022-12-06 04:31:52,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 36 events. 7/36 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 85. Up to 10 conditions per place. [2022-12-06 04:31:52,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 118 flow [2022-12-06 04:31:52,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:31:52,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L822-->L825: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [587] $Ultimate##0-->L760: Formula: (and (= v_~y~0_13 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_13, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-06 04:31:52,718 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:31:52,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 565 [2022-12-06 04:31:52,720 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 122 flow [2022-12-06 04:31:52,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-06 04:31:52,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:52,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:52,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:31:52,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:31:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -273566632, now seen corresponding path program 1 times [2022-12-06 04:31:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825753583] [2022-12-06 04:31:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:54,586 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-06 04:31:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825753583] [2022-12-06 04:31:54,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825753583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:54,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:54,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:31:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345218016] [2022-12-06 04:31:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:31:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:31:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:31:54,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:31:54,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 122 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-06 04:31:54,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:54,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:31:54,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:54,907 INFO L130 PetriNetUnfolder]: 98/205 cut-off events. [2022-12-06 04:31:54,908 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-12-06 04:31:54,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 205 events. 98/205 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 778 event pairs, 11 based on Foata normal form. 2/207 useless extension candidates. Maximal degree in co-relation 642. Up to 75 conditions per place. [2022-12-06 04:31:54,909 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 24 selfloop transitions, 5 changer transitions 31/60 dead transitions. [2022-12-06 04:31:54,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 415 flow [2022-12-06 04:31:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:31:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:31:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-12-06 04:31:54,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-06 04:31:54,910 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 122 flow. Second operand 7 states and 42 transitions. [2022-12-06 04:31:54,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 415 flow [2022-12-06 04:31:54,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 384 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 04:31:54,913 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 110 flow [2022-12-06 04:31:54,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-06 04:31:54,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-06 04:31:54,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:54,915 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 110 flow [2022-12-06 04:31:54,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:54,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:54,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 110 flow [2022-12-06 04:31:54,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 110 flow [2022-12-06 04:31:54,925 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-06 04:31:54,925 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 04:31:54,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 25 events. 5/25 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-06 04:31:54,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 110 flow [2022-12-06 04:31:54,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 04:31:54,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L760-->L778: Formula: (let ((.cse8 (= (mod v_~x$w_buff1_used~0_178 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_49 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_186 256) 0))) (let ((.cse9 (not .cse16)) (.cse7 (not .cse6)) (.cse5 (and .cse6 .cse4)) (.cse15 (and .cse8 .cse6)) (.cse14 (= 0 (mod v_~weak$$choice2~0_66 256))) (.cse13 (select |v_#memory_int_187| |v_~#x~0.base_119|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_177 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_185 256) 0)) (.cse12 (select .cse13 |v_~#x~0.offset_119|)) (.cse0 (not .cse14)) (.cse11 (or .cse5 .cse15 .cse16)) (.cse10 (and .cse9 .cse7))) (and (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_22) (= (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_48 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= v_~x$w_buff0~0_74 v_~x$w_buff0~0_73) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_66) (= v_~x$w_buff1~0_78 v_~x$w_buff1~0_77) (= v_~x$flush_delayed~0_50 0) (= (ite .cse0 v_~x$r_buff0_thd1~0_49 (ite (or .cse3 .cse5 (and .cse6 .cse2)) v_~x$r_buff0_thd1~0_49 (ite (and (not .cse3) .cse7) 0 v_~x$r_buff0_thd1~0_49))) v_~x$r_buff0_thd1~0_48) (or (and (or (not .cse8) .cse7) (or (not .cse4) .cse7) (= |v_P0Thread1of1ForFork0_#t~mem6_1| |v_P0_#t~mem6_34|) .cse9 (= (ite .cse10 v_~x$w_buff0~0_74 v_~x$w_buff1~0_78) v_~__unbuffered_p0_EAX~0_16)) (and .cse11 (= .cse12 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EAX~0_16 |v_P0_#t~mem6_34|))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#x~0.base_119| (store .cse13 |v_~#x~0.offset_119| |v_P0_#t~ite10_33|))) (or (and .cse0 (= |v_P0Thread1of1ForFork0_#t~mem9_1| |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_26)) (and (= v_~__unbuffered_p0_EAX~0_16 |v_P0_#t~mem9_32|) .cse14 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|))) (= v_~x$w_buff1_used~0_177 (ite .cse0 v_~x$w_buff1_used~0_178 (ite (or .cse3 .cse5 .cse15) v_~x$w_buff1_used~0_178 0))) (= v_~x$mem_tmp~0_26 .cse12) (= (ite .cse0 v_~x$w_buff0_used~0_186 (ite .cse11 v_~x$w_buff0_used~0_186 (ite .cse10 0 v_~x$w_buff0_used~0_186))) v_~x$w_buff0_used~0_185))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~#x~0.offset=|v_~#x~0.offset_119|, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_178, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork0_#t~mem9=|v_P0Thread1of1ForFork0_#t~mem9_1|, P0Thread1of1ForFork0_#t~mem6=|v_P0Thread1of1ForFork0_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_186, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_119|, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, P0Thread1of1ForFork0_#t~ite10=|v_P0Thread1of1ForFork0_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, ~x$flush_delayed~0=v_~x$flush_delayed~0_50, ~#x~0.offset=|v_~#x~0.offset_119|, ~x$w_buff1~0=v_~x$w_buff1~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_177, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, P0Thread1of1ForFork0_#t~mem8=|v_P0Thread1of1ForFork0_#t~mem8_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_185, P0Thread1of1ForFork0_#t~mem5=|v_P0Thread1of1ForFork0_#t~mem5_1|, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_1|, #memory_int=|v_#memory_int_186|, ~#x~0.base=|v_~#x~0.base_119|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork0_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_#t~mem8, P0Thread1of1ForFork0_#t~mem9, P0Thread1of1ForFork0_#t~mem6, ~x$w_buff0_used~0, P0Thread1of1ForFork0_#t~mem5, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~ite7, #memory_int, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0] and [589] $Ultimate##0-->L789: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= (store |v_#memory_int_233| |v_~#x~0.base_141| (store (select |v_#memory_int_233| |v_~#x~0.base_141|) |v_~#x~0.offset_141| 1)) |v_#memory_int_232|)) InVars {~#x~0.offset=|v_~#x~0.offset_141|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_141|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~#x~0.offset=|v_~#x~0.offset_141|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, #memory_int=|v_#memory_int_232|, ~#x~0.base=|v_~#x~0.base_141|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, #memory_int] [2022-12-06 04:31:55,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [680] L854-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_135 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd0~0_127 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_522 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_515 256) 0)) (.cse14 (not (= (mod v_~x$w_buff0_used~0_521 256) 0))) (.cse2 (not .cse4))) (let ((.cse0 (and .cse14 .cse2)) (.cse10 (not .cse8)) (.cse6 (select |v_#memory_int_639| |v_~#x~0.base_293|)) (.cse1 (not .cse5)) (.cse9 (not .cse7))) (and (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~y~0_93 2) (= v_~__unbuffered_p2_EAX~0_172 1))) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_134 (ite .cse0 0 v_~x$r_buff0_thd0~0_135)) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem31#1_158| |v_ULTIMATE.start_main_#t~mem31#1_160|))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite32#1_157| |v_ULTIMATE.start_main_#t~ite32#1_155|) (= |v_ULTIMATE.start_main_#t~ite33#1_131| v_~x$w_buff0~0_272) .cse2 .cse3) (and (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite33#1_131| |v_ULTIMATE.start_main_#t~ite32#1_155|) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_158| (select .cse6 |v_~#x~0.offset_293|)) (= |v_ULTIMATE.start_main_#t~mem31#1_158| |v_ULTIMATE.start_main_#t~ite32#1_155|) (or .cse7 .cse8)) (and .cse9 (= v_~x$w_buff1~0_288 |v_ULTIMATE.start_main_#t~ite32#1_155|) .cse10 .cse3))))) (= v_~x$w_buff1_used~0_514 (ite (or .cse0 (and .cse9 .cse10)) 0 v_~x$w_buff1_used~0_515)) (= v_~weak$$choice1~0_87 |v_ULTIMATE.start_main_#t~nondet34#1_125|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_90| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51| (mod v_~main$tmp_guard1~0_82 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_90| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem35#1_199| |v_ULTIMATE.start_main_#t~mem35#1_197|)) (.cse13 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_110 256) 0))) (or (and (let ((.cse12 (= 0 (mod v_~weak$$choice1~0_87 256)))) (or (and (= |v_ULTIMATE.start_main_#t~ite36#1_192| v_~__unbuffered_p2_EAX~0_173) .cse11 .cse12) (and (not .cse12) (= |v_ULTIMATE.start_main_#t~mem35#1_197| (select (select |v_#memory_int_638| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_111) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_111)) (= |v_ULTIMATE.start_main_#t~mem35#1_197| |v_ULTIMATE.start_main_#t~ite36#1_192|)))) (= |v_ULTIMATE.start_main_#t~ite36#1_192| v_~__unbuffered_p2_EAX~0_172) (not .cse13)) (and .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_192| |v_ULTIMATE.start_main_#t~ite36#1_194|) (= v_~__unbuffered_p2_EAX~0_173 v_~__unbuffered_p2_EAX~0_172) .cse13))) (= (store |v_#memory_int_639| |v_~#x~0.base_293| (store .cse6 |v_~#x~0.offset_293| |v_ULTIMATE.start_main_#t~ite33#1_131|)) |v_#memory_int_638|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_522) v_~x$w_buff0_used~0_521) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff1_thd0~0_126 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_134 256) 0)) .cse14) (and .cse9 (not (= (mod v_~x$w_buff1_used~0_514 256) 0)))) 0 v_~x$r_buff1_thd0~0_127)) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_194|, ~#x~0.offset=|v_~#x~0.offset_293|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_111, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_111, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_125|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_515, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_127, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_522, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_160|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_157|, #memory_int=|v_#memory_int_639|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_199|, ~#x~0.base=|v_~#x~0.base_293|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_173, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~y~0=v_~y~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_272, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_111, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_111, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_86|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~weak$$choice1~0=v_~weak$$choice1~0_87, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_67|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_90|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~y~0=v_~y~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_87|, ~#x~0.offset=|v_~#x~0.offset_293|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_514, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_126, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_521, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_130|, #memory_int=|v_#memory_int_638|, ~#x~0.base=|v_~#x~0.base_293|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_155|, |v_ULTIMATE.start_main_#t~ite36#1_192|, |v_ULTIMATE.start_main_#t~mem35#1_197|, |v_ULTIMATE.start_main_#t~ite33#1_131|, |v_ULTIMATE.start_main_#t~mem31#1_158|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [600] $Ultimate##0-->L822: Formula: (let ((.cse14 (= 0 (mod v_~x$w_buff1_used~0_220 256))) (.cse7 (= 0 (mod v_~x$r_buff1_thd3~0_87 256))) (.cse16 (= (mod v_~x$w_buff0_used~0_224 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_90 256) 0))) (let ((.cse13 (not .cse12)) (.cse15 (not .cse16)) (.cse9 (select |v_#memory_int_247| |v_~#x~0.base_149|)) (.cse10 (and .cse7 .cse12)) (.cse11 (and .cse14 .cse12)) (.cse1 (= 0 (mod v_~weak$$choice2~0_78 256)))) (let ((.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff1_used~0_219 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_223 256) 0)) (.cse2 (or .cse10 .cse11 .cse16)) (.cse4 (select .cse9 |v_~#x~0.offset_149|)) (.cse3 (and .cse13 .cse15))) (and (or (and (= |v_P2_#t~ite21_30| v_~x$mem_tmp~0_36) .cse0 (= |v_P2_#t~mem20_29| |v_P2Thread1of1ForFork2_#t~mem20_6|)) (and (= |v_P2_#t~mem20_29| v_~__unbuffered_p2_EAX~0_51) (= |v_P2_#t~ite21_30| |v_P2_#t~mem20_29|) .cse1)) (= |v_~#x~0.offset_149| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_34) (= v_~__unbuffered_p2_EAX$read_delayed~0_31 1) (= v_~x$flush_delayed~0_64 0) (= (ite .cse0 v_~x$w_buff0_used~0_224 (ite .cse2 v_~x$w_buff0_used~0_224 (ite .cse3 0 v_~x$w_buff0_used~0_224))) v_~x$w_buff0_used~0_223) (= v_~x$mem_tmp~0_36 .cse4) (= v_~x$w_buff1~0_114 v_~x$w_buff1~0_113) (= v_~x$r_buff1_thd3~0_86 (ite .cse0 v_~x$r_buff1_thd3~0_87 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd3~0_89 256) 0))) (or .cse5 (and .cse6 .cse7) (and .cse6 .cse8))) v_~x$r_buff1_thd3~0_87 0))) (= (store |v_#memory_int_247| |v_~#x~0.base_149| (store .cse9 |v_~#x~0.offset_149| |v_P2_#t~ite21_30|)) |v_#memory_int_246|) (= v_~weak$$choice2~0_78 |v_P2Thread1of1ForFork2_#t~nondet15_6|) (= |v_~#x~0.base_149| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_34) (= (ite .cse0 v_~x$w_buff1_used~0_220 (ite (or .cse10 .cse5 .cse11) v_~x$w_buff1_used~0_220 0)) v_~x$w_buff1_used~0_219) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= (ite .cse0 v_~x$r_buff0_thd3~0_90 (ite (or .cse10 .cse5 (and .cse8 .cse12)) v_~x$r_buff0_thd3~0_90 (ite (and .cse13 (not .cse5)) 0 v_~x$r_buff0_thd3~0_90))) v_~x$r_buff0_thd3~0_89) (or (and (= |v_P2_#t~mem17_51| v_~__unbuffered_p2_EAX~0_51) .cse2 (= |v_P2_#t~mem17_51| .cse4)) (and (= (ite .cse3 v_~x$w_buff0~0_100 v_~x$w_buff1~0_114) v_~__unbuffered_p2_EAX~0_51) (= |v_P2_#t~mem17_51| |v_P2Thread1of1ForFork2_#t~mem17_6|) (or .cse13 (not .cse7)) (or .cse13 (not .cse14)) .cse15)) (= v_~x$w_buff0~0_100 v_~x$w_buff0~0_99) (= v_~weak$$choice0~0_30 |v_P2Thread1of1ForFork2_#t~nondet14_6|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_100, P2Thread1of1ForFork2_#t~mem17=|v_P2Thread1of1ForFork2_#t~mem17_6|, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_149|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_220, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_90, P2Thread1of1ForFork2_#t~nondet15=|v_P2Thread1of1ForFork2_#t~nondet15_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, P2Thread1of1ForFork2_#t~nondet14=|v_P2Thread1of1ForFork2_#t~nondet14_6|, #memory_int=|v_#memory_int_247|, ~#x~0.base=|v_~#x~0.base_149|, P2Thread1of1ForFork2_#t~mem20=|v_P2Thread1of1ForFork2_#t~mem20_6|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_99, P2Thread1of1ForFork2_#t~mem19=|v_P2Thread1of1ForFork2_#t~mem19_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_64, P2Thread1of1ForFork2_#t~mem16=|v_P2Thread1of1ForFork2_#t~mem16_5|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_34, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_89, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_#t~ite21=|v_P2Thread1of1ForFork2_#t~ite21_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_51, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_149|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~x$w_buff1~0=v_~x$w_buff1~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_219, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_30, #memory_int=|v_#memory_int_246|, ~#x~0.base=|v_~#x~0.base_149|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~weak$$choice2~0=v_~weak$$choice2~0_78, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_5|} AuxVars[|v_P2_#t~mem20_29|, |v_P2_#t~ite21_30|, |v_P2_#t~mem17_51|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork2_#t~mem17, P2Thread1of1ForFork2_#t~mem19, ~x$flush_delayed~0, P2Thread1of1ForFork2_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_#t~ite21, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork2_~arg.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, P2Thread1of1ForFork2_#t~nondet15, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~nondet14, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork2_#t~mem20, ~weak$$choice2~0, P2Thread1of1ForFork2_#t~ite18] [2022-12-06 04:32:03,407 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:32:03,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8494 [2022-12-06 04:32:03,408 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 137 flow [2022-12-06 04:32:03,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-06 04:32:03,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:03,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:03,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:32:03,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:32:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 802530425, now seen corresponding path program 1 times [2022-12-06 04:32:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:03,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778177102] [2022-12-06 04:32:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:03,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:32:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:32:03,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:32:03,567 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:32:03,568 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:32:03,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:32:03,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:32:03,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:32:03,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:32:03,570 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:03,573 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:32:03,573 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:32:03,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:32:03 BasicIcfg [2022-12-06 04:32:03,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:32:03,669 INFO L158 Benchmark]: Toolchain (without parser) took 25668.82ms. Allocated memory was 201.3MB in the beginning and 577.8MB in the end (delta: 376.4MB). Free memory was 163.3MB in the beginning and 469.8MB in the end (delta: -306.5MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2022-12-06 04:32:03,669 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:32:03,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.49ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 136.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:32:03,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.93ms. Allocated memory is still 201.3MB. Free memory was 136.0MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:03,670 INFO L158 Benchmark]: Boogie Preprocessor took 57.64ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:03,670 INFO L158 Benchmark]: RCFGBuilder took 897.89ms. Allocated memory is still 201.3MB. Free memory was 131.3MB in the beginning and 68.9MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-12-06 04:32:03,670 INFO L158 Benchmark]: TraceAbstraction took 24080.52ms. Allocated memory was 201.3MB in the beginning and 577.8MB in the end (delta: 376.4MB). Free memory was 67.9MB in the beginning and 469.8MB in the end (delta: -401.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:32:03,672 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.14ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 543.49ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 136.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.93ms. Allocated memory is still 201.3MB. Free memory was 136.0MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.64ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 897.89ms. Allocated memory is still 201.3MB. Free memory was 131.3MB in the beginning and 68.9MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * TraceAbstraction took 24080.52ms. Allocated memory was 201.3MB in the beginning and 577.8MB in the end (delta: 376.4MB). Free memory was 67.9MB in the beginning and 469.8MB in the end (delta: -401.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 117 PlacesBefore, 29 PlacesAfterwards, 108 TransitionsBefore, 20 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 793, independent: 728, independent conditional: 728, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 793, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 793, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 793, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 669, independent: 632, independent conditional: 0, independent unconditional: 632, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 669, independent: 612, independent conditional: 0, independent unconditional: 612, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 793, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 932, Positive cache size: 895, Positive conditional cache size: 0, Positive unconditional cache size: 895, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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.1s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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.1s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 1, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 7, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 34, independent conditional: 16, independent unconditional: 18, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 44, Positive conditional cache size: 2, Positive unconditional cache size: 42, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 7, 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: 18, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 44, Positive conditional cache size: 2, Positive unconditional cache size: 42, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 8, independent unconditional: 6, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 46, Positive conditional cache size: 2, Positive unconditional cache size: 44, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 43 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 32, independent conditional: 24, independent unconditional: 8, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 32, independent conditional: 14, independent unconditional: 18, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 32, independent conditional: 14, independent unconditional: 18, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 30, independent conditional: 13, independent unconditional: 17, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 51, Positive conditional cache size: 3, Positive unconditional cache size: 48, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 38 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 61, independent: 21, independent conditional: 18, independent unconditional: 3, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 64, Positive conditional cache size: 9, Positive unconditional cache size: 55, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 39 PlacesBefore, 38 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 71, Positive conditional cache size: 15, Positive unconditional cache size: 56, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-2, t2269={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=-1, t2269={6:0}, t2270={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=0, t2269={6:0}, t2270={7:0}, t2271={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 [L824] 3 y = 1 [L759] 3 y = 2 [L764] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 3 x$flush_delayed = weak$$choice2 [L767] EXPR 3 \read(x) [L767] 3 x$mem_tmp = x [L768] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 3 \read(x) [L768] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 3 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 3 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 3 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 3 \read(x) [L775] 3 __unbuffered_p0_EAX = x [L776] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 3 \read(x) [L776] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L776] 3 x = x$flush_delayed ? x$mem_tmp : x [L777] 3 x$flush_delayed = (_Bool)0 [L789] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 4 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: 23.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 2 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=6, InterpolantAutomatonStates: 40, 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, 4.3s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:32:03,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...