/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:00:30,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:00:30,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:00:30,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:00:30,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:00:30,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:00:30,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:00:30,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:00:30,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:00:30,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:00:30,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:00:30,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:00:30,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:00:30,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:00:30,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:00:30,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:00:30,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:00:30,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:00:30,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:00:30,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:00:30,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:00:30,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:00:30,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:00:30,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:00:30,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:00:30,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:00:30,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:00:30,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:00:30,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:00:30,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:00:30,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:00:30,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:00:30,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:00:30,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:00:30,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:00:30,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:00:30,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:00:30,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:00:30,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:00:30,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:00:30,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:00:30,342 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:00:30,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:00:30,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:00:30,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:00:30,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:00:30,365 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:00:30,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:00:30,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:00:30,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:00:30,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:00:30,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:00:30,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:00:30,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:00:30,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:00:30,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:00:30,369 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:00:30,369 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-13 12:00:30,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:00:30,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:00:30,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:00:30,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:00:30,679 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:00:30,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2022-12-13 12:00:31,673 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:00:31,931 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:00:31,931 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2022-12-13 12:00:31,947 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca2fb46/8f3036cbd79e49f6ae5da56d15be0f6a/FLAG8cbdaba4a [2022-12-13 12:00:31,958 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca2fb46/8f3036cbd79e49f6ae5da56d15be0f6a [2022-12-13 12:00:31,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:00:31,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:00:31,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:00:31,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:00:31,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:00:31,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:00:31" (1/1) ... [2022-12-13 12:00:31,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8ab453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:31, skipping insertion in model container [2022-12-13 12:00:31,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:00:31" (1/1) ... [2022-12-13 12:00:31,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:00:32,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:00:32,118 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/safe009_rmo.opt.i[949,962] [2022-12-13 12:00:32,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:00:32,308 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:00:32,321 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/safe009_rmo.opt.i[949,962] [2022-12-13 12:00:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:00:32,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:00:32,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:00:32,408 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:00:32,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32 WrapperNode [2022-12-13 12:00:32,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:00:32,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:00:32,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:00:32,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:00:32,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,471 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-12-13 12:00:32,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:00:32,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:00:32,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:00:32,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:00:32,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:00:32,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:00:32,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:00:32,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:00:32,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (1/1) ... [2022-12-13 12:00:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:00:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:00:32,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:00:32,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:00:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:00:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:00:32,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:00:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:00:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:00:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:00:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:00:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:00:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:00:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:00:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:00:32,623 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:00:32,800 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:00:32,801 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:00:33,133 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:00:33,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:00:33,302 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:00:33,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:00:33 BoogieIcfgContainer [2022-12-13 12:00:33,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:00:33,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:00:33,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:00:33,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:00:33,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:00:31" (1/3) ... [2022-12-13 12:00:33,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6254e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:00:33, skipping insertion in model container [2022-12-13 12:00:33,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:00:32" (2/3) ... [2022-12-13 12:00:33,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6254e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:00:33, skipping insertion in model container [2022-12-13 12:00:33,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:00:33" (3/3) ... [2022-12-13 12:00:33,312 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2022-12-13 12:00:33,324 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:00:33,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:00:33,324 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:00:33,385 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:00:33,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 12:00:33,483 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 12:00:33,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 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/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 12:00:33,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 12:00:33,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-13 12:00:33,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:33,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 12:00:33,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-13 12:00:33,557 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-13 12:00:33,557 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 12:00:33,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 12:00:33,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 1240 [2022-12-13 12:00:39,157 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 12:00:39,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:00:39,196 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;@19e98fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:00:39,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:00:39,201 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:00:39,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:39,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:39,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:39,202 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-13 12:00:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1398938745, now seen corresponding path program 1 times [2022-12-13 12:00:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:39,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930426823] [2022-12-13 12:00:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930426823] [2022-12-13 12:00:39,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930426823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:39,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:39,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:39,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190999562] [2022-12-13 12:00:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:00:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:00:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:00:39,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 12:00:39,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:39,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:39,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 12:00:39,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:39,799 INFO L130 PetriNetUnfolder]: 1164/1827 cut-off events. [2022-12-13 12:00:39,799 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 12:00:39,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 1827 events. 1164/1827 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9000 event pairs, 1164 based on Foata normal form. 0/1499 useless extension candidates. Maximal degree in co-relation 3608. Up to 1726 conditions per place. [2022-12-13 12:00:39,814 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 12:00:39,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 109 flow [2022-12-13 12:00:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:00:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:00:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-12-13 12:00:39,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 12:00:39,823 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 38 transitions. [2022-12-13 12:00:39,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 109 flow [2022-12-13 12:00:39,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:00:39,828 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 12:00:39,829 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 12:00:39,832 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 12:00:39,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:39,832 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 12:00:39,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:39,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:39,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 12:00:39,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 12:00:39,840 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 12:00:39,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:39,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:00:39,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 12:00:39,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 12:00:39,948 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:39,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 12:00:39,950 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 12:00:39,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:39,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:39,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:39,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:00:39,953 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-13 12:00:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 55354444, now seen corresponding path program 1 times [2022-12-13 12:00:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:39,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519205197] [2022-12-13 12:00:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:40,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519205197] [2022-12-13 12:00:40,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519205197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:40,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:40,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168216705] [2022-12-13 12:00:40,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:40,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 12:00:40,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:40,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:40,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 12:00:40,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:40,599 INFO L130 PetriNetUnfolder]: 1099/1797 cut-off events. [2022-12-13 12:00:40,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:40,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1797 events. 1099/1797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9461 event pairs, 392 based on Foata normal form. 25/1509 useless extension candidates. Maximal degree in co-relation 3488. Up to 1444 conditions per place. [2022-12-13 12:00:40,606 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 12:00:40,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2022-12-13 12:00:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 12:00:40,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 12:00:40,608 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 60 transitions. [2022-12-13 12:00:40,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2022-12-13 12:00:40,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:00:40,609 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 12:00:40,610 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 12:00:40,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:40,610 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:40,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:40,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,614 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 12:00:40,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:40,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:00:40,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 12:00:40,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:40,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 12:00:40,617 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2022-12-13 12:00:40,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:40,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:40,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:40,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:00:40,617 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-13 12:00:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1715986543, now seen corresponding path program 1 times [2022-12-13 12:00:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:40,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677827529] [2022-12-13 12:00:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677827529] [2022-12-13 12:00:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677827529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:40,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:40,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:00:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978537320] [2022-12-13 12:00:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:40,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:00:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:00:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:00:40,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 12:00:40,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:40,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:40,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 12:00:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:41,090 INFO L130 PetriNetUnfolder]: 2044/3360 cut-off events. [2022-12-13 12:00:41,091 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-13 12:00:41,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 3360 events. 2044/3360 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19626 event pairs, 328 based on Foata normal form. 120/2896 useless extension candidates. Maximal degree in co-relation 6823. Up to 1565 conditions per place. [2022-12-13 12:00:41,104 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 38 selfloop transitions, 4 changer transitions 7/56 dead transitions. [2022-12-13 12:00:41,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 231 flow [2022-12-13 12:00:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 12:00:41,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6810344827586207 [2022-12-13 12:00:41,105 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 4 states and 79 transitions. [2022-12-13 12:00:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 231 flow [2022-12-13 12:00:41,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:41,107 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-13 12:00:41,107 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-13 12:00:41,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:41,107 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:41,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:41,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,113 INFO L130 PetriNetUnfolder]: 3/49 cut-off events. [2022-12-13 12:00:41,113 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-13 12:00:41,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 49 events. 3/49 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 164 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2022-12-13 12:00:41,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 12:00:41,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:41,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 12:00:41,143 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 94 flow [2022-12-13 12:00:41,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:41,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:41,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:00:41,144 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-13 12:00:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1656014422, now seen corresponding path program 1 times [2022-12-13 12:00:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:41,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359640249] [2022-12-13 12:00:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:41,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359640249] [2022-12-13 12:00:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359640249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:41,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313018464] [2022-12-13 12:00:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:41,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 12:00:41,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:41,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:41,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 12:00:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:41,500 INFO L130 PetriNetUnfolder]: 1120/1787 cut-off events. [2022-12-13 12:00:41,500 INFO L131 PetriNetUnfolder]: For 783/783 co-relation queries the response was YES. [2022-12-13 12:00:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4186 conditions, 1787 events. 1120/1787 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8880 event pairs, 704 based on Foata normal form. 16/1467 useless extension candidates. Maximal degree in co-relation 4173. Up to 1513 conditions per place. [2022-12-13 12:00:41,513 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 32 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 12:00:41,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 196 flow [2022-12-13 12:00:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 12:00:41,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:00:41,515 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 94 flow. Second operand 3 states and 58 transitions. [2022-12-13 12:00:41,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 196 flow [2022-12-13 12:00:41,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:41,517 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 12:00:41,517 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-13 12:00:41,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:41,518 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:41,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:41,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,523 INFO L130 PetriNetUnfolder]: 3/49 cut-off events. [2022-12-13 12:00:41,523 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-13 12:00:41,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 49 events. 3/49 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 168 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 72. Up to 10 conditions per place. [2022-12-13 12:00:41,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 12:00:41,611 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:41,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 12:00:41,612 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 95 flow [2022-12-13 12:00:41,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:41,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:41,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:41,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:00:41,613 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-13 12:00:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -204093861, now seen corresponding path program 1 times [2022-12-13 12:00:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:41,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022445584] [2022-12-13 12:00:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022445584] [2022-12-13 12:00:41,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022445584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:41,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:41,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:00:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444565282] [2022-12-13 12:00:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:41,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:00:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:00:41,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:00:41,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 12:00:41,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:41,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:41,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 12:00:41,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:42,198 INFO L130 PetriNetUnfolder]: 2420/4020 cut-off events. [2022-12-13 12:00:42,199 INFO L131 PetriNetUnfolder]: For 1875/1875 co-relation queries the response was YES. [2022-12-13 12:00:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8405 conditions, 4020 events. 2420/4020 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 25537 event pairs, 640 based on Foata normal form. 208/3401 useless extension candidates. Maximal degree in co-relation 8391. Up to 1322 conditions per place. [2022-12-13 12:00:42,211 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 34 selfloop transitions, 3 changer transitions 26/70 dead transitions. [2022-12-13 12:00:42,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 307 flow [2022-12-13 12:00:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 12:00:42,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 12:00:42,215 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 95 flow. Second operand 5 states and 100 transitions. [2022-12-13 12:00:42,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 307 flow [2022-12-13 12:00:42,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:42,220 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 108 flow [2022-12-13 12:00:42,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-12-13 12:00:42,222 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 12:00:42,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:42,222 INFO L89 Accepts]: Start accepts. Operand has 48 places, 31 transitions, 108 flow [2022-12-13 12:00:42,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:42,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:42,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 31 transitions, 108 flow [2022-12-13 12:00:42,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 31 transitions, 108 flow [2022-12-13 12:00:42,230 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-13 12:00:42,230 INFO L131 PetriNetUnfolder]: For 47/50 co-relation queries the response was YES. [2022-12-13 12:00:42,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 56 events. 0/56 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 218 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 12:00:42,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 31 transitions, 108 flow [2022-12-13 12:00:42,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 12:00:42,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:42,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 12:00:42,272 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 108 flow [2022-12-13 12:00:42,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:42,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:42,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:00:42,273 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-13 12:00:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1087358275, now seen corresponding path program 1 times [2022-12-13 12:00:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:42,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341187022] [2022-12-13 12:00:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:43,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341187022] [2022-12-13 12:00:43,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341187022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:43,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:43,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:00:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366509058] [2022-12-13 12:00:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:43,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:00:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:00:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:00:43,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 12:00:43,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:43,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:43,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 12:00:43,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:43,346 INFO L130 PetriNetUnfolder]: 1609/2653 cut-off events. [2022-12-13 12:00:43,346 INFO L131 PetriNetUnfolder]: For 2430/2448 co-relation queries the response was YES. [2022-12-13 12:00:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 2653 events. 1609/2653 cut-off events. For 2430/2448 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14948 event pairs, 814 based on Foata normal form. 2/2125 useless extension candidates. Maximal degree in co-relation 6023. Up to 2388 conditions per place. [2022-12-13 12:00:43,355 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 34 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-13 12:00:43,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 247 flow [2022-12-13 12:00:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 12:00:43,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5948275862068966 [2022-12-13 12:00:43,356 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 108 flow. Second operand 4 states and 69 transitions. [2022-12-13 12:00:43,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 247 flow [2022-12-13 12:00:43,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:00:43,358 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 144 flow [2022-12-13 12:00:43,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 12:00:43,358 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 12:00:43,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:43,359 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 144 flow [2022-12-13 12:00:43,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:43,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:43,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 144 flow [2022-12-13 12:00:43,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 144 flow [2022-12-13 12:00:43,370 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-13 12:00:43,370 INFO L131 PetriNetUnfolder]: For 52/55 co-relation queries the response was YES. [2022-12-13 12:00:43,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 139 events. 12/139 cut-off events. For 52/55 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 832 event pairs, 2 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 233. Up to 25 conditions per place. [2022-12-13 12:00:43,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 144 flow [2022-12-13 12:00:43,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-13 12:00:43,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:00:43,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 12:00:43,453 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 148 flow [2022-12-13 12:00:43,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:43,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:43,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:00:43,454 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-13 12:00:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1836802057, now seen corresponding path program 1 times [2022-12-13 12:00:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488191887] [2022-12-13 12:00:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:44,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488191887] [2022-12-13 12:00:44,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488191887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:44,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:44,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:00:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938323228] [2022-12-13 12:00:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:44,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:00:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:00:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:00:44,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:00:44,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:44,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:44,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:00:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:45,238 INFO L130 PetriNetUnfolder]: 1552/2536 cut-off events. [2022-12-13 12:00:45,238 INFO L131 PetriNetUnfolder]: For 2102/2117 co-relation queries the response was YES. [2022-12-13 12:00:45,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6266 conditions, 2536 events. 1552/2536 cut-off events. For 2102/2117 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13712 event pairs, 727 based on Foata normal form. 18/2039 useless extension candidates. Maximal degree in co-relation 6249. Up to 1749 conditions per place. [2022-12-13 12:00:45,251 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 12:00:45,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 296 flow [2022-12-13 12:00:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 12:00:45,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 12:00:45,252 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 148 flow. Second operand 4 states and 71 transitions. [2022-12-13 12:00:45,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 296 flow [2022-12-13 12:00:45,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:00:45,254 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 184 flow [2022-12-13 12:00:45,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-13 12:00:45,255 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-13 12:00:45,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:45,255 INFO L89 Accepts]: Start accepts. Operand has 53 places, 39 transitions, 184 flow [2022-12-13 12:00:45,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:45,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:45,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 184 flow [2022-12-13 12:00:45,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 39 transitions, 184 flow [2022-12-13 12:00:45,271 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-13 12:00:45,271 INFO L131 PetriNetUnfolder]: For 103/106 co-relation queries the response was YES. [2022-12-13 12:00:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 129 events. 11/129 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 720 event pairs, 1 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 255. Up to 23 conditions per place. [2022-12-13 12:00:45,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 184 flow [2022-12-13 12:00:45,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 12:00:45,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:00:45,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 12:00:45,470 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 188 flow [2022-12-13 12:00:45,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:45,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:45,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:00:45,471 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-13 12:00:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash -197730708, now seen corresponding path program 1 times [2022-12-13 12:00:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:45,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483045091] [2022-12-13 12:00:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483045091] [2022-12-13 12:00:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483045091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:45,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:00:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261677638] [2022-12-13 12:00:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:45,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 12:00:45,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:45,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:45,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 12:00:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:45,964 INFO L130 PetriNetUnfolder]: 2271/3602 cut-off events. [2022-12-13 12:00:45,964 INFO L131 PetriNetUnfolder]: For 4058/4080 co-relation queries the response was YES. [2022-12-13 12:00:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9187 conditions, 3602 events. 2271/3602 cut-off events. For 4058/4080 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 20400 event pairs, 753 based on Foata normal form. 39/2387 useless extension candidates. Maximal degree in co-relation 9166. Up to 3478 conditions per place. [2022-12-13 12:00:45,979 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 41 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2022-12-13 12:00:45,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 361 flow [2022-12-13 12:00:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 12:00:45,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 12:00:45,980 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 188 flow. Second operand 3 states and 60 transitions. [2022-12-13 12:00:45,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 361 flow [2022-12-13 12:00:45,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 351 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:00:45,983 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:45,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 12:00:45,984 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-13 12:00:45,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:45,984 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:45,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:45,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:45,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:45,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:46,070 INFO L130 PetriNetUnfolder]: 666/1441 cut-off events. [2022-12-13 12:00:46,070 INFO L131 PetriNetUnfolder]: For 1101/1162 co-relation queries the response was YES. [2022-12-13 12:00:46,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 1441 events. 666/1441 cut-off events. For 1101/1162 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 11197 event pairs, 289 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 3172. Up to 1147 conditions per place. [2022-12-13 12:00:46,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:46,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 12:00:46,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:46,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 12:00:46,154 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 249 flow [2022-12-13 12:00:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:46,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:46,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:00:46,155 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-13 12:00:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -213028770, now seen corresponding path program 1 times [2022-12-13 12:00:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:46,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981794755] [2022-12-13 12:00:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981794755] [2022-12-13 12:00:46,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981794755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:46,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:46,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:00:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825947553] [2022-12-13 12:00:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:46,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:00:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:00:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:00:46,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 12:00:46,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:46,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:46,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 12:00:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:46,549 INFO L130 PetriNetUnfolder]: 1122/2081 cut-off events. [2022-12-13 12:00:46,550 INFO L131 PetriNetUnfolder]: For 2341/2351 co-relation queries the response was YES. [2022-12-13 12:00:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 2081 events. 1122/2081 cut-off events. For 2341/2351 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13118 event pairs, 153 based on Foata normal form. 132/1517 useless extension candidates. Maximal degree in co-relation 6695. Up to 1684 conditions per place. [2022-12-13 12:00:46,557 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 46 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2022-12-13 12:00:46,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 486 flow [2022-12-13 12:00:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 12:00:46,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6370967741935484 [2022-12-13 12:00:46,558 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 249 flow. Second operand 4 states and 79 transitions. [2022-12-13 12:00:46,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 486 flow [2022-12-13 12:00:46,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:00:46,563 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-13 12:00:46,564 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 12:00:46,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:46,564 INFO L89 Accepts]: Start accepts. Operand has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:46,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:46,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,634 INFO L130 PetriNetUnfolder]: 390/1060 cut-off events. [2022-12-13 12:00:46,634 INFO L131 PetriNetUnfolder]: For 1233/1360 co-relation queries the response was YES. [2022-12-13 12:00:46,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 1060 events. 390/1060 cut-off events. For 1233/1360 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 8782 event pairs, 55 based on Foata normal form. 10/649 useless extension candidates. Maximal degree in co-relation 3316. Up to 754 conditions per place. [2022-12-13 12:00:46,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 12:00:46,669 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:46,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 12:00:46,669 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 351 flow [2022-12-13 12:00:46,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:46,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:46,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:00:46,670 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-13 12:00:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1593711419, now seen corresponding path program 1 times [2022-12-13 12:00:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:46,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048362276] [2022-12-13 12:00:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:46,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048362276] [2022-12-13 12:00:46,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048362276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:46,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:46,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:00:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682809083] [2022-12-13 12:00:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:46,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:00:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:00:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:00:46,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 12:00:46,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:46,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:46,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 12:00:46,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:47,005 INFO L130 PetriNetUnfolder]: 519/1064 cut-off events. [2022-12-13 12:00:47,006 INFO L131 PetriNetUnfolder]: For 1017/1018 co-relation queries the response was YES. [2022-12-13 12:00:47,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 1064 events. 519/1064 cut-off events. For 1017/1018 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6227 event pairs, 18 based on Foata normal form. 153/809 useless extension candidates. Maximal degree in co-relation 4274. Up to 649 conditions per place. [2022-12-13 12:00:47,010 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 27 selfloop transitions, 28 changer transitions 12/72 dead transitions. [2022-12-13 12:00:47,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 552 flow [2022-12-13 12:00:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 12:00:47,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2022-12-13 12:00:47,011 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 351 flow. Second operand 5 states and 84 transitions. [2022-12-13 12:00:47,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 552 flow [2022-12-13 12:00:47,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 485 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 12:00:47,014 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 319 flow [2022-12-13 12:00:47,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2022-12-13 12:00:47,015 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 12:00:47,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:47,015 INFO L89 Accepts]: Start accepts. Operand has 58 places, 49 transitions, 319 flow [2022-12-13 12:00:47,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:47,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:47,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 319 flow [2022-12-13 12:00:47,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 319 flow [2022-12-13 12:00:47,034 INFO L130 PetriNetUnfolder]: 103/299 cut-off events. [2022-12-13 12:00:47,035 INFO L131 PetriNetUnfolder]: For 135/159 co-relation queries the response was YES. [2022-12-13 12:00:47,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 299 events. 103/299 cut-off events. For 135/159 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1637 event pairs, 1 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 999. Up to 199 conditions per place. [2022-12-13 12:00:47,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 319 flow [2022-12-13 12:00:47,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 12:00:50,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L797: Formula: (let ((.cse10 (= (mod v_~x$w_buff1_used~0_546 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd2~0_256 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd2~0_261 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_569 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_101 256) 0)) (.cse9 (not .cse16)) (.cse8 (not .cse13)) (.cse12 (and .cse13 .cse3)) (.cse14 (and .cse10 .cse13)) (.cse11 (select |v_#memory_int_710| |v_~#x~0.base_311|))) (let ((.cse0 (select .cse11 |v_~#x~0.offset_311|)) (.cse4 (= (mod v_~x$w_buff1_used~0_545 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_568 256) 0)) (.cse6 (or .cse16 .cse12 .cse14)) (.cse7 (and .cse9 .cse8)) (.cse1 (not .cse15))) (and (= .cse0 v_~x$mem_tmp~0_75) (= (ite .cse1 v_~x$r_buff1_thd2~0_256 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_260 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd2~0_256 0)) v_~x$r_buff1_thd2~0_255) (or (and (= v_~__unbuffered_p1_EAX~0_181 |v_P1_#t~mem9_83|) .cse6 (= .cse0 |v_P1_#t~mem9_83|)) (and (= (ite .cse7 v_~x$w_buff0~0_277 v_~x$w_buff1~0_289) v_~__unbuffered_p1_EAX~0_181) (or (not .cse3) .cse8) .cse9 (or .cse8 (not .cse10)) (= |v_P1Thread1of1ForFork1_#t~mem9_96| |v_P1_#t~mem9_83|))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_132 |v_~#x~0.offset_311|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_44| v_P1Thread1of1ForFork1_~arg.offset_44) (= v_P1Thread1of1ForFork1_~arg.base_44 |v_P1Thread1of1ForFork1_#in~arg.base_44|) (= v_~y~0_97 1) (= (store |v_#memory_int_710| |v_~#x~0.base_311| (store .cse11 |v_~#x~0.offset_311| |v_P1_#t~ite13_88|)) |v_#memory_int_709|) (= v_~x$w_buff1~0_289 v_~x$w_buff1~0_288) (= (ite .cse1 v_~x$r_buff0_thd2~0_261 (ite (or .cse12 (and .cse13 .cse4) .cse5) v_~x$r_buff0_thd2~0_261 (ite (and .cse8 (not .cse5)) 0 v_~x$r_buff0_thd2~0_261))) v_~x$r_buff0_thd2~0_260) (= (ite .cse1 v_~x$w_buff1_used~0_546 (ite (or .cse12 .cse14 .cse5) v_~x$w_buff1_used~0_546 0)) v_~x$w_buff1_used~0_545) (= v_~weak$$choice2~0_101 |v_P1Thread1of1ForFork1_#t~nondet7_96|) (= v_~__unbuffered_p1_EAX$read_delayed~0_123 1) (= v_~x$w_buff0~0_277 v_~x$w_buff0~0_276) (= v_~x$w_buff0_used~0_568 (ite .cse1 v_~x$w_buff0_used~0_569 (ite .cse6 v_~x$w_buff0_used~0_569 (ite .cse7 0 v_~x$w_buff0_used~0_569)))) (= v_~x$flush_delayed~0_89 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_132 |v_~#x~0.base_311|) (or (and (= v_~__unbuffered_p1_EAX~0_181 |v_P1_#t~mem12_91|) .cse15 (= |v_P1_#t~ite13_88| |v_P1_#t~mem12_91|)) (and .cse1 (= |v_P1Thread1of1ForFork1_#t~mem12_96| |v_P1_#t~mem12_91|) (= |v_P1_#t~ite13_88| v_~x$mem_tmp~0_75))) (= v_~weak$$choice0~0_68 |v_P1Thread1of1ForFork1_#t~nondet6_96|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_277, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_96|, ~#x~0.offset=|v_~#x~0.offset_311|, ~x$w_buff1~0=v_~x$w_buff1~0_289, P1Thread1of1ForFork1_#t~mem12=|v_P1Thread1of1ForFork1_#t~mem12_96|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_546, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_96|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_569, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_44|, #memory_int=|v_#memory_int_710|, ~#x~0.base=|v_~#x~0.base_311|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_44|, P1Thread1of1ForFork1_#t~mem9=|v_P1Thread1of1ForFork1_#t~mem9_96|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_276, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_123, ~x$mem_tmp~0=v_~x$mem_tmp~0_75, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_181, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_44|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_132, ~y~0=v_~y~0_97, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_50|, ~#x~0.offset=|v_~#x~0.offset_311|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_44, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_50|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_132, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_545, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_50|, P1Thread1of1ForFork1_#t~ite13=|v_P1Thread1of1ForFork1_#t~ite13_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_260, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_568, ~weak$$choice0~0=v_~weak$$choice0~0_68, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_44, #memory_int=|v_#memory_int_709|, ~#x~0.base=|v_~#x~0.base_311|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_101} AuxVars[|v_P1_#t~ite13_88|, |v_P1_#t~mem12_91|, |v_P1_#t~mem9_83|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~y~0, P1Thread1of1ForFork1_#t~mem8, P1Thread1of1ForFork1_#t~mem9, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P1Thread1of1ForFork1_#t~mem12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite10, P1Thread1of1ForFork1_#t~ite13, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0] and [657] $Ultimate##0-->L821: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_130 256) 0))) (let ((.cse3 (not .cse8)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_589 256) 0))) (.cse10 (= (mod v_~x$r_buff1_thd3~0_124 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_566 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_590 256) 0))) (let ((.cse4 (not .cse7)) (.cse0 (not .cse9)) (.cse1 (not .cse10)) (.cse2 (and .cse3 .cse5)) (.cse11 (select |v_#memory_int_741| |v_~#x~0.base_325|))) (and (= v_~y~0_105 2) (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= v_~x$w_buff1_used~0_565 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_566)) (= (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_590) v_~x$w_buff0_used~0_589) (= (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_565 256))) .cse1) (and (not (= (mod v_~x$r_buff0_thd3~0_129 256) 0)) .cse5)) 0 v_~x$r_buff1_thd3~0_124) v_~x$r_buff1_thd3~0_123) (let ((.cse6 (= |v_P2Thread1of1ForFork2_#t~mem17_74| |v_P2_#t~mem17_71|))) (or (and .cse6 (= |v_P2_#t~ite19_64| v_~x$w_buff0~0_289) .cse3 .cse4 (= |v_P2_#t~ite18_68| |v_P2Thread1of1ForFork2_#t~ite18_74|)) (and (or .cse7 .cse8) (= |v_P2_#t~ite19_64| |v_P2_#t~ite18_68|) (or (and .cse6 (= |v_P2_#t~ite18_68| v_~x$w_buff1~0_301) .cse0 .cse1) (and (or .cse9 .cse10) (= (select .cse11 |v_~#x~0.offset_325|) |v_P2_#t~mem17_71|) (= |v_P2_#t~ite18_68| |v_P2_#t~mem17_71|)))))) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_130) v_~x$r_buff0_thd3~0_129) (= (store |v_#memory_int_741| |v_~#x~0.base_325| (store .cse11 |v_~#x~0.offset_325| |v_P2_#t~ite19_64|)) |v_#memory_int_740|) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_289, P2Thread1of1ForFork2_#t~mem17=|v_P2Thread1of1ForFork2_#t~mem17_74|, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~#x~0.offset=|v_~#x~0.offset_325|, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_124, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_566, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_130, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_590, #memory_int=|v_#memory_int_741|, ~#x~0.base=|v_~#x~0.base_325|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_74|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_289, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~#x~0.offset=|v_~#x~0.offset_325|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_565, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_589, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, #memory_int=|v_#memory_int_740|, ~#x~0.base=|v_~#x~0.base_325|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_105, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_39|} AuxVars[|v_P2_#t~mem17_71|, |v_P2_#t~ite19_64|, |v_P2_#t~ite18_68|] AssignedVars[P2Thread1of1ForFork2_#t~mem17, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, P2Thread1of1ForFork2_#t~ite18, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~ite19] [2022-12-13 12:00:52,357 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 12:00:52,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5343 [2022-12-13 12:00:52,358 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 336 flow [2022-12-13 12:00:52,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:52,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:52,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:00:52,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:00:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -342657128, now seen corresponding path program 1 times [2022-12-13 12:00:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825213250] [2022-12-13 12:00:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:00:52,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:00:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:00:52,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:00:52,538 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:00:52,538 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 12:00:52,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 12:00:52,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 12:00:52,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 12:00:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:00:52,540 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:52,545 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:00:52,545 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:00:52,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:00:52 BasicIcfg [2022-12-13 12:00:52,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:00:52,628 INFO L158 Benchmark]: Toolchain (without parser) took 20667.37ms. Allocated memory was 189.8MB in the beginning and 940.6MB in the end (delta: 750.8MB). Free memory was 163.8MB in the beginning and 731.5MB in the end (delta: -567.6MB). Peak memory consumption was 183.4MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.21ms. Allocated memory is still 189.8MB. Free memory was 163.8MB in the beginning and 137.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.17ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 189.8MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: RCFGBuilder took 783.89ms. Allocated memory was 189.8MB in the beginning and 244.3MB in the end (delta: 54.5MB). Free memory was 133.1MB in the beginning and 193.7MB in the end (delta: -60.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,629 INFO L158 Benchmark]: TraceAbstraction took 19321.28ms. Allocated memory was 244.3MB in the beginning and 940.6MB in the end (delta: 696.3MB). Free memory was 192.7MB in the beginning and 731.5MB in the end (delta: -538.8MB). Peak memory consumption was 157.5MB. Max. memory is 8.0GB. [2022-12-13 12:00:52,630 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 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.21ms. Allocated memory is still 189.8MB. Free memory was 163.8MB in the beginning and 137.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.17ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 189.8MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 783.89ms. Allocated memory was 189.8MB in the beginning and 244.3MB in the end (delta: 54.5MB). Free memory was 133.1MB in the beginning and 193.7MB in the end (delta: -60.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19321.28ms. Allocated memory was 244.3MB in the beginning and 940.6MB in the end (delta: 696.3MB). Free memory was 192.7MB in the beginning and 731.5MB in the end (delta: -538.8MB). Peak memory consumption was 157.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 118 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 1240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1329, independent: 1260, independent conditional: 1260, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1329, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1329, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1329, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 934, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 934, independent: 858, independent conditional: 0, independent unconditional: 858, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 330, dependent conditional: 0, dependent unconditional: 330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1329, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 934, unknown conditional: 0, unknown unconditional: 934] , Statistics on independence cache: Total cache size (in pairs): 1297, Positive cache size: 1256, Positive conditional cache size: 0, Positive unconditional cache size: 1256, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 137, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 137, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 137, unknown conditional: 0, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 115, independent conditional: 115, 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: 145, independent: 115, independent conditional: 18, independent unconditional: 97, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 19, independent unconditional: 95, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 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: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 73, independent conditional: 17, independent unconditional: 56, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 71, independent conditional: 9, independent unconditional: 62, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 70, independent conditional: 70, 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: 88, independent: 70, independent conditional: 28, independent unconditional: 42, 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: 88, independent: 70, independent conditional: 10, independent unconditional: 60, 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: 88, independent: 70, independent conditional: 10, independent unconditional: 60, 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: 7, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 139, Positive conditional cache size: 2, Positive unconditional cache size: 137, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 53 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 64, independent unconditional: 64, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 128, independent conditional: 30, independent unconditional: 98, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 30, independent unconditional: 98, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 100, independent conditional: 20, independent unconditional: 80, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 30, unknown conditional: 10, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 175, Positive conditional cache size: 12, Positive unconditional cache size: 163, 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: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 4, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 68, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 176, Positive conditional cache size: 12, Positive unconditional cache size: 164, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 146, independent conditional: 101, independent unconditional: 45, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 146, independent conditional: 100, independent unconditional: 46, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 146, independent conditional: 100, independent unconditional: 46, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 9, independent unconditional: 6, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 131, independent conditional: 91, independent unconditional: 40, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 191, Positive conditional cache size: 21, Positive unconditional cache size: 170, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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: 5.3s, 57 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 45 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 422, independent: 390, independent conditional: 390, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 422, independent: 390, independent conditional: 388, independent unconditional: 2, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 422, independent: 390, independent conditional: 380, independent unconditional: 10, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 422, independent: 390, independent conditional: 380, independent unconditional: 10, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 25, 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: 28, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 422, independent: 362, independent conditional: 355, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 28, unknown conditional: 25, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 260, Positive conditional cache size: 46, Positive unconditional cache size: 214, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2000, ((void *)0), P0, ((void *)0))=-1, t2000={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] [L840] 0 pthread_t t2001; [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2001, ((void *)0), P1, ((void *)0))=0, t2000={7:0}, t2001={8: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] [L842] 0 pthread_t t2002; [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 [L796] 2 y = 1 [L799] 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) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 \read(x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=1] [L843] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2002, ((void *)0), P2, ((void *)0))=1, t2000={7:0}, t2001={8:0}, t2002={5: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=1] [L813] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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] [L816] 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) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 \read(x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] 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) [L816] 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) [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 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 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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] [L758] 1 __unbuffered_p0_EAX = y [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_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] [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 \read(x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_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] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 \read(x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] 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) [L849] 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) [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 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 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 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 [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_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: 841]: 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: 839]: 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: 843]: 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, 149 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: 19.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 2 mSDtfsCounter, 632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=9, InterpolantAutomatonStates: 37, 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, 3.0s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:00:52,663 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...