/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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:59:02,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:59:02,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:59:02,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:59:02,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:59:02,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:59:02,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:59:02,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:59:02,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:59:02,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:59:02,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:59:02,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:59:02,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:59:02,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:59:02,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:59:02,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:59:02,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:59:02,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:59:02,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:59:02,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:59:02,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:59:02,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:59:02,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:59:02,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:59:02,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:59:02,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:59:02,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:59:02,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:59:02,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:59:02,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:59:02,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:59:02,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:59:02,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:59:02,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:59:02,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:59:02,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:59:02,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:59:02,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:59:02,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:59:02,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:59:02,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:59:02,782 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:59:02,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:59:02,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:59:02,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:59:02,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:59:02,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:59:02,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:59:02,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:59:02,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:59:02,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:59:02,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:59:02,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:59:02,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:59:02,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:59:02,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:02,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:59:02,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:59:02,813 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:59:03,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:59:03,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:59:03,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:59:03,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:59:03,191 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:59:03,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 04:59:04,326 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:59:04,573 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:59:04,574 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 04:59:04,604 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2236a9e42/647332d9b3e54264b3515783628909a5/FLAGeff14c13b [2022-12-06 04:59:04,618 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2236a9e42/647332d9b3e54264b3515783628909a5 [2022-12-06 04:59:04,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:59:04,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:59:04,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:04,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:59:04,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:59:04,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:04,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f26df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04, skipping insertion in model container [2022-12-06 04:59:04,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:04,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:59:04,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:59:04,770 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2022-12-06 04:59:04,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:04,905 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:59:04,915 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2022-12-06 04:59:04,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:04,959 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:59:04,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04 WrapperNode [2022-12-06 04:59:04,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:04,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:04,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:59:04,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:59:04,967 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:59:04" (1/1) ... [2022-12-06 04:59:04,983 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:59:04" (1/1) ... [2022-12-06 04:59:05,003 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2022-12-06 04:59:05,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:05,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:59:05,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:59:05,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:59:05,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,024 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:59:05,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:59:05,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:59:05,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:59:05,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (1/1) ... [2022-12-06 04:59:05,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:05,049 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:59:05,077 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:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-12-06 04:59:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-12-06 04:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:59:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:59:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:59:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:59:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:59:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:59:05,094 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:59:05,203 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:59:05,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:59:05,432 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:59:05,439 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:59:05,439 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 04:59:05,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:05 BoogieIcfgContainer [2022-12-06 04:59:05,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:59:05,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:59:05,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:59:05,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:59:05,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:04" (1/3) ... [2022-12-06 04:59:05,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508e5a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:05, skipping insertion in model container [2022-12-06 04:59:05,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:04" (2/3) ... [2022-12-06 04:59:05,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508e5a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:05, skipping insertion in model container [2022-12-06 04:59:05,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:05" (3/3) ... [2022-12-06 04:59:05,450 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 04:59:05,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:59:05,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:59:05,474 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:59:05,606 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:59:05,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions, 261 flow [2022-12-06 04:59:05,705 INFO L130 PetriNetUnfolder]: 10/127 cut-off events. [2022-12-06 04:59:05,705 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:05,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 04:59:05,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 128 transitions, 261 flow [2022-12-06 04:59:05,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 127 transitions, 257 flow [2022-12-06 04:59:05,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:05,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 127 transitions, 257 flow [2022-12-06 04:59:05,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 257 flow [2022-12-06 04:59:05,766 INFO L130 PetriNetUnfolder]: 10/127 cut-off events. [2022-12-06 04:59:05,766 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:05,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 04:59:05,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 127 transitions, 257 flow [2022-12-06 04:59:05,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 3920 [2022-12-06 04:59:09,618 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 04:59:09,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:59:09,640 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;@71cb798e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:59:09,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:59:09,643 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 04:59:09,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:09,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:09,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:59:09,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1915721193, now seen corresponding path program 1 times [2022-12-06 04:59:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:09,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206537027] [2022-12-06 04:59:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:10,295 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:59:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:10,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206537027] [2022-12-06 04:59:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206537027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:10,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:10,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877086371] [2022-12-06 04:59:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:10,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:10,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:59:10,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:59:10,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:10,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:59:10,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:10,475 INFO L130 PetriNetUnfolder]: 216/379 cut-off events. [2022-12-06 04:59:10,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:10,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 379 events. 216/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1355 event pairs, 7 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 753. Up to 224 conditions per place. [2022-12-06 04:59:10,479 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2022-12-06 04:59:10,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 54 transitions, 217 flow [2022-12-06 04:59:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 04:59:10,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 04:59:10,491 INFO L175 Difference]: Start difference. First operand has 24 places, 26 transitions, 55 flow. Second operand 4 states and 63 transitions. [2022-12-06 04:59:10,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 54 transitions, 217 flow [2022-12-06 04:59:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 54 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:10,496 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=4, PETRI_FLOW=82, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2022-12-06 04:59:10,500 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2022-12-06 04:59:10,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:10,501 INFO L89 Accepts]: Start accepts. Operand has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:10,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:10,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,522 INFO L130 PetriNetUnfolder]: 13/59 cut-off events. [2022-12-06 04:59:10,523 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:59:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 59 events. 13/59 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 151 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 76. Up to 8 conditions per place. [2022-12-06 04:59:10,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 04:59:10,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:10,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 04:59:10,622 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 82 flow [2022-12-06 04:59:10,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:59:10,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:10,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:59:10,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:59:10,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1915721202, now seen corresponding path program 1 times [2022-12-06 04:59:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403269630] [2022-12-06 04:59:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:10,703 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:59:10,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403269630] [2022-12-06 04:59:10,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403269630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:10,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:10,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864080915] [2022-12-06 04:59:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:10,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:59:10,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:59:10,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:10,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:10,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:59:10,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:10,787 INFO L130 PetriNetUnfolder]: 230/391 cut-off events. [2022-12-06 04:59:10,787 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-06 04:59:10,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 391 events. 230/391 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1446 event pairs, 94 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 890. Up to 355 conditions per place. [2022-12-06 04:59:10,790 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 35 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-12-06 04:59:10,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 199 flow [2022-12-06 04:59:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:59:10,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:59:10,792 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 82 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:59:10,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 199 flow [2022-12-06 04:59:10,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:59:10,794 INFO L231 Difference]: Finished difference. Result has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=30, PETRI_TRANSITIONS=33} [2022-12-06 04:59:10,795 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2022-12-06 04:59:10,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:10,795 INFO L89 Accepts]: Start accepts. Operand has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:10,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:10,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,803 INFO L130 PetriNetUnfolder]: 28/85 cut-off events. [2022-12-06 04:59:10,803 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:59:10,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 85 events. 28/85 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 264 event pairs, 1 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 155. Up to 27 conditions per place. [2022-12-06 04:59:10,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 04:59:10,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:10,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 04:59:10,901 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 33 transitions, 129 flow [2022-12-06 04:59:10,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:10,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:10,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:10,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:59:10,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash -387912173, now seen corresponding path program 1 times [2022-12-06 04:59:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473694776] [2022-12-06 04:59:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:11,157 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:59:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473694776] [2022-12-06 04:59:11,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473694776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:11,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406801419] [2022-12-06 04:59:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:11,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:59:11,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 33 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:11,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:11,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:59:11,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:11,251 INFO L130 PetriNetUnfolder]: 324/571 cut-off events. [2022-12-06 04:59:11,251 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-12-06 04:59:11,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 571 events. 324/571 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2579 event pairs, 15 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 1483. Up to 341 conditions per place. [2022-12-06 04:59:11,255 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2022-12-06 04:59:11,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 58 transitions, 340 flow [2022-12-06 04:59:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:59:11,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-06 04:59:11,257 INFO L175 Difference]: Start difference. First operand has 30 places, 33 transitions, 129 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:59:11,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 58 transitions, 340 flow [2022-12-06 04:59:11,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 324 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:11,262 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-06 04:59:11,263 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2022-12-06 04:59:11,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:11,263 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:11,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:11,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,277 INFO L130 PetriNetUnfolder]: 85/219 cut-off events. [2022-12-06 04:59:11,278 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-06 04:59:11,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 219 events. 85/219 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 911 event pairs, 5 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 442. Up to 74 conditions per place. [2022-12-06 04:59:11,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 04:59:11,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:11,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 04:59:11,286 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 159 flow [2022-12-06 04:59:11,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:11,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:11,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:11,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:59:11,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1617144723, now seen corresponding path program 2 times [2022-12-06 04:59:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717099491] [2022-12-06 04:59:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:11,455 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:59:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:11,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717099491] [2022-12-06 04:59:11,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717099491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:11,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:11,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699468330] [2022-12-06 04:59:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:11,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:11,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:59:11,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:11,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:11,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:59:11,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:11,513 INFO L130 PetriNetUnfolder]: 79/176 cut-off events. [2022-12-06 04:59:11,513 INFO L131 PetriNetUnfolder]: For 176/178 co-relation queries the response was YES. [2022-12-06 04:59:11,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 176 events. 79/176 cut-off events. For 176/178 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 620 event pairs, 34 based on Foata normal form. 18/168 useless extension candidates. Maximal degree in co-relation 479. Up to 148 conditions per place. [2022-12-06 04:59:11,515 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 21 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2022-12-06 04:59:11,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 160 flow [2022-12-06 04:59:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 04:59:11,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 04:59:11,516 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 159 flow. Second operand 4 states and 30 transitions. [2022-12-06 04:59:11,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 160 flow [2022-12-06 04:59:11,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 136 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:11,518 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 101 flow [2022-12-06 04:59:11,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2022-12-06 04:59:11,518 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2022-12-06 04:59:11,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:11,519 INFO L89 Accepts]: Start accepts. Operand has 31 places, 27 transitions, 101 flow [2022-12-06 04:59:11,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:11,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:11,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 27 transitions, 101 flow [2022-12-06 04:59:11,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 101 flow [2022-12-06 04:59:11,547 INFO L130 PetriNetUnfolder]: 27/100 cut-off events. [2022-12-06 04:59:11,547 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-06 04:59:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 100 events. 27/100 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 1 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 175. Up to 19 conditions per place. [2022-12-06 04:59:11,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 27 transitions, 101 flow [2022-12-06 04:59:11,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 04:59:12,467 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 04:59:12,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 950 [2022-12-06 04:59:12,468 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 103 flow [2022-12-06 04:59:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:12,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:12,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:12,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:59:12,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:12,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1521018724, now seen corresponding path program 1 times [2022-12-06 04:59:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:12,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145889748] [2022-12-06 04:59:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:12,652 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:59:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145889748] [2022-12-06 04:59:12,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145889748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:12,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:12,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:59:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528390555] [2022-12-06 04:59:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:12,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:12,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:59:12,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:12,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:12,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:59:12,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:12,763 INFO L130 PetriNetUnfolder]: 76/141 cut-off events. [2022-12-06 04:59:12,763 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 04:59:12,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 141 events. 76/141 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 426 event pairs, 17 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 448. Up to 63 conditions per place. [2022-12-06 04:59:12,764 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 31 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2022-12-06 04:59:12,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 41 transitions, 270 flow [2022-12-06 04:59:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 04:59:12,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 04:59:12,766 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 103 flow. Second operand 5 states and 48 transitions. [2022-12-06 04:59:12,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 41 transitions, 270 flow [2022-12-06 04:59:12,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:12,771 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 169 flow [2022-12-06 04:59:12,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2022-12-06 04:59:12,773 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2022-12-06 04:59:12,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:12,773 INFO L89 Accepts]: Start accepts. Operand has 29 places, 26 transitions, 169 flow [2022-12-06 04:59:12,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:12,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:12,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 26 transitions, 169 flow [2022-12-06 04:59:12,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 169 flow [2022-12-06 04:59:12,811 INFO L130 PetriNetUnfolder]: 26/66 cut-off events. [2022-12-06 04:59:12,811 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 04:59:12,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 66 events. 26/66 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 195. Up to 26 conditions per place. [2022-12-06 04:59:12,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 26 transitions, 169 flow [2022-12-06 04:59:12,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 04:59:13,104 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:59:13,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-06 04:59:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 184 flow [2022-12-06 04:59:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:13,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:13,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:13,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:59:13,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -741327105, now seen corresponding path program 1 times [2022-12-06 04:59:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:13,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233645069] [2022-12-06 04:59:13,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:13,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:13,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233645069] [2022-12-06 04:59:13,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233645069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:13,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:13,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983917565] [2022-12-06 04:59:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:13,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:13,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:59:13,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 2.5) 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:59:13,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:13,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:59:13,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:13,314 INFO L130 PetriNetUnfolder]: 48/99 cut-off events. [2022-12-06 04:59:13,314 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-06 04:59:13,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 99 events. 48/99 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 287 event pairs, 8 based on Foata normal form. 8/84 useless extension candidates. Maximal degree in co-relation 397. Up to 72 conditions per place. [2022-12-06 04:59:13,314 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 16 selfloop transitions, 2 changer transitions 13/32 dead transitions. [2022-12-06 04:59:13,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 232 flow [2022-12-06 04:59:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 04:59:13,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3391304347826087 [2022-12-06 04:59:13,315 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 184 flow. Second operand 5 states and 39 transitions. [2022-12-06 04:59:13,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 232 flow [2022-12-06 04:59:13,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 216 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:13,317 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 117 flow [2022-12-06 04:59:13,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-06 04:59:13,317 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2022-12-06 04:59:13,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:13,317 INFO L89 Accepts]: Start accepts. Operand has 33 places, 19 transitions, 117 flow [2022-12-06 04:59:13,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:13,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:13,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 117 flow [2022-12-06 04:59:13,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 117 flow [2022-12-06 04:59:13,322 INFO L130 PetriNetUnfolder]: 15/48 cut-off events. [2022-12-06 04:59:13,322 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 04:59:13,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 48 events. 15/48 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 132. Up to 19 conditions per place. [2022-12-06 04:59:13,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 117 flow [2022-12-06 04:59:13,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 04:59:13,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:13,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 04:59:13,637 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 129 flow [2022-12-06 04:59:13,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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:59:13,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:13,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:13,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:59:13,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1070279128, now seen corresponding path program 1 times [2022-12-06 04:59:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:13,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319790129] [2022-12-06 04:59:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:13,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319790129] [2022-12-06 04:59:13,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319790129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:13,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:13,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410301298] [2022-12-06 04:59:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:59:13,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 04:59:13,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:13,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:13,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 04:59:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:13,765 INFO L130 PetriNetUnfolder]: 31/71 cut-off events. [2022-12-06 04:59:13,765 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2022-12-06 04:59:13,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 71 events. 31/71 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 178 event pairs, 4 based on Foata normal form. 12/64 useless extension candidates. Maximal degree in co-relation 351. Up to 45 conditions per place. [2022-12-06 04:59:13,765 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 16 selfloop transitions, 5 changer transitions 3/25 dead transitions. [2022-12-06 04:59:13,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 205 flow [2022-12-06 04:59:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 04:59:13,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:59:13,767 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 129 flow. Second operand 3 states and 28 transitions. [2022-12-06 04:59:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 205 flow [2022-12-06 04:59:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 183 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:13,768 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 148 flow [2022-12-06 04:59:13,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-06 04:59:13,769 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2022-12-06 04:59:13,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:13,769 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 148 flow [2022-12-06 04:59:13,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:13,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:13,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 148 flow [2022-12-06 04:59:13,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 148 flow [2022-12-06 04:59:13,775 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-06 04:59:13,775 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 04:59:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 53 events. 17/53 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 132 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 170. Up to 23 conditions per place. [2022-12-06 04:59:13,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 148 flow [2022-12-06 04:59:13,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:59:13,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:13,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 04:59:13,841 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 151 flow [2022-12-06 04:59:13,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:13,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:13,842 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:59:13,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 04:59:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1134100447, now seen corresponding path program 1 times [2022-12-06 04:59:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264628175] [2022-12-06 04:59:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:13,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264628175] [2022-12-06 04:59:13,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264628175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:13,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:13,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:59:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039619983] [2022-12-06 04:59:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:13,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:13,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 04:59:13,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:13,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:13,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 04:59:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:14,054 INFO L130 PetriNetUnfolder]: 25/61 cut-off events. [2022-12-06 04:59:14,054 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2022-12-06 04:59:14,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 61 events. 25/61 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 148 event pairs, 0 based on Foata normal form. 8/59 useless extension candidates. Maximal degree in co-relation 272. Up to 35 conditions per place. [2022-12-06 04:59:14,054 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 0 selfloop transitions, 0 changer transitions 22/22 dead transitions. [2022-12-06 04:59:14,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 191 flow [2022-12-06 04:59:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 04:59:14,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 04:59:14,056 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 151 flow. Second operand 6 states and 27 transitions. [2022-12-06 04:59:14,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 191 flow [2022-12-06 04:59:14,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 155 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 04:59:14,056 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2022-12-06 04:59:14,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2022-12-06 04:59:14,058 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2022-12-06 04:59:14,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:14,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 0 transitions, 0 flow [2022-12-06 04:59:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:59:14,058 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:59:14,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:14,058 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:59:14,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:59:14,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:59:14,059 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:14,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 04:59:14,060 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:59:14,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:14,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-12-06 04:59:14,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 04:59:14,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-06 04:59:14,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-06 04:59:14,063 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 04:59:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:59:14,063 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:14,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:59:14,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:59:14,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:59:14 BasicIcfg [2022-12-06 04:59:14,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:59:14,070 INFO L158 Benchmark]: Toolchain (without parser) took 9449.37ms. Allocated memory was 177.2MB in the beginning and 285.2MB in the end (delta: 108.0MB). Free memory was 152.9MB in the beginning and 164.9MB in the end (delta: -12.0MB). Peak memory consumption was 96.9MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,070 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:59:14,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.38ms. Allocated memory is still 177.2MB. Free memory was 152.8MB in the beginning and 133.1MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 177.2MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,070 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 177.2MB. Free memory was 131.0MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,071 INFO L158 Benchmark]: RCFGBuilder took 414.77ms. Allocated memory is still 177.2MB. Free memory was 129.0MB in the beginning and 113.6MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,071 INFO L158 Benchmark]: TraceAbstraction took 8626.50ms. Allocated memory was 177.2MB in the beginning and 285.2MB in the end (delta: 108.0MB). Free memory was 112.9MB in the beginning and 164.9MB in the end (delta: -52.0MB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. [2022-12-06 04:59:14,072 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.13ms. Allocated memory is still 177.2MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 337.38ms. Allocated memory is still 177.2MB. Free memory was 152.8MB in the beginning and 133.1MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 177.2MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 177.2MB. Free memory was 131.0MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.77ms. Allocated memory is still 177.2MB. Free memory was 129.0MB in the beginning and 113.6MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8626.50ms. Allocated memory was 177.2MB in the beginning and 285.2MB in the end (delta: 108.0MB). Free memory was 112.9MB in the beginning and 164.9MB in the end (delta: -52.0MB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 121 PlacesBefore, 24 PlacesAfterwards, 127 TransitionsBefore, 26 TransitionsAfterwards, 3920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 65 ConcurrentYvCompositions, 4 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 2505, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2274, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2274, independent: 2237, independent conditional: 0, independent unconditional: 2237, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2563, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2274, unknown conditional: 0, unknown unconditional: 2274] , Statistics on independence cache: Total cache size (in pairs): 4035, Positive cache size: 4000, Positive conditional cache size: 0, Positive unconditional cache size: 4000, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 27 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 191, independent conditional: 27, independent unconditional: 164, dependent: 57, dependent conditional: 39, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, independent: 191, independent conditional: 27, independent unconditional: 164, dependent: 57, dependent conditional: 39, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, independent: 191, independent conditional: 27, independent unconditional: 164, dependent: 57, dependent conditional: 39, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 99, independent: 79, independent conditional: 9, independent unconditional: 70, dependent: 20, dependent conditional: 13, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 99, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 20, dependent conditional: 13, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 14, independent conditional: 9, independent unconditional: 5, dependent: 38, dependent conditional: 22, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, independent: 112, independent conditional: 18, independent unconditional: 94, dependent: 37, dependent conditional: 26, dependent unconditional: 11, unknown: 99, unknown conditional: 22, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 79, Positive conditional cache size: 9, Positive unconditional cache size: 70, Negative cache size: 20, Negative conditional cache size: 13, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 150, independent conditional: 23, independent unconditional: 127, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 150, independent conditional: 23, independent unconditional: 127, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 150, independent conditional: 23, independent unconditional: 127, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 6, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 119, independent conditional: 17, independent unconditional: 102, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 35, unknown conditional: 6, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 124, Positive conditional cache size: 15, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 13, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 129, Positive conditional cache size: 15, Positive unconditional cache size: 114, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, 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.9s, 31 PlacesBefore, 24 PlacesAfterwards, 27 TransitionsBefore, 20 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 23, independent unconditional: 17, 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: 40, independent: 40, independent conditional: 23, independent unconditional: 17, 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: 40, independent: 40, independent conditional: 23, independent unconditional: 17, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 31, independent conditional: 14, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 239, Positive conditional cache size: 26, Positive unconditional cache size: 213, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 29 PlacesBefore, 29 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 248, Positive conditional cache size: 28, Positive unconditional cache size: 220, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 29 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 260, Positive conditional cache size: 28, Positive unconditional cache size: 232, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 290, Positive cache size: 262, Positive conditional cache size: 28, Positive unconditional cache size: 234, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, 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, 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): 290, Positive cache size: 262, Positive conditional cache size: 28, Positive unconditional cache size: 234, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 170 locations, 5 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: 8.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 2 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=5, InterpolantAutomatonStates: 34, 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, 1.4s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6/6 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 04:59:14,099 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...