/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:15:12,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:15:12,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:15:12,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:15:12,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:15:12,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:15:12,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:15:12,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:15:12,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:15:12,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:15:12,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:15:12,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:15:12,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:15:12,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:15:12,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:15:12,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:15:12,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:15:12,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:15:12,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:15:12,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:15:12,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:15:12,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:15:12,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:15:12,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:15:12,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:15:12,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:15:12,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:15:12,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:15:12,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:15:12,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:15:12,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:15:12,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:15:12,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:15:12,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:15:12,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:15:12,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:15:12,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:15:12,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:15:12,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:15:12,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:15:12,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:15:12,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:15:12,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:15:12,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:15:12,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:15:12,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:15:12,405 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:15:12,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:15:12,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:15:12,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:15:12,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:15:12,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:15:12,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:15:12,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:15:12,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:15:12,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:15:12,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:15:12,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:15:12,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:15:12,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:15:12,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:15:12,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:15:12,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:15:12,727 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:15:12,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:15:13,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:15:14,009 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:15:14,009 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:15:14,021 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b71fba93/f5ef9a0d4bd84a9d82545191b0d1a946/FLAG5fde10de4 [2022-12-06 04:15:14,031 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b71fba93/f5ef9a0d4bd84a9d82545191b0d1a946 [2022-12-06 04:15:14,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:15:14,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:15:14,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:15:14,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:15:14,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:15:14,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3722b08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14, skipping insertion in model container [2022-12-06 04:15:14,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:15:14,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:15:14,183 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:15:14,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:15:14,376 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:15:14,388 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:15:14,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:15:14,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:15:14,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:15:14,476 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:15:14,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14 WrapperNode [2022-12-06 04:15:14,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:15:14,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:15:14,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:15:14,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:15:14,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,529 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-06 04:15:14,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:15:14,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:15:14,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:15:14,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:15:14,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,566 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:15:14,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:15:14,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:15:14,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:15:14,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (1/1) ... [2022-12-06 04:15:14,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:15:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:15:14,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:15:14,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:15:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:15:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:15:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:15:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:15:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:15:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:15:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:15:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:15:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:15:14,649 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:15:14,815 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:15:14,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:15:15,116 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:15:15,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:15:15,197 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:15:15,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:15:15 BoogieIcfgContainer [2022-12-06 04:15:15,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:15:15,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:15:15,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:15:15,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:15:15,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:15:14" (1/3) ... [2022-12-06 04:15:15,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3398c6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:15:15, skipping insertion in model container [2022-12-06 04:15:15,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:15:14" (2/3) ... [2022-12-06 04:15:15,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3398c6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:15:15, skipping insertion in model container [2022-12-06 04:15:15,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:15:15" (3/3) ... [2022-12-06 04:15:15,208 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:15:15,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:15:15,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:15:15,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:15:15,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:15:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-06 04:15:15,348 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-06 04:15:15,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:15:15,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 04:15:15,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-06 04:15:15,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-06 04:15:15,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:15,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-06 04:15:15,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-06 04:15:15,387 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-06 04:15:15,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:15:15,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 04:15:15,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-06 04:15:15,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-06 04:15:18,886 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 04:15:18,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:15:18,901 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;@7b5d704c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:15:18,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:15:18,903 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:15:18,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:15:18,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:18,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:15:18,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 486260, now seen corresponding path program 1 times [2022-12-06 04:15:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:18,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531114668] [2022-12-06 04:15:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531114668] [2022-12-06 04:15:19,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531114668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:19,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:15:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344128310] [2022-12-06 04:15:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:15:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:15:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:15:19,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:15:19,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:19,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:19,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:15:19,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:19,464 INFO L130 PetriNetUnfolder]: 1106/1786 cut-off events. [2022-12-06 04:15:19,464 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:15:19,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 1786 events. 1106/1786 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9880 event pairs, 176 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 3469. Up to 1336 conditions per place. [2022-12-06 04:15:19,477 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-06 04:15:19,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2022-12-06 04:15:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:15:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:15:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 04:15:19,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-06 04:15:19,490 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-06 04:15:19,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2022-12-06 04:15:19,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:15:19,494 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-06 04:15:19,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 04:15:19,500 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 04:15:19,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:19,500 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-06 04:15:19,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:19,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:19,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-06 04:15:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 04:15:19,510 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:15:19,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:15:19,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:15:19,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 04:15:19,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 04:15:19,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:19,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 04:15:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 04:15:19,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:19,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:19,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:15:19,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1314408240, now seen corresponding path program 1 times [2022-12-06 04:15:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400848461] [2022-12-06 04:15:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:19,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400848461] [2022-12-06 04:15:19,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400848461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:19,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:19,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:15:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041372540] [2022-12-06 04:15:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:15:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:15:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:15:19,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:15:19,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:19,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:19,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:15:19,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:20,154 INFO L130 PetriNetUnfolder]: 2001/3012 cut-off events. [2022-12-06 04:15:20,155 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 04:15:20,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 3012 events. 2001/3012 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14407 event pairs, 651 based on Foata normal form. 94/3106 useless extension candidates. Maximal degree in co-relation 6234. Up to 2040 conditions per place. [2022-12-06 04:15:20,166 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-06 04:15:20,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 170 flow [2022-12-06 04:15:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:15:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:15:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:15:20,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 04:15:20,168 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:15:20,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 170 flow [2022-12-06 04:15:20,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:15:20,169 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-06 04:15:20,170 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 04:15:20,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:20,170 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:20,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:20,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,184 INFO L130 PetriNetUnfolder]: 48/171 cut-off events. [2022-12-06 04:15:20,184 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-06 04:15:20,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 171 events. 48/171 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 871 event pairs, 24 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 310. Up to 81 conditions per place. [2022-12-06 04:15:20,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:15:20,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:20,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 04:15:20,207 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2022-12-06 04:15:20,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:20,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:20,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:20,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:15:20,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2091949392, now seen corresponding path program 1 times [2022-12-06 04:15:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:20,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206872886] [2022-12-06 04:15:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:20,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206872886] [2022-12-06 04:15:20,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206872886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:20,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:20,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:15:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509398072] [2022-12-06 04:15:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:20,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:20,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:15:20,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:20,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:20,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:15:20,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:20,628 INFO L130 PetriNetUnfolder]: 1865/2812 cut-off events. [2022-12-06 04:15:20,629 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2022-12-06 04:15:20,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2812 events. 1865/2812 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12793 event pairs, 553 based on Foata normal form. 40/2852 useless extension candidates. Maximal degree in co-relation 6940. Up to 1428 conditions per place. [2022-12-06 04:15:20,643 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 04:15:20,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 240 flow [2022-12-06 04:15:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:15:20,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:15:20,645 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:15:20,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 240 flow [2022-12-06 04:15:20,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:15:20,652 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-06 04:15:20,653 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-06 04:15:20,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:20,653 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:20,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:20,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,666 INFO L130 PetriNetUnfolder]: 39/142 cut-off events. [2022-12-06 04:15:20,666 INFO L131 PetriNetUnfolder]: For 66/76 co-relation queries the response was YES. [2022-12-06 04:15:20,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 142 events. 39/142 cut-off events. For 66/76 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 654 event pairs, 14 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 311. Up to 68 conditions per place. [2022-12-06 04:15:20,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:15:20,676 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:20,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:15:20,678 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2022-12-06 04:15:20,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:20,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:20,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:15:20,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -473883939, now seen corresponding path program 1 times [2022-12-06 04:15:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:20,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810364148] [2022-12-06 04:15:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:20,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810364148] [2022-12-06 04:15:20,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810364148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:20,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:20,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:15:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924662555] [2022-12-06 04:15:20,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:20,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:20,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:20,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:15:20,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:20,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:20,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:15:20,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:21,100 INFO L130 PetriNetUnfolder]: 1826/2753 cut-off events. [2022-12-06 04:15:21,100 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2022-12-06 04:15:21,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2753 events. 1826/2753 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13073 event pairs, 350 based on Foata normal form. 8/2761 useless extension candidates. Maximal degree in co-relation 7246. Up to 1795 conditions per place. [2022-12-06 04:15:21,111 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 43 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2022-12-06 04:15:21,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 322 flow [2022-12-06 04:15:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 04:15:21,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 04:15:21,113 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 4 states and 52 transitions. [2022-12-06 04:15:21,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 322 flow [2022-12-06 04:15:21,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:15:21,116 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 04:15:21,117 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 04:15:21,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:21,117 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:21,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:21,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,129 INFO L130 PetriNetUnfolder]: 33/128 cut-off events. [2022-12-06 04:15:21,129 INFO L131 PetriNetUnfolder]: For 157/182 co-relation queries the response was YES. [2022-12-06 04:15:21,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 128 events. 33/128 cut-off events. For 157/182 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 572 event pairs, 13 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 344. Up to 60 conditions per place. [2022-12-06 04:15:21,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 04:15:21,132 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:21,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:15:21,133 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 201 flow [2022-12-06 04:15:21,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:21,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:21,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:21,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:15:21,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1805411487, now seen corresponding path program 1 times [2022-12-06 04:15:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:21,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5134811] [2022-12-06 04:15:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:21,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5134811] [2022-12-06 04:15:21,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5134811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:21,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:21,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:15:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56510158] [2022-12-06 04:15:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:21,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:15:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:21,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:15:21,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:15:21,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:15:21,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:21,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:21,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:15:21,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:21,403 INFO L130 PetriNetUnfolder]: 740/1286 cut-off events. [2022-12-06 04:15:21,404 INFO L131 PetriNetUnfolder]: For 1162/1224 co-relation queries the response was YES. [2022-12-06 04:15:21,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1286 events. 740/1286 cut-off events. For 1162/1224 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6554 event pairs, 189 based on Foata normal form. 89/1352 useless extension candidates. Maximal degree in co-relation 3452. Up to 989 conditions per place. [2022-12-06 04:15:21,410 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 38 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-12-06 04:15:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 361 flow [2022-12-06 04:15:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:15:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:15:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:15:21,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-06 04:15:21,411 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 201 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:15:21,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 361 flow [2022-12-06 04:15:21,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 359 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:15:21,415 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-06 04:15:21,415 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-06 04:15:21,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:21,415 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:21,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:21,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,442 INFO L130 PetriNetUnfolder]: 88/275 cut-off events. [2022-12-06 04:15:21,443 INFO L131 PetriNetUnfolder]: For 195/222 co-relation queries the response was YES. [2022-12-06 04:15:21,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 275 events. 88/275 cut-off events. For 195/222 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1607 event pairs, 36 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 666. Up to 129 conditions per place. [2022-12-06 04:15:21,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 04:15:21,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:21,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:15:21,470 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 225 flow [2022-12-06 04:15:21,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:21,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:21,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:15:21,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:21,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 671671113, now seen corresponding path program 1 times [2022-12-06 04:15:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919351464] [2022-12-06 04:15:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:21,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919351464] [2022-12-06 04:15:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919351464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:21,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:15:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006650669] [2022-12-06 04:15:21,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:21,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:21,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:15:21,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:21,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:21,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:15:21,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:21,760 INFO L130 PetriNetUnfolder]: 371/712 cut-off events. [2022-12-06 04:15:21,760 INFO L131 PetriNetUnfolder]: For 657/682 co-relation queries the response was YES. [2022-12-06 04:15:21,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 712 events. 371/712 cut-off events. For 657/682 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3435 event pairs, 114 based on Foata normal form. 87/782 useless extension candidates. Maximal degree in co-relation 2242. Up to 235 conditions per place. [2022-12-06 04:15:21,768 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 49 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2022-12-06 04:15:21,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 467 flow [2022-12-06 04:15:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:15:21,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-06 04:15:21,772 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 225 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:15:21,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 467 flow [2022-12-06 04:15:21,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:15:21,775 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 04:15:21,778 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-06 04:15:21,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:21,778 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:21,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:21,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,796 INFO L130 PetriNetUnfolder]: 44/170 cut-off events. [2022-12-06 04:15:21,796 INFO L131 PetriNetUnfolder]: For 193/230 co-relation queries the response was YES. [2022-12-06 04:15:21,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 170 events. 44/170 cut-off events. For 193/230 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 795 event pairs, 8 based on Foata normal form. 12/176 useless extension candidates. Maximal degree in co-relation 509. Up to 75 conditions per place. [2022-12-06 04:15:21,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 04:15:21,802 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:21,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:15:21,803 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 261 flow [2022-12-06 04:15:21,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:21,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:21,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:21,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:15:21,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 112072938, now seen corresponding path program 1 times [2022-12-06 04:15:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025643139] [2022-12-06 04:15:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025643139] [2022-12-06 04:15:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025643139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:22,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:22,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:15:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664085410] [2022-12-06 04:15:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:22,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:22,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:15:22,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 261 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:22,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:22,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:15:22,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:22,175 INFO L130 PetriNetUnfolder]: 626/1117 cut-off events. [2022-12-06 04:15:22,175 INFO L131 PetriNetUnfolder]: For 1983/1983 co-relation queries the response was YES. [2022-12-06 04:15:22,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 1117 events. 626/1117 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5291 event pairs, 145 based on Foata normal form. 10/1127 useless extension candidates. Maximal degree in co-relation 3905. Up to 607 conditions per place. [2022-12-06 04:15:22,180 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 47 selfloop transitions, 9 changer transitions 10/66 dead transitions. [2022-12-06 04:15:22,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 506 flow [2022-12-06 04:15:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:15:22,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2022-12-06 04:15:22,181 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 261 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:15:22,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 506 flow [2022-12-06 04:15:22,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 480 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:15:22,186 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-06 04:15:22,187 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 04:15:22,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:22,187 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:22,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:22,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,201 INFO L130 PetriNetUnfolder]: 44/177 cut-off events. [2022-12-06 04:15:22,201 INFO L131 PetriNetUnfolder]: For 244/265 co-relation queries the response was YES. [2022-12-06 04:15:22,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 177 events. 44/177 cut-off events. For 244/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 882 event pairs, 10 based on Foata normal form. 13/184 useless extension candidates. Maximal degree in co-relation 478. Up to 69 conditions per place. [2022-12-06 04:15:22,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 04:15:22,219 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:15:22,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 04:15:22,221 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 244 flow [2022-12-06 04:15:22,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:22,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:22,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:22,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:15:22,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash -954586473, now seen corresponding path program 1 times [2022-12-06 04:15:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:22,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820395019] [2022-12-06 04:15:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820395019] [2022-12-06 04:15:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820395019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:22,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:22,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:15:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868638554] [2022-12-06 04:15:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:22,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:15:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:15:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:15:22,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:15:22,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:22,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:22,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:15:22,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:22,560 INFO L130 PetriNetUnfolder]: 576/1127 cut-off events. [2022-12-06 04:15:22,561 INFO L131 PetriNetUnfolder]: For 1654/1668 co-relation queries the response was YES. [2022-12-06 04:15:22,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 1127 events. 576/1127 cut-off events. For 1654/1668 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6096 event pairs, 164 based on Foata normal form. 14/1131 useless extension candidates. Maximal degree in co-relation 3652. Up to 520 conditions per place. [2022-12-06 04:15:22,565 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 41 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2022-12-06 04:15:22,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 502 flow [2022-12-06 04:15:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:15:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:15:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:15:22,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 04:15:22,567 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 244 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:15:22,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 502 flow [2022-12-06 04:15:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 466 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:15:22,570 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 222 flow [2022-12-06 04:15:22,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-06 04:15:22,572 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 04:15:22,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:22,572 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 222 flow [2022-12-06 04:15:22,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:22,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:22,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 222 flow [2022-12-06 04:15:22,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 222 flow [2022-12-06 04:15:22,590 INFO L130 PetriNetUnfolder]: 65/254 cut-off events. [2022-12-06 04:15:22,591 INFO L131 PetriNetUnfolder]: For 277/306 co-relation queries the response was YES. [2022-12-06 04:15:22,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 254 events. 65/254 cut-off events. For 277/306 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1482 event pairs, 13 based on Foata normal form. 17/262 useless extension candidates. Maximal degree in co-relation 662. Up to 115 conditions per place. [2022-12-06 04:15:22,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 222 flow [2022-12-06 04:15:22,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:15:22,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:15:22,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 04:15:22,642 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 228 flow [2022-12-06 04:15:22,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:22,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:22,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:22,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:15:22,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -756097063, now seen corresponding path program 2 times [2022-12-06 04:15:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:22,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055692804] [2022-12-06 04:15:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055692804] [2022-12-06 04:15:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055692804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:22,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:15:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631332696] [2022-12-06 04:15:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:22,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:15:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:15:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:15:22,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:15:22,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:22,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:22,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:15:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:22,948 INFO L130 PetriNetUnfolder]: 421/830 cut-off events. [2022-12-06 04:15:22,948 INFO L131 PetriNetUnfolder]: For 856/868 co-relation queries the response was YES. [2022-12-06 04:15:22,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 830 events. 421/830 cut-off events. For 856/868 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4436 event pairs, 138 based on Foata normal form. 54/868 useless extension candidates. Maximal degree in co-relation 2631. Up to 328 conditions per place. [2022-12-06 04:15:22,952 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 10 changer transitions 18/63 dead transitions. [2022-12-06 04:15:22,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 466 flow [2022-12-06 04:15:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:15:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:15:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:15:22,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:15:22,953 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 228 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:15:22,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 466 flow [2022-12-06 04:15:22,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 447 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:15:22,956 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 162 flow [2022-12-06 04:15:22,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2022-12-06 04:15:22,956 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 04:15:22,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:22,956 INFO L89 Accepts]: Start accepts. Operand has 53 places, 28 transitions, 162 flow [2022-12-06 04:15:22,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:22,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:22,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 28 transitions, 162 flow [2022-12-06 04:15:22,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 28 transitions, 162 flow [2022-12-06 04:15:22,968 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2022-12-06 04:15:22,968 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-12-06 04:15:22,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 38 events. 6/38 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 51 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2022-12-06 04:15:22,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 28 transitions, 162 flow [2022-12-06 04:15:22,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:15:23,995 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:15:23,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1040 [2022-12-06 04:15:23,997 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 22 transitions, 146 flow [2022-12-06 04:15:23,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:23,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:23,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:23,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:15:23,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1506996438, now seen corresponding path program 1 times [2022-12-06 04:15:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522488013] [2022-12-06 04:15:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:15:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:15:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:15:24,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522488013] [2022-12-06 04:15:24,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522488013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:15:24,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:15:24,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:15:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95323199] [2022-12-06 04:15:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:15:24,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:15:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:15:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:15:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:15:24,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:15:24,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 22 transitions, 146 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:24,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:15:24,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:15:24,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:15:24,638 INFO L130 PetriNetUnfolder]: 99/193 cut-off events. [2022-12-06 04:15:24,638 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 04:15:24,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 193 events. 99/193 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 659 event pairs, 5 based on Foata normal form. 1/194 useless extension candidates. Maximal degree in co-relation 706. Up to 108 conditions per place. [2022-12-06 04:15:24,639 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 28 selfloop transitions, 4 changer transitions 17/49 dead transitions. [2022-12-06 04:15:24,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 397 flow [2022-12-06 04:15:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:15:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:15:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 04:15:24,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 04:15:24,640 INFO L175 Difference]: Start difference. First operand has 45 places, 22 transitions, 146 flow. Second operand 6 states and 36 transitions. [2022-12-06 04:15:24,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 397 flow [2022-12-06 04:15:24,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 310 flow, removed 18 selfloop flow, removed 12 redundant places. [2022-12-06 04:15:24,643 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 110 flow [2022-12-06 04:15:24,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2022-12-06 04:15:24,644 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 04:15:24,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:15:24,644 INFO L89 Accepts]: Start accepts. Operand has 39 places, 22 transitions, 110 flow [2022-12-06 04:15:24,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:15:24,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:15:24,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 110 flow [2022-12-06 04:15:24,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 110 flow [2022-12-06 04:15:24,650 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 04:15:24,651 INFO L131 PetriNetUnfolder]: For 34/36 co-relation queries the response was YES. [2022-12-06 04:15:24,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 29 events. 6/29 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 72. Up to 10 conditions per place. [2022-12-06 04:15:24,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 110 flow [2022-12-06 04:15:24,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 04:15:24,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] L760-->P0EXIT: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_485 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_134 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_181 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_486 256) 0)))) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_428 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= |v_P0Thread1of1ForFork1_#res#1.offset_27| 0) (= v_~__unbuffered_cnt~0_185 (+ v_~__unbuffered_cnt~0_186 1)) (= v_~a~0_360 (ite .cse0 v_~a$w_buff0~0_265 (ite .cse1 v_~a$w_buff1~0_235 v_~a~0_361))) (= (ite .cse0 0 v_~a$w_buff0_used~0_486) v_~a$w_buff0_used~0_485) (= v_~a$r_buff1_thd1~0_133 (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_180 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_427 256) 0)) .cse3)) 0 v_~a$r_buff1_thd1~0_134)) (= |v_P0Thread1of1ForFork1_#res#1.base_27| 0) (= (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_428) v_~a$w_buff1_used~0_427) (= v_~a$r_buff0_thd1~0_180 (ite .cse4 0 v_~a$r_buff0_thd1~0_181))))) InVars {~a~0=v_~a~0_361, ~a$w_buff1~0=v_~a$w_buff1~0_235, ~a$w_buff0~0=v_~a$w_buff0~0_265, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_134, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_486, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_181, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_428} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_27|, ~a~0=v_~a~0_360, ~a$w_buff1~0=v_~a$w_buff1~0_235, ~a$w_buff0~0=v_~a$w_buff0~0_265, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_133, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_27|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_485, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_180, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_427} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [473] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd0~0_139 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_439 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_440 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= 0 (mod v_~a$w_buff1_used~0_384 256)))))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_62) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_384) v_~a$w_buff1_used~0_383) (= (ite .cse0 0 v_~a$r_buff0_thd0~0_132) v_~a$r_buff0_thd0~0_131) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_66 0) (= v_~__unbuffered_p2_EAX~0_70 1) (= 2 v_~x~0_100) (= v_~__unbuffered_p2_EBX~0_82 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_64 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61| 0) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_383 256) 0))) (and (not (= (mod v_~a$r_buff0_thd0~0_131 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_139) v_~a$r_buff1_thd0~0_138) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= v_~a$w_buff0_used~0_439 (ite .cse4 0 v_~a$w_buff0_used~0_440)) (= v_~a~0_316 (ite .cse4 v_~a$w_buff0~0_239 (ite .cse1 v_~a$w_buff1~0_211 v_~a~0_317))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|) (= (mod v_~main$tmp_guard0~0_62 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)))) InVars {~a~0=v_~a~0_317, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_82, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_211, ~a$w_buff0~0=v_~a$w_buff0~0_239, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_139, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_440, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_132, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_384, ~x~0=v_~x~0_100} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_82, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_57|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_439, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_62, ~a~0=v_~a~0_316, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_211, ~a$w_buff0~0=v_~a$w_buff0~0_239, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_138, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_383, ~x~0=v_~x~0_100, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:15:25,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd0~0_139 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_439 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_132 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_440 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= 0 (mod v_~a$w_buff1_used~0_384 256)))))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_62) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_384) v_~a$w_buff1_used~0_383) (= (ite .cse0 0 v_~a$r_buff0_thd0~0_132) v_~a$r_buff0_thd0~0_131) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_66 0) (= v_~__unbuffered_p2_EAX~0_70 1) (= 2 v_~x~0_100) (= v_~__unbuffered_p2_EBX~0_82 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_64 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61| 0) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_383 256) 0))) (and (not (= (mod v_~a$r_buff0_thd0~0_131 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_139) v_~a$r_buff1_thd0~0_138) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= v_~a$w_buff0_used~0_439 (ite .cse4 0 v_~a$w_buff0_used~0_440)) (= v_~a~0_316 (ite .cse4 v_~a$w_buff0~0_239 (ite .cse1 v_~a$w_buff1~0_211 v_~a~0_317))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|) (= (mod v_~main$tmp_guard0~0_62 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)))) InVars {~a~0=v_~a~0_317, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_82, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_211, ~a$w_buff0~0=v_~a$w_buff0~0_239, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_139, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_440, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_132, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_384, ~x~0=v_~x~0_100} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_82, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_57|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_439, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_62, ~a~0=v_~a~0_316, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_211, ~a$w_buff0~0=v_~a$w_buff0~0_239, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_138, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_383, ~x~0=v_~x~0_100, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [469] $Ultimate##0-->L760: Formula: (and (= v_~a$w_buff0_used~0_405 1) (= v_~a$w_buff0_used~0_406 v_~a$w_buff1_used~0_351) (= v_~a$r_buff0_thd2~0_147 v_~a$r_buff1_thd2~0_150) (= |v_P0Thread1of1ForFork1_~arg#1.base_35| |v_P0Thread1of1ForFork1_#in~arg#1.base_35|) (= v_~x~0_96 1) (= v_~a$r_buff0_thd1~0_142 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|) (= v_~a$w_buff0~0_217 1) (= v_~a$w_buff0~0_218 v_~a$w_buff1~0_191) (= |v_P0Thread1of1ForFork1_~arg#1.offset_35| |v_P0Thread1of1ForFork1_#in~arg#1.offset_35|) (= v_~a$r_buff0_thd3~0_169 v_~a$r_buff1_thd3~0_167) (= v_~a$r_buff0_thd1~0_143 v_~a$r_buff1_thd1~0_99) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_405 256) 0)) (not (= (mod v_~a$w_buff1_used~0_351 256) 0)))) 1 0)) (= v_~a$r_buff0_thd0~0_125 v_~a$r_buff1_thd0~0_132)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_35|, ~a$w_buff0~0=v_~a$w_buff0~0_218, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_406, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_143, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_35|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_125} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_35|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_167, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_150, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_405, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_142, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_35|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_125, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_35|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_35|, ~a$w_buff1~0=v_~a$w_buff1~0_191, ~a$w_buff0~0=v_~a$w_buff0~0_217, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_351, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41|, ~x~0=v_~x~0_96} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] [2022-12-06 04:15:25,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L760-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~a$r_buff0_thd1~0_207 256) 0)))) (let ((.cse11 (and (not (= (mod v_~a$w_buff0_used~0_517 256) 0)) .cse14))) (let ((.cse10 (ite .cse11 0 v_~a$w_buff0_used~0_517))) (let ((.cse4 (not (= (mod .cse10 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_158 256) 0)))) (let ((.cse12 (and (not (= (mod v_~a$w_buff1_used~0_457 256) 0)) .cse3)) (.cse5 (and .cse4 .cse14))) (let ((.cse8 (ite (or .cse12 .cse5) 0 v_~a$w_buff1_used~0_457))) (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_515 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd0~0_143 256) 0))) (.cse2 (not (= (mod .cse8 256) 0))) (.cse13 (not (= (mod v_~a$r_buff0_thd0~0_136 256) 0)))) (let ((.cse9 (and .cse4 .cse13)) (.cse7 (and .cse1 .cse2)) (.cse6 (and .cse0 .cse13))) (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_209 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= (ite (= (ite (not (and (= 2 v_~x~0_102) (= v_~__unbuffered_p2_EAX~0_80 1) (= v_~__unbuffered_p1_EAX~0_68 0) (= v_~__unbuffered_p2_EBX~0_92 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_66) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= v_~__unbuffered_cnt~0_209 (+ v_~__unbuffered_cnt~0_210 1)) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_135 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$w_buff1_used~0_455 256) 0)))) 0 v_~a$r_buff1_thd0~0_143) v_~a$r_buff1_thd0~0_142) (= |v_P0Thread1of1ForFork1_#res#1.base_39| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (ite (or (and .cse2 .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_206 256) 0)))) 0 v_~a$r_buff1_thd1~0_158) v_~a$r_buff1_thd1~0_157) (= |v_P0Thread1of1ForFork1_#res#1.offset_39| 0) (= v_~a$r_buff0_thd1~0_206 (ite .cse5 0 v_~a$r_buff0_thd1~0_207)) (= v_~a$w_buff1_used~0_455 (ite (or .cse6 .cse7) 0 .cse8)) (= (ite .cse9 0 .cse10) v_~a$w_buff0_used~0_515) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= (ite .cse9 v_~a$w_buff0~0_279 (ite .cse7 v_~a$w_buff1~0_247 (ite .cse11 v_~a$w_buff0~0_279 (ite .cse12 v_~a$w_buff1~0_247 v_~a~0_390)))) v_~a~0_388) (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= v_~a$r_buff0_thd0~0_135 (ite .cse6 0 v_~a$r_buff0_thd0~0_136))))))))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_158, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_517, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_207, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_136, ~a~0=v_~a~0_390, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_68, ~a$w_buff1~0=v_~a$w_buff1~0_247, ~a$w_buff0~0=v_~a$w_buff0~0_279, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_143, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_210, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_457, ~x~0=v_~x~0_102} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_39|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_59|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_157, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_515, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_206, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ~a~0=v_~a~0_388, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_68, ~a$w_buff1~0=v_~a$w_buff1~0_247, ~a$w_buff0~0=v_~a$w_buff0~0_279, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_39|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_142, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_209, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_455, ~x~0=v_~x~0_102, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, P0Thread1of1ForFork1_#res#1.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [469] $Ultimate##0-->L760: Formula: (and (= v_~a$w_buff0_used~0_405 1) (= v_~a$w_buff0_used~0_406 v_~a$w_buff1_used~0_351) (= v_~a$r_buff0_thd2~0_147 v_~a$r_buff1_thd2~0_150) (= |v_P0Thread1of1ForFork1_~arg#1.base_35| |v_P0Thread1of1ForFork1_#in~arg#1.base_35|) (= v_~x~0_96 1) (= v_~a$r_buff0_thd1~0_142 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|) (= v_~a$w_buff0~0_217 1) (= v_~a$w_buff0~0_218 v_~a$w_buff1~0_191) (= |v_P0Thread1of1ForFork1_~arg#1.offset_35| |v_P0Thread1of1ForFork1_#in~arg#1.offset_35|) (= v_~a$r_buff0_thd3~0_169 v_~a$r_buff1_thd3~0_167) (= v_~a$r_buff0_thd1~0_143 v_~a$r_buff1_thd1~0_99) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_405 256) 0)) (not (= (mod v_~a$w_buff1_used~0_351 256) 0)))) 1 0)) (= v_~a$r_buff0_thd0~0_125 v_~a$r_buff1_thd0~0_132)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_35|, ~a$w_buff0~0=v_~a$w_buff0~0_218, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_406, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_143, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_35|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_125} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_35|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_167, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_150, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_405, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_142, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_35|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_125, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_35|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_35|, ~a$w_buff1~0=v_~a$w_buff1~0_191, ~a$w_buff0~0=v_~a$w_buff0~0_217, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_351, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41|, ~x~0=v_~x~0_96} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] [2022-12-06 04:15:26,114 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:15:26,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1471 [2022-12-06 04:15:26,115 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 149 flow [2022-12-06 04:15:26,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:15:26,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:15:26,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:26,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:15:26,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:15:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:15:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -388969934, now seen corresponding path program 1 times [2022-12-06 04:15:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:15:26,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326051623] [2022-12-06 04:15:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:15:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:15:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:15:26,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:15:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:15:26,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:15:26,256 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:15:26,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:15:26,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:15:26,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:15:26,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:15:26,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:15:26,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:15:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:15:26,260 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:15:26,267 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:15:26,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:15:26,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:15:26 BasicIcfg [2022-12-06 04:15:26,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:15:26,336 INFO L158 Benchmark]: Toolchain (without parser) took 12301.66ms. Allocated memory was 187.7MB in the beginning and 440.4MB in the end (delta: 252.7MB). Free memory was 162.6MB in the beginning and 381.9MB in the end (delta: -219.3MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. [2022-12-06 04:15:26,336 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:15:26,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.05ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 135.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:15:26,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.21ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:15:26,336 INFO L158 Benchmark]: Boogie Preprocessor took 52.05ms. Allocated memory is still 187.7MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:15:26,337 INFO L158 Benchmark]: RCFGBuilder took 615.88ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 96.5MB in the end (delta: 34.7MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:15:26,337 INFO L158 Benchmark]: TraceAbstraction took 11135.63ms. Allocated memory was 187.7MB in the beginning and 440.4MB in the end (delta: 252.7MB). Free memory was 96.0MB in the beginning and 381.9MB in the end (delta: -285.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:15:26,338 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.12ms. Allocated memory is still 187.7MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.05ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 135.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.21ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.05ms. Allocated memory is still 187.7MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.88ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 96.5MB in the end (delta: 34.7MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11135.63ms. Allocated memory was 187.7MB in the beginning and 440.4MB in the end (delta: 252.7MB). Free memory was 96.0MB in the beginning and 381.9MB in the end (delta: -285.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 117 PlacesBefore, 38 PlacesAfterwards, 109 TransitionsBefore, 29 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 1744, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1414, independent: 1374, independent conditional: 0, independent unconditional: 1374, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1414, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1804, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1414, unknown conditional: 0, unknown unconditional: 1414] , Statistics on independence cache: Total cache size (in pairs): 2260, Positive cache size: 2220, Positive conditional cache size: 0, Positive unconditional cache size: 2220, 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.1s, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 77, independent conditional: 77, 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: 101, independent: 77, independent conditional: 16, independent unconditional: 61, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 77, independent conditional: 16, independent unconditional: 61, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 77, independent conditional: 16, independent unconditional: 61, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 72, independent conditional: 15, independent unconditional: 57, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 103, dependent conditional: 35, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 92, unknown conditional: 19, unknown unconditional: 73] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 72, Positive conditional cache size: 15, Positive unconditional cache size: 57, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 82, independent conditional: 15, independent unconditional: 67, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 82, Positive conditional cache size: 15, Positive unconditional cache size: 67, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 7, independent unconditional: 86, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 88, Positive conditional cache size: 15, Positive unconditional cache size: 73, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 123, independent conditional: 31, independent unconditional: 92, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 146, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 98, Positive conditional cache size: 15, Positive unconditional cache size: 83, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 53, independent conditional: 26, independent unconditional: 27, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 53, independent conditional: 17, independent unconditional: 36, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 53, independent conditional: 17, independent unconditional: 36, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 49, independent conditional: 15, independent unconditional: 34, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 102, Positive conditional cache size: 17, Positive unconditional cache size: 85, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, 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.0s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 89, independent conditional: 42, independent unconditional: 47, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 89, independent conditional: 26, independent unconditional: 63, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 89, independent conditional: 26, independent unconditional: 63, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 114, independent: 84, independent conditional: 23, independent unconditional: 61, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 107, Positive conditional cache size: 20, Positive unconditional cache size: 87, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 42, independent conditional: 15, independent unconditional: 27, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 42, independent conditional: 9, independent unconditional: 33, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 42, independent conditional: 9, independent unconditional: 33, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 109, Positive conditional cache size: 21, Positive unconditional cache size: 88, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 113, Positive conditional cache size: 23, Positive unconditional cache size: 90, Negative cache size: 30, Negative conditional cache size: 4, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 51 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 22 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 66, independent conditional: 34, independent unconditional: 32, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 66, independent conditional: 29, independent unconditional: 37, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 66, independent conditional: 29, independent unconditional: 37, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, independent: 48, independent conditional: 17, independent unconditional: 31, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 26, unknown conditional: 12, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 154, Positive conditional cache size: 39, Positive unconditional cache size: 115, Negative cache size: 38, Negative conditional cache size: 4, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 38 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 123, independent conditional: 123, 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: 147, independent: 123, independent conditional: 99, independent unconditional: 24, 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: 147, independent: 123, independent conditional: 90, independent unconditional: 33, 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: 147, independent: 123, independent conditional: 90, independent unconditional: 33, 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: 22, independent: 21, independent conditional: 14, independent unconditional: 7, 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: 22, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 102, independent conditional: 76, independent unconditional: 26, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 22, unknown conditional: 14, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 214, Positive conditional cache size: 53, Positive unconditional cache size: 161, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 141 locations, 6 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: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 17 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 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-06 04:15:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...