/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:32,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:32,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:32,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:32,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:32,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:32,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:32,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:32,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:32,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:32,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:32,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:32,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:32,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:32,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:32,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:32,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:32,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:32,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:32,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:32,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:32,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:32,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:32,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:32,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:32,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:32,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:32,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:32,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:32,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:32,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:32,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:32,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:32,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:32,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:32,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:32,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:32,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:32,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:32,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:32,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:32,823 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-RepeatedSemanticLbe.epf [2022-12-05 23:42:32,849 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:32,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:32,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:32,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:32,850 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:32,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:32,851 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:32,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:32,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:32,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:32,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:32,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:32,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:32,852 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:32,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:32,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:32,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:32,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:32,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:32,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:32,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:32,854 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-05 23:42:33,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:33,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:33,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:33,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:33,129 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:33,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2022-12-05 23:42:33,966 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:34,195 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:34,196 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2022-12-05 23:42:34,223 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77696bfd/c95888a9d3c641648e67c651786c7626/FLAGe10f4e2a1 [2022-12-05 23:42:34,233 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77696bfd/c95888a9d3c641648e67c651786c7626 [2022-12-05 23:42:34,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:34,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:34,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:34,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:34,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:34,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c8f241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34, skipping insertion in model container [2022-12-05 23:42:34,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:34,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:34,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2022-12-05 23:42:34,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:34,558 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:34,567 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_24-multiple-protecting_true.i[1096,1109] [2022-12-05 23:42:34,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:34,626 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:34,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34 WrapperNode [2022-12-05 23:42:34,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:34,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:34,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:34,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:34,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,673 INFO L138 Inliner]: procedures = 162, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2022-12-05 23:42:34,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:34,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:34,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:34,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:34,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,698 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:34,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:34,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:34,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:34,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (1/1) ... [2022-12-05 23:42:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:34,730 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-05 23:42:34,767 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-05 23:42:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:42:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:42:34,778 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:42:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:34,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:34,780 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:42:34,894 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:34,895 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:35,059 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:35,064 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:35,064 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:35,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:35 BoogieIcfgContainer [2022-12-05 23:42:35,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:35,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:35,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:35,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:35,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:34" (1/3) ... [2022-12-05 23:42:35,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7626585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:35, skipping insertion in model container [2022-12-05 23:42:35,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:34" (2/3) ... [2022-12-05 23:42:35,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7626585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:35, skipping insertion in model container [2022-12-05 23:42:35,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:35" (3/3) ... [2022-12-05 23:42:35,070 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2022-12-05 23:42:35,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:35,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 23:42:35,081 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:35,157 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:42:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 131 transitions, 270 flow [2022-12-05 23:42:35,228 INFO L130 PetriNetUnfolder]: 4/130 cut-off events. [2022-12-05 23:42:35,228 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:35,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 130 events. 4/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-05 23:42:35,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 131 transitions, 270 flow [2022-12-05 23:42:35,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 117 transitions, 237 flow [2022-12-05 23:42:35,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:35,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 117 transitions, 237 flow [2022-12-05 23:42:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 237 flow [2022-12-05 23:42:35,270 INFO L130 PetriNetUnfolder]: 3/117 cut-off events. [2022-12-05 23:42:35,270 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:35,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-05 23:42:35,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 117 transitions, 237 flow [2022-12-05 23:42:35,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 3102 [2022-12-05 23:42:38,509 INFO L203 LiptonReduction]: Total number of compositions: 92 [2022-12-05 23:42:38,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:38,528 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;@3d94ca06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:38,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:42:38,539 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 23:42:38,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:38,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:38,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:42:38,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 421712190, now seen corresponding path program 1 times [2022-12-05 23:42:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:38,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059274208] [2022-12-05 23:42:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:38,676 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-05 23:42:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059274208] [2022-12-05 23:42:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059274208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:38,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:38,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764358448] [2022-12-05 23:42:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:38,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:38,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2022-12-05 23:42:38,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:38,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:38,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2022-12-05 23:42:38,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:38,793 INFO L130 PetriNetUnfolder]: 196/487 cut-off events. [2022-12-05 23:42:38,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:38,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 487 events. 196/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2228 event pairs, 196 based on Foata normal form. 15/437 useless extension candidates. Maximal degree in co-relation 905. Up to 423 conditions per place. [2022-12-05 23:42:38,801 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 30 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-12-05 23:42:38,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 139 flow [2022-12-05 23:42:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-12-05 23:42:38,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2022-12-05 23:42:38,809 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 85 flow. Second operand 2 states and 49 transitions. [2022-12-05 23:42:38,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 139 flow [2022-12-05 23:42:38,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:38,813 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 78 flow [2022-12-05 23:42:38,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-05 23:42:38,817 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 23:42:38,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:38,818 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 78 flow [2022-12-05 23:42:38,820 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:38,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:38,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 78 flow [2022-12-05 23:42:38,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 78 flow [2022-12-05 23:42:38,826 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-05 23:42:38,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:38,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:38,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 78 flow [2022-12-05 23:42:38,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-05 23:42:38,929 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:38,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-05 23:42:38,934 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 78 flow [2022-12-05 23:42:38,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:38,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:38,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:42:38,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:38,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 421712025, now seen corresponding path program 1 times [2022-12-05 23:42:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873371740] [2022-12-05 23:42:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:39,100 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-05 23:42:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:39,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873371740] [2022-12-05 23:42:39,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873371740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:39,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:39,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:39,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427096902] [2022-12-05 23:42:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:39,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:39,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:39,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:39,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-05 23:42:39,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-05 23:42:39,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:39,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-05 23:42:39,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:39,176 INFO L130 PetriNetUnfolder]: 184/463 cut-off events. [2022-12-05 23:42:39,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:39,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 463 events. 184/463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2101 event pairs, 63 based on Foata normal form. 4/417 useless extension candidates. Maximal degree in co-relation 857. Up to 317 conditions per place. [2022-12-05 23:42:39,179 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 39 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-05 23:42:39,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 182 flow [2022-12-05 23:42:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-05 23:42:39,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-05 23:42:39,181 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 78 flow. Second operand 3 states and 68 transitions. [2022-12-05 23:42:39,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 182 flow [2022-12-05 23:42:39,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:39,183 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-05 23:42:39,183 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-05 23:42:39,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:39,183 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,184 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:39,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:39,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,188 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-05 23:42:39,188 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:39,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-05 23:42:39,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-05 23:42:39,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:39,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:42:39,198 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 90 flow [2022-12-05 23:42:39,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-05 23:42:39,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:39,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:39,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:39,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash 372971704, now seen corresponding path program 1 times [2022-12-05 23:42:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:39,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419700063] [2022-12-05 23:42:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:39,290 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-05 23:42:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:39,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419700063] [2022-12-05 23:42:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419700063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:39,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288170744] [2022-12-05 23:42:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:39,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-05 23:42:39,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:39,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:39,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-05 23:42:39,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:39,419 INFO L130 PetriNetUnfolder]: 332/724 cut-off events. [2022-12-05 23:42:39,419 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-05 23:42:39,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 724 events. 332/724 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3392 event pairs, 154 based on Foata normal form. 7/674 useless extension candidates. Maximal degree in co-relation 1537. Up to 555 conditions per place. [2022-12-05 23:42:39,422 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 56 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2022-12-05 23:42:39,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 301 flow [2022-12-05 23:42:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-05 23:42:39,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2022-12-05 23:42:39,424 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 90 flow. Second operand 3 states and 75 transitions. [2022-12-05 23:42:39,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 301 flow [2022-12-05 23:42:39,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:39,426 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2022-12-05 23:42:39,427 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-05 23:42:39,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:39,427 INFO L89 Accepts]: Start accepts. Operand has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,427 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:39,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:39,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,438 INFO L130 PetriNetUnfolder]: 40/201 cut-off events. [2022-12-05 23:42:39,439 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:42:39,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 201 events. 40/201 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 960 event pairs, 24 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 343. Up to 86 conditions per place. [2022-12-05 23:42:39,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-05 23:42:39,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:39,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 23:42:39,478 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 165 flow [2022-12-05 23:42:39,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:39,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:39,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:39,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:39,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1788275200, now seen corresponding path program 1 times [2022-12-05 23:42:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:39,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346343814] [2022-12-05 23:42:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:39,636 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-05 23:42:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:39,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346343814] [2022-12-05 23:42:39,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346343814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:39,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:39,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522023112] [2022-12-05 23:42:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:39,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:39,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-05 23:42:39,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-05 23:42:39,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:39,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-05 23:42:39,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:39,731 INFO L130 PetriNetUnfolder]: 184/440 cut-off events. [2022-12-05 23:42:39,732 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-05 23:42:39,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 440 events. 184/440 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1978 event pairs, 36 based on Foata normal form. 13/420 useless extension candidates. Maximal degree in co-relation 1089. Up to 333 conditions per place. [2022-12-05 23:42:39,733 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 58 selfloop transitions, 7 changer transitions 1/67 dead transitions. [2022-12-05 23:42:39,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 338 flow [2022-12-05 23:42:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 23:42:39,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45394736842105265 [2022-12-05 23:42:39,737 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 165 flow. Second operand 4 states and 69 transitions. [2022-12-05 23:42:39,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 338 flow [2022-12-05 23:42:39,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 326 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:39,739 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 152 flow [2022-12-05 23:42:39,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-05 23:42:39,740 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-05 23:42:39,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:39,740 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 152 flow [2022-12-05 23:42:39,740 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:39,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:39,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 152 flow [2022-12-05 23:42:39,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 152 flow [2022-12-05 23:42:39,748 INFO L130 PetriNetUnfolder]: 18/134 cut-off events. [2022-12-05 23:42:39,748 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 23:42:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 134 events. 18/134 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 490 event pairs, 12 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 235. Up to 49 conditions per place. [2022-12-05 23:42:39,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 152 flow [2022-12-05 23:42:39,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-05 23:42:39,917 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:42:39,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-05 23:42:39,918 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 142 flow [2022-12-05 23:42:39,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-05 23:42:39,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:39,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:39,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:39,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2068878067, now seen corresponding path program 1 times [2022-12-05 23:42:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:39,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551391525] [2022-12-05 23:42:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:39,956 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-05 23:42:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551391525] [2022-12-05 23:42:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551391525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815297161] [2022-12-05 23:42:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:39,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:39,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-05 23:42:39,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-05 23:42:39,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:39,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-05 23:42:39,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:40,020 INFO L130 PetriNetUnfolder]: 116/303 cut-off events. [2022-12-05 23:42:40,020 INFO L131 PetriNetUnfolder]: For 111/112 co-relation queries the response was YES. [2022-12-05 23:42:40,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 303 events. 116/303 cut-off events. For 111/112 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1335 event pairs, 43 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 783. Up to 187 conditions per place. [2022-12-05 23:42:40,022 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 39 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2022-12-05 23:42:40,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 265 flow [2022-12-05 23:42:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-05 23:42:40,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-05 23:42:40,023 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 142 flow. Second operand 3 states and 59 transitions. [2022-12-05 23:42:40,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 265 flow [2022-12-05 23:42:40,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:40,024 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 147 flow [2022-12-05 23:42:40,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-05 23:42:40,025 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-05 23:42:40,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:40,025 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 147 flow [2022-12-05 23:42:40,026 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:40,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:40,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 147 flow [2022-12-05 23:42:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 147 flow [2022-12-05 23:42:40,032 INFO L130 PetriNetUnfolder]: 18/119 cut-off events. [2022-12-05 23:42:40,032 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 23:42:40,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 119 events. 18/119 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 468 event pairs, 12 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 225. Up to 49 conditions per place. [2022-12-05 23:42:40,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 147 flow [2022-12-05 23:42:40,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-05 23:42:40,102 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:42:40,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-05 23:42:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 145 flow [2022-12-05 23:42:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-05 23:42:40,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:40,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:40,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:42:40,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 717286565, now seen corresponding path program 1 times [2022-12-05 23:42:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288144604] [2022-12-05 23:42:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:40,180 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-05 23:42:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:40,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288144604] [2022-12-05 23:42:40,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288144604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:40,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:40,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464562911] [2022-12-05 23:42:40,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:40,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:40,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:40,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:40,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-05 23:42:40,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:40,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:40,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-05 23:42:40,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:40,220 INFO L130 PetriNetUnfolder]: 79/226 cut-off events. [2022-12-05 23:42:40,221 INFO L131 PetriNetUnfolder]: For 111/113 co-relation queries the response was YES. [2022-12-05 23:42:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 226 events. 79/226 cut-off events. For 111/113 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 893 event pairs, 69 based on Foata normal form. 32/256 useless extension candidates. Maximal degree in co-relation 608. Up to 194 conditions per place. [2022-12-05 23:42:40,222 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 23 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2022-12-05 23:42:40,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 189 flow [2022-12-05 23:42:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 23:42:40,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-05 23:42:40,222 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 145 flow. Second operand 4 states and 49 transitions. [2022-12-05 23:42:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 189 flow [2022-12-05 23:42:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:40,224 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 138 flow [2022-12-05 23:42:40,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-05 23:42:40,224 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 23:42:40,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:40,224 INFO L89 Accepts]: Start accepts. Operand has 42 places, 33 transitions, 138 flow [2022-12-05 23:42:40,225 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:40,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:40,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 138 flow [2022-12-05 23:42:40,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 138 flow [2022-12-05 23:42:40,231 INFO L130 PetriNetUnfolder]: 17/116 cut-off events. [2022-12-05 23:42:40,231 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 23:42:40,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 116 events. 17/116 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 438 event pairs, 12 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 225. Up to 51 conditions per place. [2022-12-05 23:42:40,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 138 flow [2022-12-05 23:42:40,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-05 23:42:40,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L690-->L691-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2339| |v_~#__global_lock~0.base_703|))) (and (= |v_t_funThread1of1ForFork0_#t~post5_81| v_~g1~0_246) (= |v_t_funThread1of1ForFork0_#t~post5_81| (+ v_~g1~0_245 1)) (= (select .cse0 |v_~#__global_lock~0.offset_702|) 0) (= |v_#pthreadsMutex_2338| (store |v_#pthreadsMutex_2339| |v_~#__global_lock~0.base_703| (store .cse0 |v_~#__global_lock~0.offset_702| 1))))) InVars {~g1~0=v_~g1~0_246, #pthreadsMutex=|v_#pthreadsMutex_2339|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_702|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_703|} OutVars{~g1~0=v_~g1~0_245, #pthreadsMutex=|v_#pthreadsMutex_2338|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_702|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_81|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_101|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_703|} AuxVars[] AssignedVars[~g1~0, #pthreadsMutex, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_#t~nondet4] and [424] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_2450| |v_~#mutex1~0.base_241|))) (let ((.cse0 (store |v_#pthreadsMutex_2450| |v_~#mutex1~0.base_241| (store .cse2 |v_~#mutex1~0.offset_241| 1)))) (let ((.cse1 (select .cse0 |v_~#__global_lock~0.base_735|))) (and (= (store .cse0 |v_~#__global_lock~0.base_735| (store .cse1 |v_~#__global_lock~0.offset_733| 1)) |v_#pthreadsMutex_2449|) (= (select .cse2 |v_~#mutex1~0.offset_241|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.base_101| v_t_funThread1of1ForFork0_~arg.base_101) (= v_t_funThread1of1ForFork0_~arg.offset_101 |v_t_funThread1of1ForFork0_#in~arg.offset_101|) (= (+ v_~g1~0_262 1) v_~g1~0_261) (= (select .cse1 |v_~#__global_lock~0.offset_733|) 0))))) InVars {~g1~0=v_~g1~0_262, #pthreadsMutex=|v_#pthreadsMutex_2450|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_101|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_241|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_733|, ~#mutex1~0.base=|v_~#mutex1~0.base_241|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_101|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_735|} OutVars{~g1~0=v_~g1~0_261, #pthreadsMutex=|v_#pthreadsMutex_2449|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_241|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_733|, ~#mutex1~0.base=|v_~#mutex1~0.base_241|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_101|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_101, ~#__global_lock~0.base=|v_~#__global_lock~0.base_735|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_101|, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_151|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_101, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_181|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_87|} AuxVars[] AssignedVars[~g1~0, #pthreadsMutex, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-05 23:42:40,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L690-->L689: Formula: false InVars {} OutVars{~g1~0=v_~g1~0_285, #pthreadsMutex=|v_#pthreadsMutex_2602|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_103, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_155|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_103, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_90|, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_183|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_89|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_107|} AuxVars[] AssignedVars[~g1~0, #pthreadsMutex, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet4] and [421] L691-2-->L694: Formula: (= (let ((.cse0 (store |v_#pthreadsMutex_2334| |v_~#__global_lock~0.base_701| (store (select |v_#pthreadsMutex_2334| |v_~#__global_lock~0.base_701|) |v_~#__global_lock~0.offset_700| 0)))) (store .cse0 |v_~#mutex1~0.base_229| (store (select .cse0 |v_~#mutex1~0.base_229|) |v_~#mutex1~0.offset_229| 0))) |v_#pthreadsMutex_2332|) InVars {#pthreadsMutex=|v_#pthreadsMutex_2334|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_229|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_700|, ~#mutex1~0.base=|v_~#mutex1~0.base_229|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_701|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_2332|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_229|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_700|, ~#mutex1~0.base=|v_~#mutex1~0.base_229|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_79|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_701|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~post5] [2022-12-05 23:42:40,278 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:42:40,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-05 23:42:40,279 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 151 flow [2022-12-05 23:42:40,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:40,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:40,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:40,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:42:40,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 392022901, now seen corresponding path program 1 times [2022-12-05 23:42:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780740340] [2022-12-05 23:42:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:40,371 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-05 23:42:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:40,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780740340] [2022-12-05 23:42:40,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780740340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:40,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:40,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361562692] [2022-12-05 23:42:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:40,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:40,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:42:40,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-05 23:42:40,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:40,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:42:40,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:40,428 INFO L130 PetriNetUnfolder]: 64/218 cut-off events. [2022-12-05 23:42:40,429 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-05 23:42:40,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 218 events. 64/218 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 866 event pairs, 30 based on Foata normal form. 34/240 useless extension candidates. Maximal degree in co-relation 613. Up to 114 conditions per place. [2022-12-05 23:42:40,429 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 20 selfloop transitions, 19 changer transitions 10/49 dead transitions. [2022-12-05 23:42:40,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 305 flow [2022-12-05 23:42:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:42:40,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2022-12-05 23:42:40,430 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 151 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:42:40,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 305 flow [2022-12-05 23:42:40,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:40,432 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 217 flow [2022-12-05 23:42:40,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-05 23:42:40,432 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 23:42:40,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:40,432 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 217 flow [2022-12-05 23:42:40,433 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:40,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:40,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 217 flow [2022-12-05 23:42:40,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 217 flow [2022-12-05 23:42:40,457 INFO L130 PetriNetUnfolder]: 20/129 cut-off events. [2022-12-05 23:42:40,458 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-05 23:42:40,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 129 events. 20/129 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 488 event pairs, 12 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 375. Up to 56 conditions per place. [2022-12-05 23:42:40,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 217 flow [2022-12-05 23:42:40,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:42:40,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99|))) (and (= |v_ULTIMATE.start_main_#t~nondet13#1_60| 0) (= (select .cse0 |v_~#mutex1~0.offset_99|) 0) (= (store |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1165|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1166|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1165|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_60|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [397] L701-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_733| |v_~#mutex2~0.base_81| (store (select |v_#pthreadsMutex_733| |v_~#mutex2~0.base_81|) |v_~#mutex2~0.offset_81| 0)) |v_#pthreadsMutex_732|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_733|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_81|, ~#mutex2~0.base=|v_~#mutex2~0.base_81|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_732|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_81|, ~#mutex2~0.base=|v_~#mutex2~0.base_81|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-05 23:42:40,898 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-05 23:42:40,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-05 23:42:40,899 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 209 flow [2022-12-05 23:42:40,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-05 23:42:40,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:40,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:40,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:42:40,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 733546428, now seen corresponding path program 1 times [2022-12-05 23:42:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:40,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515668507] [2022-12-05 23:42:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:41,015 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-05 23:42:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515668507] [2022-12-05 23:42:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515668507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:41,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:42:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572139900] [2022-12-05 23:42:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:41,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:41,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:42:41,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 2.0) 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-05 23:42:41,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:41,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:42:41,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:41,059 INFO L130 PetriNetUnfolder]: 32/114 cut-off events. [2022-12-05 23:42:41,059 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-12-05 23:42:41,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 114 events. 32/114 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 472 event pairs, 1 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 480. Up to 107 conditions per place. [2022-12-05 23:42:41,059 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 24 selfloop transitions, 3 changer transitions 4/31 dead transitions. [2022-12-05 23:42:41,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 291 flow [2022-12-05 23:42:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-05 23:42:41,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 23:42:41,060 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 209 flow. Second operand 4 states and 30 transitions. [2022-12-05 23:42:41,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 291 flow [2022-12-05 23:42:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:41,061 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 181 flow [2022-12-05 23:42:41,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-05 23:42:41,062 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-12-05 23:42:41,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:41,062 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 181 flow [2022-12-05 23:42:41,062 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:41,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:41,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 181 flow [2022-12-05 23:42:41,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 181 flow [2022-12-05 23:42:41,067 INFO L130 PetriNetUnfolder]: 13/72 cut-off events. [2022-12-05 23:42:41,067 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-05 23:42:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 72 events. 13/72 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 268 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 234. Up to 36 conditions per place. [2022-12-05 23:42:41,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 181 flow [2022-12-05 23:42:41,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-05 23:42:41,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99|))) (and (= |v_ULTIMATE.start_main_#t~nondet13#1_60| 0) (= (select .cse0 |v_~#mutex1~0.offset_99|) 0) (= (store |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1165|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1166|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1165|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_60|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [440] L694-1-->L698: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2743| |v_~#__global_lock~0.base_849|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_830|) 0) (= (+ v_~g2~0_148 1) v_~g2~0_147) (= |v_#pthreadsMutex_2741| (store |v_#pthreadsMutex_2743| |v_~#__global_lock~0.base_849| (store .cse0 |v_~#__global_lock~0.offset_830| 0))))) InVars {~g2~0=v_~g2~0_148, #pthreadsMutex=|v_#pthreadsMutex_2743|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_830|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_849|} OutVars{~g2~0=v_~g2~0_147, #pthreadsMutex=|v_#pthreadsMutex_2741|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_201|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_830|, t_funThread1of1ForFork0_#t~nondet7=|v_t_funThread1of1ForFork0_#t~nondet7_113|, t_funThread1of1ForFork0_#t~post8=|v_t_funThread1of1ForFork0_#t~post8_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_849|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6, t_funThread1of1ForFork0_#t~nondet7, t_funThread1of1ForFork0_#t~post8] [2022-12-05 23:42:41,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99|))) (and (= |v_ULTIMATE.start_main_#t~nondet13#1_60| 0) (= (select .cse0 |v_~#mutex1~0.offset_99|) 0) (= (store |v_#pthreadsMutex_1166| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1165|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1166|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1165|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_60|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [436] L698-->L701: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2721| |v_~#__global_lock~0.base_841|))) (and (= (store |v_#pthreadsMutex_2721| |v_~#__global_lock~0.base_841| (store .cse0 |v_~#__global_lock~0.offset_822| 0)) |v_#pthreadsMutex_2719|) (= (select .cse0 |v_~#__global_lock~0.offset_822|) 0) (= (+ v_~g2~0_137 1) v_~g2~0_138))) InVars {~g2~0=v_~g2~0_138, #pthreadsMutex=|v_#pthreadsMutex_2721|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_822|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_841|} OutVars{~g2~0=v_~g2~0_137, t_funThread1of1ForFork0_#t~nondet9=|v_t_funThread1of1ForFork0_#t~nondet9_101|, #pthreadsMutex=|v_#pthreadsMutex_2719|, t_funThread1of1ForFork0_#t~post10=|v_t_funThread1of1ForFork0_#t~post10_103|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_822|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_841|} AuxVars[] AssignedVars[~g2~0, t_funThread1of1ForFork0_#t~nondet9, #pthreadsMutex, t_funThread1of1ForFork0_#t~post10] [2022-12-05 23:42:41,387 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:42:41,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-05 23:42:41,388 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 213 flow [2022-12-05 23:42:41,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) 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-05 23:42:41,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:41,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:41,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:42:41,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1661853916, now seen corresponding path program 1 times [2022-12-05 23:42:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:41,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217922335] [2022-12-05 23:42:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:41,871 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-05 23:42:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217922335] [2022-12-05 23:42:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217922335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:41,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:41,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:42:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297387501] [2022-12-05 23:42:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:41,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:42:41,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-05 23:42:41,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:41,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:42:41,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:41,908 INFO L130 PetriNetUnfolder]: 11/62 cut-off events. [2022-12-05 23:42:41,908 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2022-12-05 23:42:41,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 62 events. 11/62 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 237 event pairs, 1 based on Foata normal form. 7/68 useless extension candidates. Maximal degree in co-relation 274. Up to 41 conditions per place. [2022-12-05 23:42:41,908 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 15 selfloop transitions, 9 changer transitions 3/27 dead transitions. [2022-12-05 23:42:41,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 295 flow [2022-12-05 23:42:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-12-05 23:42:41,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-05 23:42:41,909 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 213 flow. Second operand 4 states and 26 transitions. [2022-12-05 23:42:41,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 295 flow [2022-12-05 23:42:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 280 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:41,910 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 204 flow [2022-12-05 23:42:41,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-05 23:42:41,911 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2022-12-05 23:42:41,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:41,911 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 204 flow [2022-12-05 23:42:41,911 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:41,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:41,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 204 flow [2022-12-05 23:42:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 204 flow [2022-12-05 23:42:41,915 INFO L130 PetriNetUnfolder]: 8/52 cut-off events. [2022-12-05 23:42:41,915 INFO L131 PetriNetUnfolder]: For 132/135 co-relation queries the response was YES. [2022-12-05 23:42:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 52 events. 8/52 cut-off events. For 132/135 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 185 event pairs, 1 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 191. Up to 23 conditions per place. [2022-12-05 23:42:41,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 204 flow [2022-12-05 23:42:41,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-05 23:42:41,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#mutex2~0.base_9|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#mutex2~0.base_9| (store .cse0 |v_~#mutex2~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0) (= (select .cse0 |v_~#mutex2~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6] and [449] L706-3-->L698: Formula: (let ((.cse2 (select |v_#pthreadsMutex_2813| |v_~#mutex1~0.base_310|))) (let ((.cse1 (store |v_#pthreadsMutex_2813| |v_~#mutex1~0.base_310| (store .cse2 |v_~#mutex1~0.offset_300| 1)))) (let ((.cse0 (select .cse1 |v_~#__global_lock~0.base_873|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_852|) 0) (= (store .cse1 |v_~#__global_lock~0.base_873| (store .cse0 |v_~#__global_lock~0.offset_852| 0)) |v_#pthreadsMutex_2811|) (= (select .cse2 |v_~#mutex1~0.offset_300|) 0) (= |v_ULTIMATE.start_main_#t~nondet13#1_239| 0) (= v_~g2~0_156 (+ v_~g2~0_157 1)))))) InVars {~g2~0=v_~g2~0_157, #pthreadsMutex=|v_#pthreadsMutex_2813|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_300|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_852|, ~#mutex1~0.base=|v_~#mutex1~0.base_310|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_873|} OutVars{~g2~0=v_~g2~0_156, #pthreadsMutex=|v_#pthreadsMutex_2811|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_63|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_209|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_300|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_852|, t_funThread1of1ForFork0_#t~nondet7=|v_t_funThread1of1ForFork0_#t~nondet7_117|, ~#mutex1~0.base=|v_~#mutex1~0.base_310|, t_funThread1of1ForFork0_#t~post8=|v_t_funThread1of1ForFork0_#t~post8_61|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_239|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_873|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, t_funThread1of1ForFork0_#t~nondet6, t_funThread1of1ForFork0_#t~nondet7, t_funThread1of1ForFork0_#t~post8, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] [2022-12-05 23:42:42,633 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:42:42,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-05 23:42:42,634 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 190 flow [2022-12-05 23:42:42,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-05 23:42:42,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:42,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:42:42,634 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:42:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1577314061, now seen corresponding path program 1 times [2022-12-05 23:42:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508780769] [2022-12-05 23:42:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:42,776 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-05 23:42:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508780769] [2022-12-05 23:42:42,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508780769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:42,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:42,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086532476] [2022-12-05 23:42:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:42,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:42,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 23:42:42,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 190 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:42,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:42,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 23:42:42,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:42,801 INFO L130 PetriNetUnfolder]: 4/29 cut-off events. [2022-12-05 23:42:42,801 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-05 23:42:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 29 events. 4/29 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 4/33 useless extension candidates. Maximal degree in co-relation 159. Up to 23 conditions per place. [2022-12-05 23:42:42,802 INFO L137 encePairwiseOnDemand]: 6/14 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2022-12-05 23:42:42,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 17 transitions, 220 flow [2022-12-05 23:42:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-12-05 23:42:42,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-05 23:42:42,803 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 190 flow. Second operand 4 states and 17 transitions. [2022-12-05 23:42:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 17 transitions, 220 flow [2022-12-05 23:42:42,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 201 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:42,804 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2022-12-05 23:42:42,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2022-12-05 23:42:42,805 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -17 predicate places. [2022-12-05 23:42:42,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:42,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 0 transitions, 0 flow [2022-12-05 23:42:42,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:42,805 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:42,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:42,805 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-05 23:42:42,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:42,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:42,806 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:42,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-05 23:42:42,806 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:42,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:42,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:42:42,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:42:42,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-05 23:42:42,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-05 23:42:42,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-05 23:42:42,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:42:42,809 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:42,811 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:42,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:42,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:42 BasicIcfg [2022-12-05 23:42:42,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:42,813 INFO L158 Benchmark]: Toolchain (without parser) took 8577.37ms. Allocated memory was 161.5MB in the beginning and 316.7MB in the end (delta: 155.2MB). Free memory was 135.3MB in the beginning and 253.2MB in the end (delta: -117.9MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,813 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:42,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.33ms. Allocated memory is still 161.5MB. Free memory was 135.3MB in the beginning and 115.1MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.15ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,813 INFO L158 Benchmark]: Boogie Preprocessor took 26.11ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 111.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,814 INFO L158 Benchmark]: RCFGBuilder took 364.72ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 134.5MB in the end (delta: -23.1MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,814 INFO L158 Benchmark]: TraceAbstraction took 7746.31ms. Allocated memory was 161.5MB in the beginning and 316.7MB in the end (delta: 155.2MB). Free memory was 133.5MB in the beginning and 253.2MB in the end (delta: -119.7MB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. [2022-12-05 23:42:42,815 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.09ms. Allocated memory is still 161.5MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 389.33ms. Allocated memory is still 161.5MB. Free memory was 135.3MB in the beginning and 115.1MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.15ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.11ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 111.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 364.72ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 134.5MB in the end (delta: -23.1MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7746.31ms. Allocated memory was 161.5MB in the beginning and 316.7MB in the end (delta: 155.2MB). Free memory was 133.5MB in the beginning and 253.2MB in the end (delta: -119.7MB). Peak memory consumption was 35.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 118 PlacesBefore, 42 PlacesAfterwards, 117 TransitionsBefore, 41 TransitionsAfterwards, 3102 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 44 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2922, independent: 2659, independent conditional: 2659, independent unconditional: 0, dependent: 263, dependent conditional: 263, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2922, independent: 2659, independent conditional: 0, independent unconditional: 2659, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2922, independent: 2659, independent conditional: 0, independent unconditional: 2659, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2922, independent: 2659, independent conditional: 0, independent unconditional: 2659, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2030, independent: 1946, independent conditional: 0, independent unconditional: 1946, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2922, independent: 713, independent conditional: 0, independent unconditional: 713, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 2030, unknown conditional: 0, unknown unconditional: 2030] , Statistics on independence cache: Total cache size (in pairs): 3012, Positive cache size: 2928, Positive conditional cache size: 0, Positive unconditional cache size: 2928, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, 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, 41 PlacesBefore, 41 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 314, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 314, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 314, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 314, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 151, independent conditional: 0, independent unconditional: 151, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 253, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 253, independent: 193, independent conditional: 3, independent unconditional: 190, dependent: 60, dependent conditional: 5, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 253, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 60, dependent conditional: 5, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 253, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 60, dependent conditional: 5, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 56, dependent conditional: 1, dependent unconditional: 55, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 307, independent: 263, independent conditional: 263, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 307, independent: 263, independent conditional: 16, independent unconditional: 247, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 307, independent: 263, independent conditional: 16, independent unconditional: 247, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 263, independent conditional: 16, independent unconditional: 247, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 217, independent conditional: 13, independent unconditional: 204, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 64, unknown conditional: 7, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 249, Positive conditional cache size: 3, Positive unconditional cache size: 246, Negative cache size: 75, Negative conditional cache size: 8, Negative unconditional cache size: 67, 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.2s, 47 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 38 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 469, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 469, independent: 395, independent conditional: 51, independent unconditional: 344, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 469, independent: 395, independent conditional: 51, independent unconditional: 344, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 469, independent: 395, independent conditional: 51, independent unconditional: 344, dependent: 74, dependent conditional: 16, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 469, independent: 372, independent conditional: 49, independent unconditional: 323, dependent: 62, dependent conditional: 8, dependent unconditional: 54, unknown: 35, unknown conditional: 10, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 326, Positive conditional cache size: 5, Positive unconditional cache size: 321, Negative cache size: 87, Negative conditional cache size: 16, Negative unconditional cache size: 71, 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, 43 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 174, independent: 110, independent conditional: 63, independent unconditional: 47, dependent: 64, dependent conditional: 48, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174, independent: 110, independent conditional: 63, independent unconditional: 47, dependent: 64, dependent conditional: 48, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174, independent: 110, independent conditional: 63, independent unconditional: 47, dependent: 64, dependent conditional: 48, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 16, dependent conditional: 14, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 14, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 19, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, independent: 103, independent conditional: 60, independent unconditional: 43, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 23, unknown conditional: 17, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 369, Positive conditional cache size: 8, Positive unconditional cache size: 361, Negative cache size: 103, Negative conditional cache size: 30, Negative unconditional cache size: 73, 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, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 54, dependent conditional: 22, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 55, dependent conditional: 23, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 55, dependent conditional: 23, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 52, independent conditional: 17, independent unconditional: 35, dependent: 51, dependent conditional: 19, dependent unconditional: 32, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 377, Positive conditional cache size: 10, Positive unconditional cache size: 367, Negative cache size: 107, Negative conditional cache size: 34, Negative unconditional cache size: 73, 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.4s, 41 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 28 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 39, independent unconditional: 6, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 45, independent conditional: 39, independent unconditional: 6, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 39, independent unconditional: 6, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 39, independent conditional: 34, independent unconditional: 5, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 463, Positive conditional cache size: 16, Positive unconditional cache size: 447, Negative cache size: 108, Negative conditional cache size: 35, Negative unconditional cache size: 73, 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.3s, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 480, Positive conditional cache size: 21, Positive unconditional cache size: 459, Negative cache size: 111, Negative conditional cache size: 38, Negative unconditional cache size: 73, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 32 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 497, Positive conditional cache size: 22, Positive unconditional cache size: 475, Negative cache size: 111, Negative conditional cache size: 38, Negative unconditional cache size: 73, 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, 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): 608, Positive cache size: 497, Positive conditional cache size: 22, Positive unconditional cache size: 475, Negative cache size: 111, Negative conditional cache size: 38, Negative unconditional cache size: 73, 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 - 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, 163 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: 7.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 9 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=7, InterpolantAutomatonStates: 35, 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.2s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:42,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...