/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/safe017_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:02,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:02,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:02,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:02,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:02,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:02,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:02,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:02,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:02,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:02,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:02,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:02,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:02,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:02,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:02,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:02,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:02,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:02,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:02,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:02,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:02,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:02,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:02,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:02,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:02,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:02,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:02,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:02,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:02,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:02,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:02,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:02,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:02,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:02,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:02,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:02,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:02,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:02,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:02,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:02,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:02,565 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:30:02,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:02,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:02,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:02,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:02,607 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:02,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:02,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:02,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:02,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:02,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:02,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:02,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:02,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:02,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:02,611 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:30:02,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:02,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:02,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:02,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:02,915 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:02,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2022-12-06 04:30:04,015 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:04,251 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:04,252 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2022-12-06 04:30:04,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5afe69d/0f7bd3e5856c4c6296fb90d023e946c2/FLAGe16f93a05 [2022-12-06 04:30:04,289 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5afe69d/0f7bd3e5856c4c6296fb90d023e946c2 [2022-12-06 04:30:04,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:04,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:04,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:04,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:04,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:04,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d416d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04, skipping insertion in model container [2022-12-06 04:30:04,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:04,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:04,448 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/safe017_tso.i[945,958] [2022-12-06 04:30:04,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:04,588 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:04,597 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/safe017_tso.i[945,958] [2022-12-06 04:30:04,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:04,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:04,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:04,669 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:04,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04 WrapperNode [2022-12-06 04:30:04,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:04,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:04,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:04,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:04,676 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:30:04" (1/1) ... [2022-12-06 04:30:04,702 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:30:04" (1/1) ... [2022-12-06 04:30:04,719 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-12-06 04:30:04,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:04,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:04,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:04,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:04,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,746 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:04,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:04,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:04,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:04,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (1/1) ... [2022-12-06 04:30:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:04,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:04,777 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:30:04,787 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:30:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:04,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:04,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:04,814 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:30:04,956 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:04,958 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:05,099 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:30:05,105 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:30:05,105 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:30:05,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:05 BoogieIcfgContainer [2022-12-06 04:30:05,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:30:05,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:30:05,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:30:05,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:30:05,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:04" (1/3) ... [2022-12-06 04:30:05,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b05a220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:05, skipping insertion in model container [2022-12-06 04:30:05,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:04" (2/3) ... [2022-12-06 04:30:05,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b05a220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:05, skipping insertion in model container [2022-12-06 04:30:05,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:05" (3/3) ... [2022-12-06 04:30:05,122 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_tso.i [2022-12-06 04:30:05,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:30:05,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:30:05,136 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:30:05,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:30:05,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 82 transitions, 179 flow [2022-12-06 04:30:05,245 INFO L130 PetriNetUnfolder]: 2/79 cut-off events. [2022-12-06 04:30:05,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:05,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 79 events. 2/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 04:30:05,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 82 transitions, 179 flow [2022-12-06 04:30:05,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 67 transitions, 143 flow [2022-12-06 04:30:05,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:05,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 67 transitions, 143 flow [2022-12-06 04:30:05,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 143 flow [2022-12-06 04:30:05,306 INFO L130 PetriNetUnfolder]: 1/67 cut-off events. [2022-12-06 04:30:05,307 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:05,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 1/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 04:30:05,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 67 transitions, 143 flow [2022-12-06 04:30:05,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-06 04:30:07,151 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-06 04:30:07,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:30:07,166 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;@f7b6b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:30:07,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:30:07,169 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:30:07,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:07,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:07,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:07,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1452872618, now seen corresponding path program 1 times [2022-12-06 04:30:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:07,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142177745] [2022-12-06 04:30:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:07,514 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:30:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:07,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142177745] [2022-12-06 04:30:07,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142177745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:07,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:07,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344528120] [2022-12-06 04:30:07,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:07,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:07,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:30:07,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 43 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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:30:07,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:07,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:30:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:07,650 INFO L130 PetriNetUnfolder]: 408/676 cut-off events. [2022-12-06 04:30:07,650 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:30:07,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 676 events. 408/676 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2896 event pairs, 157 based on Foata normal form. 37/713 useless extension candidates. Maximal degree in co-relation 1388. Up to 382 conditions per place. [2022-12-06 04:30:07,656 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2022-12-06 04:30:07,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 131 flow [2022-12-06 04:30:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:30:07,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 04:30:07,665 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 43 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:30:07,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 131 flow [2022-12-06 04:30:07,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:30:07,670 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-12-06 04:30:07,674 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 04:30:07,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:07,675 INFO L89 Accepts]: Start accepts. Operand has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:07,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:07,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,702 INFO L130 PetriNetUnfolder]: 45/129 cut-off events. [2022-12-06 04:30:07,702 INFO L131 PetriNetUnfolder]: For 15/19 co-relation queries the response was YES. [2022-12-06 04:30:07,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 129 events. 45/129 cut-off events. For 15/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 579 event pairs, 21 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 269. Up to 62 conditions per place. [2022-12-06 04:30:07,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:30:07,721 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:07,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:30:07,723 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 84 flow [2022-12-06 04:30:07,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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:30:07,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:07,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:07,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:30:07,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2089377666, now seen corresponding path program 1 times [2022-12-06 04:30:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:07,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152859319] [2022-12-06 04:30:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:07,844 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:30:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:07,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152859319] [2022-12-06 04:30:07,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152859319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:07,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:07,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:30:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647608417] [2022-12-06 04:30:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:07,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:30:07,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 84 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:07,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:07,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:30:07,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:07,939 INFO L130 PetriNetUnfolder]: 380/633 cut-off events. [2022-12-06 04:30:07,940 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-06 04:30:07,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 633 events. 380/633 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2588 event pairs, 85 based on Foata normal form. 9/642 useless extension candidates. Maximal degree in co-relation 1751. Up to 264 conditions per place. [2022-12-06 04:30:07,944 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 26 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2022-12-06 04:30:07,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 190 flow [2022-12-06 04:30:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 04:30:07,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-06 04:30:07,945 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 84 flow. Second operand 4 states and 31 transitions. [2022-12-06 04:30:07,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 190 flow [2022-12-06 04:30:07,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:07,950 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 04:30:07,950 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 04:30:07,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:07,951 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:07,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:07,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,963 INFO L130 PetriNetUnfolder]: 36/110 cut-off events. [2022-12-06 04:30:07,963 INFO L131 PetriNetUnfolder]: For 71/82 co-relation queries the response was YES. [2022-12-06 04:30:07,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 110 events. 36/110 cut-off events. For 71/82 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 457 event pairs, 7 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 283. Up to 49 conditions per place. [2022-12-06 04:30:07,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 04:30:07,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:07,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 04:30:07,974 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 120 flow [2022-12-06 04:30:07,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:07,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:07,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:30:07,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2089377015, now seen corresponding path program 1 times [2022-12-06 04:30:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:07,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211424514] [2022-12-06 04:30:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:08,062 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:30:08,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:08,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211424514] [2022-12-06 04:30:08,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211424514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:08,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:08,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:30:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549753633] [2022-12-06 04:30:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:08,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:30:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:30:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:30:08,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 04:30:08,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:08,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 04:30:08,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:08,171 INFO L130 PetriNetUnfolder]: 327/567 cut-off events. [2022-12-06 04:30:08,172 INFO L131 PetriNetUnfolder]: For 528/532 co-relation queries the response was YES. [2022-12-06 04:30:08,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 567 events. 327/567 cut-off events. For 528/532 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2394 event pairs, 142 based on Foata normal form. 3/570 useless extension candidates. Maximal degree in co-relation 1680. Up to 496 conditions per place. [2022-12-06 04:30:08,181 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-06 04:30:08,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 240 flow [2022-12-06 04:30:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:30:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:30:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 04:30:08,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:30:08,182 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 120 flow. Second operand 3 states and 29 transitions. [2022-12-06 04:30:08,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 240 flow [2022-12-06 04:30:08,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:08,186 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 04:30:08,187 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-06 04:30:08,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:08,187 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:08,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:08,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,196 INFO L130 PetriNetUnfolder]: 30/98 cut-off events. [2022-12-06 04:30:08,196 INFO L131 PetriNetUnfolder]: For 73/80 co-relation queries the response was YES. [2022-12-06 04:30:08,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 98 events. 30/98 cut-off events. For 73/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 385 event pairs, 4 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 279. Up to 41 conditions per place. [2022-12-06 04:30:08,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:30:08,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:08,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:30:08,203 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 147 flow [2022-12-06 04:30:08,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:08,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:08,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:30:08,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 346197023, now seen corresponding path program 1 times [2022-12-06 04:30:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:08,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383491210] [2022-12-06 04:30:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:08,306 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:30:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:08,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383491210] [2022-12-06 04:30:08,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383491210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:08,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:08,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:30:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739758415] [2022-12-06 04:30:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:08,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:08,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 04:30:08,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:30:08,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:08,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 04:30:08,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:08,397 INFO L130 PetriNetUnfolder]: 405/720 cut-off events. [2022-12-06 04:30:08,397 INFO L131 PetriNetUnfolder]: For 778/778 co-relation queries the response was YES. [2022-12-06 04:30:08,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 720 events. 405/720 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3488 event pairs, 101 based on Foata normal form. 25/733 useless extension candidates. Maximal degree in co-relation 2212. Up to 356 conditions per place. [2022-12-06 04:30:08,400 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 28 selfloop transitions, 6 changer transitions 14/51 dead transitions. [2022-12-06 04:30:08,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 367 flow [2022-12-06 04:30:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 04:30:08,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-06 04:30:08,404 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 147 flow. Second operand 4 states and 38 transitions. [2022-12-06 04:30:08,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 367 flow [2022-12-06 04:30:08,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:08,407 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-06 04:30:08,409 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 04:30:08,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:08,409 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:08,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:08,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,416 INFO L130 PetriNetUnfolder]: 12/60 cut-off events. [2022-12-06 04:30:08,416 INFO L131 PetriNetUnfolder]: For 96/115 co-relation queries the response was YES. [2022-12-06 04:30:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 60 events. 12/60 cut-off events. For 96/115 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 201. Up to 22 conditions per place. [2022-12-06 04:30:08,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:30:08,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:08,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:30:08,423 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 190 flow [2022-12-06 04:30:08,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:30:08,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:08,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:08,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:30:08,424 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 286652015, now seen corresponding path program 1 times [2022-12-06 04:30:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:08,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503929027] [2022-12-06 04:30:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:08,505 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:30:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503929027] [2022-12-06 04:30:08,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503929027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:08,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812774123] [2022-12-06 04:30:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:08,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:08,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:30:08,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 190 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:08,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:30:08,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:08,577 INFO L130 PetriNetUnfolder]: 308/539 cut-off events. [2022-12-06 04:30:08,577 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2022-12-06 04:30:08,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 539 events. 308/539 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2253 event pairs, 59 based on Foata normal form. 6/545 useless extension candidates. Maximal degree in co-relation 1794. Up to 227 conditions per place. [2022-12-06 04:30:08,580 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 12 changer transitions 1/45 dead transitions. [2022-12-06 04:30:08,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 330 flow [2022-12-06 04:30:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:30:08,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.609375 [2022-12-06 04:30:08,582 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 190 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:30:08,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 330 flow [2022-12-06 04:30:08,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 318 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:08,585 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 04:30:08,589 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2022-12-06 04:30:08,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:08,589 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:08,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:08,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,606 INFO L130 PetriNetUnfolder]: 7/54 cut-off events. [2022-12-06 04:30:08,606 INFO L131 PetriNetUnfolder]: For 139/152 co-relation queries the response was YES. [2022-12-06 04:30:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 54 events. 7/54 cut-off events. For 139/152 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 195. Up to 18 conditions per place. [2022-12-06 04:30:08,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:30:08,611 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:08,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 04:30:08,611 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 225 flow [2022-12-06 04:30:08,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:08,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:08,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:30:08,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2142186353, now seen corresponding path program 1 times [2022-12-06 04:30:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:08,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455570054] [2022-12-06 04:30:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:08,716 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:30:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:08,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455570054] [2022-12-06 04:30:08,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455570054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:08,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:08,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:30:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780191870] [2022-12-06 04:30:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:08,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:08,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:08,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 04:30:08,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:30:08,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:08,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 04:30:08,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:08,784 INFO L130 PetriNetUnfolder]: 205/413 cut-off events. [2022-12-06 04:30:08,784 INFO L131 PetriNetUnfolder]: For 1435/1468 co-relation queries the response was YES. [2022-12-06 04:30:08,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 413 events. 205/413 cut-off events. For 1435/1468 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1990 event pairs, 53 based on Foata normal form. 29/437 useless extension candidates. Maximal degree in co-relation 1363. Up to 246 conditions per place. [2022-12-06 04:30:08,786 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 31 selfloop transitions, 4 changer transitions 24/66 dead transitions. [2022-12-06 04:30:08,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 612 flow [2022-12-06 04:30:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:30:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:30:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 04:30:08,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-06 04:30:08,788 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 225 flow. Second operand 5 states and 49 transitions. [2022-12-06 04:30:08,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 612 flow [2022-12-06 04:30:08,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 565 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 04:30:08,794 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 244 flow [2022-12-06 04:30:08,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2022-12-06 04:30:08,796 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-12-06 04:30:08,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:08,796 INFO L89 Accepts]: Start accepts. Operand has 46 places, 31 transitions, 244 flow [2022-12-06 04:30:08,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:08,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:08,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 31 transitions, 244 flow [2022-12-06 04:30:08,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 244 flow [2022-12-06 04:30:08,811 INFO L130 PetriNetUnfolder]: 73/176 cut-off events. [2022-12-06 04:30:08,811 INFO L131 PetriNetUnfolder]: For 490/517 co-relation queries the response was YES. [2022-12-06 04:30:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 176 events. 73/176 cut-off events. For 490/517 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 821 event pairs, 29 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 623. Up to 125 conditions per place. [2022-12-06 04:30:08,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 244 flow [2022-12-06 04:30:08,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:30:08,813 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:08,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:30:08,814 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 244 flow [2022-12-06 04:30:08,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:30:08,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:08,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:08,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:30:08,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 939828847, now seen corresponding path program 1 times [2022-12-06 04:30:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:08,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620218604] [2022-12-06 04:30:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:08,906 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:30:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620218604] [2022-12-06 04:30:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620218604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:08,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762489303] [2022-12-06 04:30:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:30:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:08,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:30:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:30:08,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 04:30:08,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:08,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 04:30:08,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:08,977 INFO L130 PetriNetUnfolder]: 131/284 cut-off events. [2022-12-06 04:30:08,977 INFO L131 PetriNetUnfolder]: For 1118/1167 co-relation queries the response was YES. [2022-12-06 04:30:08,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 284 events. 131/284 cut-off events. For 1118/1167 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1252 event pairs, 14 based on Foata normal form. 33/314 useless extension candidates. Maximal degree in co-relation 1208. Up to 171 conditions per place. [2022-12-06 04:30:08,978 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 33 selfloop transitions, 7 changer transitions 22/67 dead transitions. [2022-12-06 04:30:08,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 614 flow [2022-12-06 04:30:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:30:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:30:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 04:30:08,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-06 04:30:08,981 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 244 flow. Second operand 6 states and 59 transitions. [2022-12-06 04:30:08,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 614 flow [2022-12-06 04:30:08,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 608 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:30:08,984 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 270 flow [2022-12-06 04:30:08,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-06 04:30:08,985 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2022-12-06 04:30:08,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:08,985 INFO L89 Accepts]: Start accepts. Operand has 50 places, 30 transitions, 270 flow [2022-12-06 04:30:08,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:08,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:08,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 30 transitions, 270 flow [2022-12-06 04:30:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 270 flow [2022-12-06 04:30:08,996 INFO L130 PetriNetUnfolder]: 28/89 cut-off events. [2022-12-06 04:30:08,996 INFO L131 PetriNetUnfolder]: For 375/420 co-relation queries the response was YES. [2022-12-06 04:30:08,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 89 events. 28/89 cut-off events. For 375/420 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 331 event pairs, 4 based on Foata normal form. 5/91 useless extension candidates. Maximal degree in co-relation 411. Up to 62 conditions per place. [2022-12-06 04:30:08,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 270 flow [2022-12-06 04:30:08,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 04:30:08,998 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:08,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:30:08,999 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 270 flow [2022-12-06 04:30:08,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:08,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:08,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:30:08,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash -228022449, now seen corresponding path program 1 times [2022-12-06 04:30:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709745198] [2022-12-06 04:30:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:09,095 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:30:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:09,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709745198] [2022-12-06 04:30:09,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709745198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:09,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:09,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:30:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472807199] [2022-12-06 04:30:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:09,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:30:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:30:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:30:09,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 04:30:09,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:09,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:09,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 04:30:09,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:09,185 INFO L130 PetriNetUnfolder]: 65/158 cut-off events. [2022-12-06 04:30:09,185 INFO L131 PetriNetUnfolder]: For 778/810 co-relation queries the response was YES. [2022-12-06 04:30:09,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 158 events. 65/158 cut-off events. For 778/810 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 575 event pairs, 8 based on Foata normal form. 23/179 useless extension candidates. Maximal degree in co-relation 783. Up to 89 conditions per place. [2022-12-06 04:30:09,186 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 17 selfloop transitions, 10 changer transitions 23/52 dead transitions. [2022-12-06 04:30:09,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 527 flow [2022-12-06 04:30:09,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:30:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:30:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 04:30:09,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2022-12-06 04:30:09,188 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 270 flow. Second operand 7 states and 55 transitions. [2022-12-06 04:30:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 527 flow [2022-12-06 04:30:09,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 491 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 04:30:09,191 INFO L231 Difference]: Finished difference. Result has 53 places, 22 transitions, 188 flow [2022-12-06 04:30:09,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=53, PETRI_TRANSITIONS=22} [2022-12-06 04:30:09,193 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2022-12-06 04:30:09,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:30:09,193 INFO L89 Accepts]: Start accepts. Operand has 53 places, 22 transitions, 188 flow [2022-12-06 04:30:09,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:30:09,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:09,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 22 transitions, 188 flow [2022-12-06 04:30:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 22 transitions, 188 flow [2022-12-06 04:30:09,198 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-06 04:30:09,198 INFO L131 PetriNetUnfolder]: For 75/79 co-relation queries the response was YES. [2022-12-06 04:30:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 25 events. 5/25 cut-off events. For 75/79 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 97. Up to 11 conditions per place. [2022-12-06 04:30:09,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 22 transitions, 188 flow [2022-12-06 04:30:09,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 04:30:09,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [183] L749-->L752: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [212] $Ultimate##0-->L737: Formula: (and (= v_~x~0_20 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-06 04:30:09,685 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:30:09,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 494 [2022-12-06 04:30:09,687 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 17 transitions, 210 flow [2022-12-06 04:30:09,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:09,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:09,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:09,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:30:09,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:30:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 346710582, now seen corresponding path program 1 times [2022-12-06 04:30:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:09,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430226990] [2022-12-06 04:30:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:30:09,789 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:30:09,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:30:09,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430226990] [2022-12-06 04:30:09,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430226990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:30:09,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:30:09,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:30:09,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107338781] [2022-12-06 04:30:09,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:30:09,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:30:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:30:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:30:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:30:09,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:30:09,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 17 transitions, 210 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:09,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:30:09,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:30:09,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:30:09,818 INFO L130 PetriNetUnfolder]: 10/30 cut-off events. [2022-12-06 04:30:09,819 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2022-12-06 04:30:09,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 30 events. 10/30 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 201. Up to 18 conditions per place. [2022-12-06 04:30:09,819 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2022-12-06 04:30:09,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 18 transitions, 200 flow [2022-12-06 04:30:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:30:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:30:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-12-06 04:30:09,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-06 04:30:09,820 INFO L175 Difference]: Start difference. First operand has 46 places, 17 transitions, 210 flow. Second operand 4 states and 17 transitions. [2022-12-06 04:30:09,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 18 transitions, 200 flow [2022-12-06 04:30:09,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 99 flow, removed 16 selfloop flow, removed 22 redundant places. [2022-12-06 04:30:09,821 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2022-12-06 04:30:09,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2022-12-06 04:30:09,822 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2022-12-06 04:30:09,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:09,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 0 transitions, 0 flow [2022-12-06 04:30:09,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:30:09,823 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:30:09,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:09,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 04:30:09,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:30:09,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:30:09,824 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:30:09,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 04:30:09,824 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:30:09,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:09,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:30:09,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:30:09,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:30:09,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:30:09,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:30:09,828 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:09,831 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:30:09,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:30:09,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:30:09 BasicIcfg [2022-12-06 04:30:09,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:30:09,834 INFO L158 Benchmark]: Toolchain (without parser) took 5542.10ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 171.2MB in the beginning and 198.2MB in the end (delta: -27.0MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,835 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:30:09,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.49ms. Allocated memory is still 196.1MB. Free memory was 171.2MB in the beginning and 148.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.77ms. Allocated memory is still 196.1MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,836 INFO L158 Benchmark]: Boogie Preprocessor took 28.25ms. Allocated memory is still 196.1MB. Free memory was 146.2MB in the beginning and 144.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,836 INFO L158 Benchmark]: RCFGBuilder took 357.46ms. Allocated memory is still 196.1MB. Free memory was 144.6MB in the beginning and 131.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,836 INFO L158 Benchmark]: TraceAbstraction took 4726.09ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 130.4MB in the beginning and 198.2MB in the end (delta: -67.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:30:09,837 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 376.49ms. Allocated memory is still 196.1MB. Free memory was 171.2MB in the beginning and 148.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.77ms. Allocated memory is still 196.1MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.25ms. Allocated memory is still 196.1MB. Free memory was 146.2MB in the beginning and 144.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 357.46ms. Allocated memory is still 196.1MB. Free memory was 144.6MB in the beginning and 131.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4726.09ms. Allocated memory was 196.1MB in the beginning and 302.0MB in the end (delta: 105.9MB). Free memory was 130.4MB in the beginning and 198.2MB in the end (delta: -67.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 76 PlacesBefore, 26 PlacesAfterwards, 67 TransitionsBefore, 17 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 654, independent: 621, independent conditional: 621, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 654, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 654, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 654, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 562, independent conditional: 0, independent unconditional: 562, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 550, independent conditional: 0, independent unconditional: 550, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 654, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 857, Positive cache size: 835, Positive conditional cache size: 0, Positive unconditional cache size: 835, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 1, independent unconditional: 9, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 12, unknown conditional: 1, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 1, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 5, independent unconditional: 16, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 1, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 41, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 53, independent conditional: 53, 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: 63, independent: 53, independent conditional: 7, independent unconditional: 46, 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: 63, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 63, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 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: 63, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 59, independent conditional: 59, 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: 70, independent: 59, independent conditional: 21, independent unconditional: 38, 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: 70, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 70, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 70, independent: 59, independent conditional: 0, independent unconditional: 59, 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): 26, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 46 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 7, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 7, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 16, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 35, Positive conditional cache size: 2, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 35, Positive conditional cache size: 2, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 104 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 13 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 04:30:09,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...