/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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:22:03,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:22:03,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:22:03,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:22:03,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:22:03,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:22:03,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:22:03,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:22:03,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:22:03,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:22:03,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:22:03,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:22:03,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:22:03,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:22:03,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:22:03,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:22:03,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:22:03,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:22:03,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:22:03,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:22:03,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:22:03,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:22:03,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:22:03,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:22:03,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:22:03,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:22:03,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:22:03,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:22:03,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:22:03,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:22:03,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:22:03,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:22:03,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:22:03,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:22:03,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:22:03,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:22:03,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:22:03,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:22:03,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:22:03,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:22:03,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:22:03,378 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:22:03,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:22:03,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:22:03,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:22:03,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:22:03,408 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:22:03,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:22:03,409 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:22:03,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:22:03,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:22:03,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:22:03,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:22:03,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:22:03,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:22:03,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:22:03,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:22:03,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:03,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:22:03,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:22:03,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:22:03,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:22:03,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:22:03,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:22:03,412 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:22:03,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:22:03,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:22:03,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:22:03,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:22:03,690 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:22:03,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:22:04,735 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:22:04,995 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:22:04,995 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:22:05,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7dc7c5eb/b6e5d9e8e3bb4312b7bab9a00c7030b1/FLAG13566b13f [2022-12-06 04:22:05,025 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7dc7c5eb/b6e5d9e8e3bb4312b7bab9a00c7030b1 [2022-12-06 04:22:05,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:22:05,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:22:05,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:05,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:22:05,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:22:05,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca52d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05, skipping insertion in model container [2022-12-06 04:22:05,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:22:05,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:22:05,220 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-06 04:22:05,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:05,409 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:22:05,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-06 04:22:05,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:22:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:22:05,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:22:05,484 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:22:05,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05 WrapperNode [2022-12-06 04:22:05,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:22:05,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:05,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:22:05,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:22:05,491 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:22:05" (1/1) ... [2022-12-06 04:22:05,515 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:22:05" (1/1) ... [2022-12-06 04:22:05,540 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-12-06 04:22:05,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:22:05,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:22:05,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:22:05,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:22:05,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:22:05,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:22:05,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:22:05,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:22:05,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (1/1) ... [2022-12-06 04:22:05,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:22:05,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:22:05,628 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:22:05,662 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:22:05,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:22:05,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:22:05,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:22:05,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:22:05,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:22:05,675 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:22:05,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:22:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:22:05,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:22:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:22:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:22:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:22:05,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:22:05,678 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:22:05,846 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:22:05,847 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:22:06,069 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:22:06,207 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:22:06,207 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:22:06,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:06 BoogieIcfgContainer [2022-12-06 04:22:06,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:22:06,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:22:06,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:22:06,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:22:06,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:22:05" (1/3) ... [2022-12-06 04:22:06,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187a9b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:06, skipping insertion in model container [2022-12-06 04:22:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:22:05" (2/3) ... [2022-12-06 04:22:06,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187a9b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:22:06, skipping insertion in model container [2022-12-06 04:22:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:22:06" (3/3) ... [2022-12-06 04:22:06,215 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:22:06,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:22:06,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:22:06,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:22:06,276 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:22:06,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-06 04:22:06,345 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-06 04:22:06,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:06,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:22:06,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-06 04:22:06,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-06 04:22:06,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:06,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-06 04:22:06,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-06 04:22:06,447 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-06 04:22:06,447 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:06,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:22:06,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-06 04:22:06,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-06 04:22:09,611 INFO L203 LiptonReduction]: Total number of compositions: 70 [2022-12-06 04:22:09,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:22:09,625 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;@279b7ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:22:09,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:22:09,627 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:22:09,627 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:09,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:09,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:22:09,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 376528037, now seen corresponding path program 1 times [2022-12-06 04:22:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:09,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284606849] [2022-12-06 04:22:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:09,933 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:22:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:09,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284606849] [2022-12-06 04:22:09,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284606849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:09,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:09,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:22:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068565021] [2022-12-06 04:22:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:09,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:09,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:09,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:09,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:22:09,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:22:09,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:09,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:22:09,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:10,038 INFO L130 PetriNetUnfolder]: 135/312 cut-off events. [2022-12-06 04:22:10,038 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:22:10,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 312 events. 135/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1424 event pairs, 21 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 556. Up to 187 conditions per place. [2022-12-06 04:22:10,042 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 17 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 04:22:10,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 104 flow [2022-12-06 04:22:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:22:10,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 04:22:10,055 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:22:10,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 104 flow [2022-12-06 04:22:10,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:10,059 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-06 04:22:10,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-06 04:22:10,064 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 04:22:10,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:10,065 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-06 04:22:10,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:10,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:10,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-06 04:22:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 04:22:10,075 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 04:22:10,075 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:10,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:22:10,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 04:22:10,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 04:22:10,126 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:10,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 04:22:10,128 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2022-12-06 04:22:10,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:22:10,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:10,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:22:10,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1066232915, now seen corresponding path program 1 times [2022-12-06 04:22:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:10,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771224593] [2022-12-06 04:22:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:10,339 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:22:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:10,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771224593] [2022-12-06 04:22:10,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771224593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:10,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:10,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:22:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171217351] [2022-12-06 04:22:10,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:10,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:10,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:22:10,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:22:10,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:10,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:22:10,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:10,445 INFO L130 PetriNetUnfolder]: 204/378 cut-off events. [2022-12-06 04:22:10,445 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:22:10,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 378 events. 204/378 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1590 event pairs, 56 based on Foata normal form. 22/400 useless extension candidates. Maximal degree in co-relation 775. Up to 209 conditions per place. [2022-12-06 04:22:10,452 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2022-12-06 04:22:10,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 124 flow [2022-12-06 04:22:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 04:22:10,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:22:10,455 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 29 transitions. [2022-12-06 04:22:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 124 flow [2022-12-06 04:22:10,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:10,456 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 04:22:10,457 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 04:22:10,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:10,457 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:10,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:10,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,466 INFO L130 PetriNetUnfolder]: 18/74 cut-off events. [2022-12-06 04:22:10,466 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:22:10,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 74 events. 18/74 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 282 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 145. Up to 27 conditions per place. [2022-12-06 04:22:10,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 04:22:10,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:10,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:22:10,479 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-06 04:22:10,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:22:10,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:10,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:10,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:22:10,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1306518437, now seen corresponding path program 1 times [2022-12-06 04:22:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732294398] [2022-12-06 04:22:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:10,631 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:22:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732294398] [2022-12-06 04:22:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732294398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:10,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:10,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276252083] [2022-12-06 04:22:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:10,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:22:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:22:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:22:10,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:22:10,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:22:10,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:10,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:22:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:10,702 INFO L130 PetriNetUnfolder]: 185/344 cut-off events. [2022-12-06 04:22:10,702 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-06 04:22:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 344 events. 185/344 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1284 event pairs, 52 based on Foata normal form. 9/353 useless extension candidates. Maximal degree in co-relation 900. Up to 122 conditions per place. [2022-12-06 04:22:10,704 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 22 selfloop transitions, 6 changer transitions 3/31 dead transitions. [2022-12-06 04:22:10,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 172 flow [2022-12-06 04:22:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:22:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:22:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 04:22:10,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-06 04:22:10,711 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 4 states and 29 transitions. [2022-12-06 04:22:10,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 172 flow [2022-12-06 04:22:10,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:10,715 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2022-12-06 04:22:10,716 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 04:22:10,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:10,716 INFO L89 Accepts]: Start accepts. Operand has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:10,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:10,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,724 INFO L130 PetriNetUnfolder]: 9/53 cut-off events. [2022-12-06 04:22:10,724 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 04:22:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 53 events. 9/53 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 158 event pairs, 2 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 115. Up to 18 conditions per place. [2022-12-06 04:22:10,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:22:10,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:10,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:22:10,728 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 94 flow [2022-12-06 04:22:10,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:22:10,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:10,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:10,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:22:10,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2063003482, now seen corresponding path program 1 times [2022-12-06 04:22:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:10,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018208560] [2022-12-06 04:22:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,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:22:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018208560] [2022-12-06 04:22:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018208560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:22:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135796599] [2022-12-06 04:22:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:22:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:22:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:22:11,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 04:22:11,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 04:22:11,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,129 INFO L130 PetriNetUnfolder]: 162/323 cut-off events. [2022-12-06 04:22:11,129 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 04:22:11,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 323 events. 162/323 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1306 event pairs, 38 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 881. Up to 181 conditions per place. [2022-12-06 04:22:11,131 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 21 selfloop transitions, 7 changer transitions 10/42 dead transitions. [2022-12-06 04:22:11,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 253 flow [2022-12-06 04:22:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:22:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:22:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 04:22:11,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 04:22:11,132 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 94 flow. Second operand 5 states and 43 transitions. [2022-12-06 04:22:11,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 253 flow [2022-12-06 04:22:11,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:22:11,134 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 04:22:11,134 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2022-12-06 04:22:11,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,134 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,143 INFO L130 PetriNetUnfolder]: 12/72 cut-off events. [2022-12-06 04:22:11,143 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 04:22:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 72 events. 12/72 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 282 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 202. Up to 25 conditions per place. [2022-12-06 04:22:11,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 04:22:11,145 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:11,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:22:11,146 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 141 flow [2022-12-06 04:22:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:11,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:11,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:22:11,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -471435567, now seen corresponding path program 1 times [2022-12-06 04:22:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502536227] [2022-12-06 04:22:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,220 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:22:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502536227] [2022-12-06 04:22:11,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502536227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635205172] [2022-12-06 04:22:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:11,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-06 04:22:11,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-06 04:22:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,265 INFO L130 PetriNetUnfolder]: 45/123 cut-off events. [2022-12-06 04:22:11,266 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-06 04:22:11,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 123 events. 45/123 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 407 event pairs, 12 based on Foata normal form. 15/136 useless extension candidates. Maximal degree in co-relation 381. Up to 79 conditions per place. [2022-12-06 04:22:11,266 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 18 selfloop transitions, 3 changer transitions 6/33 dead transitions. [2022-12-06 04:22:11,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 223 flow [2022-12-06 04:22:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:22:11,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-06 04:22:11,268 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 141 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:22:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 223 flow [2022-12-06 04:22:11,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:22:11,271 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 130 flow [2022-12-06 04:22:11,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 04:22:11,273 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 04:22:11,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,275 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 130 flow [2022-12-06 04:22:11,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 130 flow [2022-12-06 04:22:11,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 130 flow [2022-12-06 04:22:11,283 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-06 04:22:11,283 INFO L131 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2022-12-06 04:22:11,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 57 events. 10/57 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 21 conditions per place. [2022-12-06 04:22:11,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 130 flow [2022-12-06 04:22:11,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 04:22:11,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:11,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 04:22:11,388 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 134 flow [2022-12-06 04:22:11,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:11,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:11,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:22:11,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1535136483, now seen corresponding path program 1 times [2022-12-06 04:22:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:11,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785983946] [2022-12-06 04:22:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,531 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:22:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785983946] [2022-12-06 04:22:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785983946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:22:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235403424] [2022-12-06 04:22:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:22:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:22:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:22:11,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:22:11,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 134 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:22:11,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:22:11,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,631 INFO L130 PetriNetUnfolder]: 79/200 cut-off events. [2022-12-06 04:22:11,631 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-06 04:22:11,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 200 events. 79/200 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 825 event pairs, 17 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 723. Up to 79 conditions per place. [2022-12-06 04:22:11,632 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 34 selfloop transitions, 8 changer transitions 13/55 dead transitions. [2022-12-06 04:22:11,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 389 flow [2022-12-06 04:22:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 04:22:11,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 04:22:11,634 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 134 flow. Second operand 6 states and 47 transitions. [2022-12-06 04:22:11,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 389 flow [2022-12-06 04:22:11,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 365 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:22:11,637 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 155 flow [2022-12-06 04:22:11,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-06 04:22:11,639 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-06 04:22:11,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,639 INFO L89 Accepts]: Start accepts. Operand has 38 places, 24 transitions, 155 flow [2022-12-06 04:22:11,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 155 flow [2022-12-06 04:22:11,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 155 flow [2022-12-06 04:22:11,647 INFO L130 PetriNetUnfolder]: 13/72 cut-off events. [2022-12-06 04:22:11,647 INFO L131 PetriNetUnfolder]: For 61/65 co-relation queries the response was YES. [2022-12-06 04:22:11,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 72 events. 13/72 cut-off events. For 61/65 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 264 event pairs, 4 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 192. Up to 31 conditions per place. [2022-12-06 04:22:11,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 155 flow [2022-12-06 04:22:11,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 04:22:11,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:11,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 04:22:11,775 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 154 flow [2022-12-06 04:22:11,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:22:11,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:11,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:22:11,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1536315403, now seen corresponding path program 1 times [2022-12-06 04:22:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222694029] [2022-12-06 04:22:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,888 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:22:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222694029] [2022-12-06 04:22:11,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222694029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535310825] [2022-12-06 04:22:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:22:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:22:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:22:11,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:22:11,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 154 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:22:11,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:22:11,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,934 INFO L130 PetriNetUnfolder]: 60/154 cut-off events. [2022-12-06 04:22:11,934 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-12-06 04:22:11,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 154 events. 60/154 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 581 event pairs, 24 based on Foata normal form. 4/158 useless extension candidates. Maximal degree in co-relation 561. Up to 85 conditions per place. [2022-12-06 04:22:11,935 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 20 selfloop transitions, 2 changer transitions 7/29 dead transitions. [2022-12-06 04:22:11,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 227 flow [2022-12-06 04:22:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 04:22:11,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 04:22:11,938 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 154 flow. Second operand 3 states and 25 transitions. [2022-12-06 04:22:11,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 227 flow [2022-12-06 04:22:11,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 221 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:11,940 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 109 flow [2022-12-06 04:22:11,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2022-12-06 04:22:11,941 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 04:22:11,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,941 INFO L89 Accepts]: Start accepts. Operand has 36 places, 18 transitions, 109 flow [2022-12-06 04:22:11,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 18 transitions, 109 flow [2022-12-06 04:22:11,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 18 transitions, 109 flow [2022-12-06 04:22:11,947 INFO L130 PetriNetUnfolder]: 5/32 cut-off events. [2022-12-06 04:22:11,948 INFO L131 PetriNetUnfolder]: For 31/33 co-relation queries the response was YES. [2022-12-06 04:22:11,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 32 events. 5/32 cut-off events. For 31/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 2 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 88. Up to 13 conditions per place. [2022-12-06 04:22:11,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 18 transitions, 109 flow [2022-12-06 04:22:11,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 04:22:11,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_25 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_25, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [281] L786-->L789: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-06 04:22:11,964 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:22:11,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] $Ultimate##0-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_114 1) (= v_~x$w_buff0~0_185 1) (= v_~x$r_buff1_thd2~0_87 v_~x$r_buff0_thd2~0_115) (= v_~x$r_buff0_thd0~0_114 v_~x$r_buff1_thd0~0_107) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_285 256) 0)) (not (= (mod v_~x$w_buff1_used~0_252 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= v_~y~0_122 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| 0)) (= v_~x$w_buff0_used~0_285 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= v_~x$r_buff0_thd1~0_151 v_~x$r_buff1_thd1~0_148) (= v_~y~0_122 v_~__unbuffered_p1_EAX~0_77) (= v_~x$w_buff0~0_186 v_~x$w_buff1~0_156) (= v_~x$w_buff0_used~0_286 v_~x$w_buff1_used~0_252)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_186, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_286} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_156, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_252, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_107, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_285, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_77, ~y~0=v_~y~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, ~y~0] and [372] $Ultimate##0-->L789: Formula: (and (= v_~y~0_126 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~__unbuffered_p1_EBX~0_84 v_~y~0_126)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_84, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y~0=v_~y~0_126, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:22:12,169 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:22:12,170 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:22:12,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:22:12,171 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:22:12,173 INFO L158 Benchmark]: Toolchain (without parser) took 7144.60ms. Allocated memory was 204.5MB in the beginning and 393.2MB in the end (delta: 188.7MB). Free memory was 178.0MB in the beginning and 282.7MB in the end (delta: -104.7MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,173 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 180.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:22:12,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.86ms. Allocated memory is still 204.5MB. Free memory was 178.0MB in the beginning and 152.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.74ms. Allocated memory is still 204.5MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,174 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 204.5MB. Free memory was 149.9MB in the beginning and 148.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,174 INFO L158 Benchmark]: RCFGBuilder took 624.74ms. Allocated memory is still 204.5MB. Free memory was 148.4MB in the beginning and 119.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,174 INFO L158 Benchmark]: TraceAbstraction took 5961.81ms. Allocated memory was 204.5MB in the beginning and 393.2MB in the end (delta: 188.7MB). Free memory was 118.5MB in the beginning and 282.7MB in the end (delta: -164.3MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. [2022-12-06 04:22:12,175 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.10ms. Allocated memory is still 204.5MB. Free memory is still 180.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 454.86ms. Allocated memory is still 204.5MB. Free memory was 178.0MB in the beginning and 152.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.74ms. Allocated memory is still 204.5MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 204.5MB. Free memory was 149.9MB in the beginning and 148.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 624.74ms. Allocated memory is still 204.5MB. Free memory was 148.4MB in the beginning and 119.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5961.81ms. Allocated memory was 204.5MB in the beginning and 393.2MB in the end (delta: 188.7MB). Free memory was 118.5MB in the beginning and 282.7MB in the end (delta: -164.3MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 93 PlacesBefore, 27 PlacesAfterwards, 88 TransitionsBefore, 21 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 815, independent: 766, independent conditional: 766, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 815, independent: 766, independent conditional: 0, independent unconditional: 766, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 815, independent: 766, independent conditional: 0, independent unconditional: 766, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 815, independent: 766, independent conditional: 0, independent unconditional: 766, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 679, independent: 643, independent conditional: 0, independent unconditional: 643, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 679, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 815, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 679, unknown conditional: 0, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 876, Positive conditional cache size: 0, Positive unconditional cache size: 876, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 23 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 14, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 36, unknown conditional: 5, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 21, Positive conditional cache size: 3, Positive unconditional cache size: 18, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 14, independent conditional: 11, independent unconditional: 3, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 23, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, 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, 28 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 7, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 34, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 26, Positive conditional cache size: 3, Positive unconditional cache size: 23, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 9, independent unconditional: 10, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 26, Positive conditional cache size: 3, Positive unconditional cache size: 23, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 28, Positive conditional cache size: 5, Positive unconditional cache size: 23, Negative cache size: 18, Negative conditional cache size: 2, 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.1s, 37 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 35, Positive conditional cache size: 7, Positive unconditional cache size: 28, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 17, independent conditional: 17, 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: 43, independent: 17, independent conditional: 4, independent unconditional: 13, dependent: 26, dependent conditional: 11, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 37, Positive conditional cache size: 7, Positive unconditional cache size: 30, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:22:12,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...