/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:21:22,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:21:22,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:21:22,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:21:22,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:21:22,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:21:22,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:21:22,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:21:22,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:21:22,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:21:22,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:21:22,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:21:22,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:21:22,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:21:22,737 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:21:22,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:21:22,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:21:22,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:21:22,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:21:22,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:21:22,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:21:22,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:21:22,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:21:22,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:21:22,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:21:22,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:21:22,740 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:21:22,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:21:22,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:21:22,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:21:22,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:21:22,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:21:22,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:21:22,744 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:21:22,744 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-03 23:21:22,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:21:23,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:21:23,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:21:23,021 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:21:23,022 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:21:23,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019.opt_bound2.i [2023-08-03 23:21:24,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:21:24,421 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:21:24,422 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019.opt_bound2.i [2023-08-03 23:21:24,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bb0054c/719bcdcfb8af4c369c938cf8779ed05a/FLAGa7377f944 [2023-08-03 23:21:24,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bb0054c/719bcdcfb8af4c369c938cf8779ed05a [2023-08-03 23:21:24,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:21:24,450 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:21:24,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:21:24,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:21:24,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:21:24,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:24,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6edbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24, skipping insertion in model container [2023-08-03 23:21:24,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:24,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:21:24,641 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019.opt_bound2.i[944,957] [2023-08-03 23:21:24,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:21:24,873 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:21:24,884 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix019.opt_bound2.i[944,957] [2023-08-03 23:21:24,901 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:21:24,903 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 23:21:24,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:21:24,976 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:21:24,976 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:21:24,984 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:21:24,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24 WrapperNode [2023-08-03 23:21:24,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:21:24,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:21:24,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:21:24,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:21:24,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,052 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-03 23:21:25,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:21:25,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:21:25,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:21:25,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:21:25,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:21:25,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:21:25,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:21:25,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:21:25,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (1/1) ... [2023-08-03 23:21:25,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:21:25,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:21:25,125 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) [2023-08-03 23:21:25,127 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 [2023-08-03 23:21:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:21:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:21:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:21:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:21:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:21:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:21:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 23:21:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:21:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:21:25,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:21:25,164 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:21:25,274 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:21:25,276 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:21:25,574 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:21:25,730 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:21:25,730 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 23:21:25,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:21:25 BoogieIcfgContainer [2023-08-03 23:21:25,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:21:25,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:21:25,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:21:25,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:21:25,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:21:24" (1/3) ... [2023-08-03 23:21:25,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235f70fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:21:25, skipping insertion in model container [2023-08-03 23:21:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:21:24" (2/3) ... [2023-08-03 23:21:25,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235f70fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:21:25, skipping insertion in model container [2023-08-03 23:21:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:21:25" (3/3) ... [2023-08-03 23:21:25,743 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix019.opt_bound2.i [2023-08-03 23:21:25,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:21:25,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:21:25,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:21:25,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:21:25,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:21:25,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 23:21:26,004 INFO L124 PetriNetUnfolderBase]: 30/453 cut-off events. [2023-08-03 23:21:26,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:21:26,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 453 events. 30/453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1997 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-03 23:21:26,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 23:21:26,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 215 flow [2023-08-03 23:21:26,018 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:21:26,035 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-03 23:21:26,039 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-03 23:21:26,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 215 flow [2023-08-03 23:21:26,072 INFO L124 PetriNetUnfolderBase]: 6/221 cut-off events. [2023-08-03 23:21:26,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:21:26,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 221 events. 6/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 645 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2023-08-03 23:21:26,075 INFO L119 LiptonReduction]: Number of co-enabled transitions 1248 [2023-08-03 23:21:29,007 INFO L134 LiptonReduction]: Checked pairs total: 2987 [2023-08-03 23:21:29,008 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-03 23:21:29,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:21:29,023 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b86a9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:21:29,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 23:21:29,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:21:29,027 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-03 23:21:29,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:21:29,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:21:29,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 23:21:29,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:21:29,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:21:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -955434927, now seen corresponding path program 1 times [2023-08-03 23:21:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:21:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903185640] [2023-08-03 23:21:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:21:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:21:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:21:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:21:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903185640] [2023-08-03 23:21:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903185640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:21:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:21:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:21:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923277275] [2023-08-03 23:21:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:21:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:21:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:21:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:21:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:21:29,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 209 [2023-08-03 23:21:29,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-03 23:21:29,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:21:29,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 209 [2023-08-03 23:21:29,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:21:29,414 INFO L124 PetriNetUnfolderBase]: 372/663 cut-off events. [2023-08-03 23:21:29,415 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 23:21:29,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 663 events. 372/663 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2969 event pairs, 210 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 1325. Up to 616 conditions per place. [2023-08-03 23:21:29,421 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 22 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-03 23:21:29,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 121 flow [2023-08-03 23:21:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:21:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:21:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-03 23:21:29,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5661881977671451 [2023-08-03 23:21:29,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-03 23:21:29,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-03 23:21:29,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:21:29,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-03 23:21:29,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-08-03 23:21:29,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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) [2023-08-03 23:21:29,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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) [2023-08-03 23:21:29,463 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 355 transitions. [2023-08-03 23:21:29,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 121 flow [2023-08-03 23:21:29,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 121 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:21:29,467 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-03 23:21:29,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-03 23:21:29,472 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-03 23:21:29,473 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-03 23:21:29,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-03 23:21:29,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:21:29,474 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:21:29,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:21:29,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:21:29,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:21:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -948389927, now seen corresponding path program 1 times [2023-08-03 23:21:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:21:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35572704] [2023-08-03 23:21:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:21:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:21:29,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:21:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:21:29,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:21:29,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:21:29,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 23:21:29,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 23:21:29,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 23:21:29,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:21:29,562 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:21:29,566 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-03 23:21:29,566 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:21:29,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:21:29,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:21:29,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 23:21:29,776 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-03 23:21:29,777 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:21:29,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9736 event pairs, 0 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1009. Up to 54 conditions per place. [2023-08-03 23:21:29,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 23:21:29,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 284 flow [2023-08-03 23:21:29,788 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:21:29,788 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 284 flow [2023-08-03 23:21:29,788 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 284 flow [2023-08-03 23:21:29,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 284 flow [2023-08-03 23:21:29,860 INFO L124 PetriNetUnfolderBase]: 12/621 cut-off events. [2023-08-03 23:21:29,861 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:21:29,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 621 events. 12/621 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3221 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 487. Up to 27 conditions per place. [2023-08-03 23:21:29,871 INFO L119 LiptonReduction]: Number of co-enabled transitions 3492 [2023-08-03 23:21:32,897 INFO L134 LiptonReduction]: Checked pairs total: 11359 [2023-08-03 23:21:32,897 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-03 23:21:32,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:21:32,900 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b86a9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:21:32,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 23:21:32,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:21:32,907 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-08-03 23:21:32,908 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-03 23:21:32,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:21:32,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 23:21:32,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:21:32,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:21:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1730943959, now seen corresponding path program 1 times [2023-08-03 23:21:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:21:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109996881] [2023-08-03 23:21:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:21:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:21:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:21:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:21:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109996881] [2023-08-03 23:21:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109996881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:21:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:21:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:21:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193471662] [2023-08-03 23:21:32,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:21:32,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:21:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:21:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:21:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:21:33,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-03 23:21:33,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-08-03 23:21:33,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:21:33,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-03 23:21:33,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:21:42,698 INFO L124 PetriNetUnfolderBase]: 78164/103410 cut-off events. [2023-08-03 23:21:42,698 INFO L125 PetriNetUnfolderBase]: For 5340/5340 co-relation queries the response was YES. [2023-08-03 23:21:42,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210185 conditions, 103410 events. 78164/103410 cut-off events. For 5340/5340 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 655355 event pairs, 63366 based on Foata normal form. 0/95618 useless extension candidates. Maximal degree in co-relation 60190. Up to 100362 conditions per place. [2023-08-03 23:21:43,438 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 36 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-03 23:21:43,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 208 flow [2023-08-03 23:21:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:21:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:21:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-03 23:21:43,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2023-08-03 23:21:43,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-03 23:21:43,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-03 23:21:43,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:21:43,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-03 23:21:43,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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) [2023-08-03 23:21:43,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-03 23:21:43,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-03 23:21:43,445 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 124 flow. Second operand 3 states and 417 transitions. [2023-08-03 23:21:43,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 208 flow [2023-08-03 23:21:43,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 202 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 23:21:43,454 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 130 flow [2023-08-03 23:21:43,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-03 23:21:43,455 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2023-08-03 23:21:43,455 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 130 flow [2023-08-03 23:21:43,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-08-03 23:21:43,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:21:43,456 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:21:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:21:43,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:21:43,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:21:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 11426798, now seen corresponding path program 1 times [2023-08-03 23:21:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:21:43,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702870930] [2023-08-03 23:21:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:21:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:21:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:21:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:21:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702870930] [2023-08-03 23:21:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702870930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:21:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:21:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 23:21:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587302476] [2023-08-03 23:21:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:21:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:21:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:21:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:21:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:21:43,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-03 23:21:43,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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) [2023-08-03 23:21:43,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:21:43,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-03 23:21:43,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:21:52,110 INFO L124 PetriNetUnfolderBase]: 78152/103365 cut-off events. [2023-08-03 23:21:52,110 INFO L125 PetriNetUnfolderBase]: For 4707/4707 co-relation queries the response was YES. [2023-08-03 23:21:52,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209555 conditions, 103365 events. 78152/103365 cut-off events. For 4707/4707 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 655115 event pairs, 52272 based on Foata normal form. 9/95633 useless extension candidates. Maximal degree in co-relation 74771. Up to 100315 conditions per place. [2023-08-03 23:21:52,922 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-03 23:21:52,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 230 flow [2023-08-03 23:21:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:21:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:21:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-03 23:21:52,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5575 [2023-08-03 23:21:52,925 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-03 23:21:52,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-03 23:21:52,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:21:52,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-03 23:21:52,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 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) [2023-08-03 23:21:52,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-03 23:21:52,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-03 23:21:52,930 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 130 flow. Second operand 5 states and 669 transitions. [2023-08-03 23:21:52,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 230 flow [2023-08-03 23:21:52,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:21:52,934 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 144 flow [2023-08-03 23:21:52,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-03 23:21:52,935 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-03 23:21:52,935 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 144 flow [2023-08-03 23:21:52,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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) [2023-08-03 23:21:52,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:21:52,936 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:21:52,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 23:21:52,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:21:52,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:21:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash 131960463, now seen corresponding path program 1 times [2023-08-03 23:21:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:21:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578357230] [2023-08-03 23:21:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:21:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:21:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:21:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:21:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578357230] [2023-08-03 23:21:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578357230] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:21:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792245894] [2023-08-03 23:21:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:21:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:21:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:21:53,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:21:53,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:21:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:21:53,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 23:21:53,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:21:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:21:53,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:21:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792245894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:21:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:21:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 23:21:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82296600] [2023-08-03 23:21:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:21:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:21:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:21:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:21:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:21:53,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-03 23:21:53,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-03 23:21:53,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:21:53,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-03 23:21:53,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:22:01,525 INFO L124 PetriNetUnfolderBase]: 75822/102396 cut-off events. [2023-08-03 23:22:01,525 INFO L125 PetriNetUnfolderBase]: For 4426/4426 co-relation queries the response was YES. [2023-08-03 23:22:01,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205695 conditions, 102396 events. 75822/102396 cut-off events. For 4426/4426 co-relation queries the response was YES. Maximal size of possible extension queue 3470. Compared 677654 event pairs, 59934 based on Foata normal form. 0/95087 useless extension candidates. Maximal degree in co-relation 59148. Up to 96840 conditions per place. [2023-08-03 23:22:02,149 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 42 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-08-03 23:22:02,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 252 flow [2023-08-03 23:22:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:22:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:22:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-03 23:22:02,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5861111111111111 [2023-08-03 23:22:02,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-03 23:22:02,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-03 23:22:02,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:22:02,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-03 23:22:02,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2023-08-03 23:22:02,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-03 23:22:02,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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) [2023-08-03 23:22:02,158 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 144 flow. Second operand 3 states and 422 transitions. [2023-08-03 23:22:02,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 252 flow [2023-08-03 23:22:02,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 245 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 23:22:02,160 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 152 flow [2023-08-03 23:22:02,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-03 23:22:02,161 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2023-08-03 23:22:02,161 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 152 flow [2023-08-03 23:22:02,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-03 23:22:02,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:22:02,162 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:22:02,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 23:22:02,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:02,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:22:02,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:22:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1585837728, now seen corresponding path program 1 times [2023-08-03 23:22:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:22:02,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927607621] [2023-08-03 23:22:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:22:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:22:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:22:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927607621] [2023-08-03 23:22:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927607621] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:22:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917097526] [2023-08-03 23:22:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:02,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:22:02,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:22:02,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 23:22:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:02,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:22:02,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:22:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:22:02,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:22:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 23:22:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917097526] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:22:02,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:22:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 23:22:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007646065] [2023-08-03 23:22:02,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:22:02,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:22:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:22:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:22:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 23:22:02,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-03 23:22:02,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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) [2023-08-03 23:22:02,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:22:02,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-03 23:22:02,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:22:08,945 INFO L124 PetriNetUnfolderBase]: 59515/79451 cut-off events. [2023-08-03 23:22:08,945 INFO L125 PetriNetUnfolderBase]: For 3681/3681 co-relation queries the response was YES. [2023-08-03 23:22:09,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159990 conditions, 79451 events. 59515/79451 cut-off events. For 3681/3681 co-relation queries the response was YES. Maximal size of possible extension queue 2900. Compared 500549 event pairs, 38349 based on Foata normal form. 3/74152 useless extension candidates. Maximal degree in co-relation 56835. Up to 75373 conditions per place. [2023-08-03 23:22:09,462 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 40 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-03 23:22:09,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 245 flow [2023-08-03 23:22:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:22:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:22:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-03 23:22:09,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.565625 [2023-08-03 23:22:09,465 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-03 23:22:09,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-03 23:22:09,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:22:09,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-03 23:22:09,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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) [2023-08-03 23:22:09,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:09,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:09,470 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 152 flow. Second operand 4 states and 543 transitions. [2023-08-03 23:22:09,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 245 flow [2023-08-03 23:22:09,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:22:09,472 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 147 flow [2023-08-03 23:22:09,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-03 23:22:09,473 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-03 23:22:09,473 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 147 flow [2023-08-03 23:22:09,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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) [2023-08-03 23:22:09,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:22:09,473 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:22:09,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 23:22:09,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-03 23:22:09,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:22:09,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:22:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1490658377, now seen corresponding path program 1 times [2023-08-03 23:22:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:22:09,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615985918] [2023-08-03 23:22:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:22:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:22:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:22:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615985918] [2023-08-03 23:22:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615985918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:22:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846567314] [2023-08-03 23:22:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:22:09,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:22:09,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:22:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:09,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:22:09,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:22:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:22:09,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:22:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846567314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:22:09,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:22:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 23:22:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909414426] [2023-08-03 23:22:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:22:09,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:22:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:22:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:22:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:22:09,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-03 23:22:09,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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) [2023-08-03 23:22:09,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:22:09,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-03 23:22:09,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:22:15,854 INFO L124 PetriNetUnfolderBase]: 59107/79048 cut-off events. [2023-08-03 23:22:15,854 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2023-08-03 23:22:16,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158976 conditions, 79048 events. 59107/79048 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 2911. Compared 499939 event pairs, 17122 based on Foata normal form. 144/73962 useless extension candidates. Maximal degree in co-relation 56463. Up to 74007 conditions per place. [2023-08-03 23:22:16,352 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-03 23:22:16,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 309 flow [2023-08-03 23:22:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:22:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:22:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-03 23:22:16,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.57 [2023-08-03 23:22:16,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-03 23:22:16,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-03 23:22:16,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:22:16,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-03 23:22:16,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 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) [2023-08-03 23:22:16,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-03 23:22:16,360 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 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) [2023-08-03 23:22:16,360 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 147 flow. Second operand 5 states and 684 transitions. [2023-08-03 23:22:16,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 309 flow [2023-08-03 23:22:16,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 302 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:22:16,362 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 157 flow [2023-08-03 23:22:16,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-08-03 23:22:16,363 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-08-03 23:22:16,363 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 157 flow [2023-08-03 23:22:16,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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) [2023-08-03 23:22:16,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:22:16,364 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:22:16,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 23:22:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:16,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:22:16,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:22:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1810005245, now seen corresponding path program 1 times [2023-08-03 23:22:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:22:16,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996089250] [2023-08-03 23:22:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:22:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:22:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:22:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996089250] [2023-08-03 23:22:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996089250] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:22:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795252062] [2023-08-03 23:22:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:22:16,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:22:16,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:22:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:16,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:22:16,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:22:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:22:16,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:22:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 23:22:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795252062] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:22:16,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:22:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:22:16,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155166021] [2023-08-03 23:22:16,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:22:16,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:22:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:22:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:22:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:22:16,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-03 23:22:16,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-03 23:22:16,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:22:16,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-03 23:22:16,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:22:22,054 INFO L124 PetriNetUnfolderBase]: 49312/65365 cut-off events. [2023-08-03 23:22:22,055 INFO L125 PetriNetUnfolderBase]: For 3493/3493 co-relation queries the response was YES. [2023-08-03 23:22:22,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132012 conditions, 65365 events. 49312/65365 cut-off events. For 3493/3493 co-relation queries the response was YES. Maximal size of possible extension queue 2650. Compared 397464 event pairs, 30214 based on Foata normal form. 36/61215 useless extension candidates. Maximal degree in co-relation 46796. Up to 61204 conditions per place. [2023-08-03 23:22:22,476 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 51 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-03 23:22:22,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 295 flow [2023-08-03 23:22:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:22:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:22:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-03 23:22:22,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5770833333333333 [2023-08-03 23:22:22,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-03 23:22:22,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-03 23:22:22,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:22:22,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-03 23:22:22,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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) [2023-08-03 23:22:22,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:22,480 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:22,480 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 157 flow. Second operand 4 states and 554 transitions. [2023-08-03 23:22:22,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 295 flow [2023-08-03 23:22:22,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 290 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:22:22,483 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 150 flow [2023-08-03 23:22:22,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-03 23:22:22,484 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-08-03 23:22:22,484 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 150 flow [2023-08-03 23:22:22,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-03 23:22:22,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:22:22,484 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:22:22,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 23:22:22,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:22,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 23:22:22,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:22:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1498826847, now seen corresponding path program 1 times [2023-08-03 23:22:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:22:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427486734] [2023-08-03 23:22:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:22:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:22:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:22:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427486734] [2023-08-03 23:22:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427486734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:22:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830281794] [2023-08-03 23:22:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:22:22,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:22:22,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 23:22:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:22,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:22:22,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:22:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:22:22,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:22:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830281794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:22:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:22:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:22:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773050824] [2023-08-03 23:22:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:22:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:22:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:22:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:22:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:22:22,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-03 23:22:22,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 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) [2023-08-03 23:22:22,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:22:22,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-03 23:22:22,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:22:25,631 INFO L124 PetriNetUnfolderBase]: 25984/35557 cut-off events. [2023-08-03 23:22:25,631 INFO L125 PetriNetUnfolderBase]: For 2431/2431 co-relation queries the response was YES. [2023-08-03 23:22:25,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73008 conditions, 35557 events. 25984/35557 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 211964 event pairs, 952 based on Foata normal form. 5184/38715 useless extension candidates. Maximal degree in co-relation 25976. Up to 28224 conditions per place. [2023-08-03 23:22:25,745 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2023-08-03 23:22:25,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 318 flow [2023-08-03 23:22:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:22:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:22:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2023-08-03 23:22:25,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875 [2023-08-03 23:22:25,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2023-08-03 23:22:25,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2023-08-03 23:22:25,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:22:25,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2023-08-03 23:22:25,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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) [2023-08-03 23:22:25,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:25,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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) [2023-08-03 23:22:25,751 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 150 flow. Second operand 4 states and 564 transitions. [2023-08-03 23:22:25,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 318 flow [2023-08-03 23:22:25,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:22:25,902 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2023-08-03 23:22:25,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2023-08-03 23:22:25,903 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-03 23:22:25,903 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2023-08-03 23:22:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 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) [2023-08-03 23:22:25,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 23:22:25,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-03 23:22:25,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 23:22:25,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 23:22:26,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:22:26,106 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:22:26,106 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-03 23:22:26,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 23:22:26,214 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-03 23:22:26,215 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 23:22:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9736 event pairs, 0 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1009. Up to 54 conditions per place. [2023-08-03 23:22:26,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 23:22:26,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 151 transitions, 330 flow [2023-08-03 23:22:26,223 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:22:26,224 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 151 transitions, 330 flow [2023-08-03 23:22:26,224 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 151 transitions, 330 flow [2023-08-03 23:22:26,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 330 flow [2023-08-03 23:22:26,300 INFO L124 PetriNetUnfolderBase]: 93/1400 cut-off events. [2023-08-03 23:22:26,301 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-03 23:22:26,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 1400 events. 93/1400 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9707 event pairs, 0 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-03 23:22:26,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 5856 [2023-08-03 23:22:29,716 INFO L134 LiptonReduction]: Checked pairs total: 17574 [2023-08-03 23:22:29,717 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-03 23:22:29,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:22:29,718 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=true, mAutomataTypeConcurrency=PETRI_NET, 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;@7b86a9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:22:29,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:22:29,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:22:29,722 INFO L124 PetriNetUnfolderBase]: 1/23 cut-off events. [2023-08-03 23:22:29,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:22:29,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:22:29,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 23:22:29,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:22:29,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:22:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1688450468, now seen corresponding path program 1 times [2023-08-03 23:22:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:22:29,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795878188] [2023-08-03 23:22:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:22:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:22:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:22:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:22:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:22:29,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795878188] [2023-08-03 23:22:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795878188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:22:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:22:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:22:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936203501] [2023-08-03 23:22:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:22:29,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:22:29,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:22:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:22:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:22:29,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-03 23:22:29,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-08-03 23:22:29,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:22:29,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-03 23:22:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:23:06,990 INFO L124 PetriNetUnfolderBase]: 378842/489843 cut-off events. [2023-08-03 23:23:06,990 INFO L125 PetriNetUnfolderBase]: For 5265/5265 co-relation queries the response was YES. [2023-08-03 23:23:08,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973046 conditions, 489843 events. 378842/489843 cut-off events. For 5265/5265 co-relation queries the response was YES. Maximal size of possible extension queue 12388. Compared 3279476 event pairs, 313476 based on Foata normal form. 10836/435500 useless extension candidates. Maximal degree in co-relation 280765. Up to 476892 conditions per place. [2023-08-03 23:23:09,754 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 43 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-03 23:23:09,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 224 flow [2023-08-03 23:23:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:23:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:23:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-03 23:23:09,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266418835192069 [2023-08-03 23:23:09,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-03 23:23:09,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-03 23:23:09,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:23:09,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-03 23:23:09,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-08-03 23:23:09,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:23:09,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:23:09,759 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 128 flow. Second operand 3 states and 425 transitions. [2023-08-03 23:23:09,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 224 flow [2023-08-03 23:23:09,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 222 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:23:09,764 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 136 flow [2023-08-03 23:23:09,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-08-03 23:23:09,765 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-03 23:23:09,765 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 136 flow [2023-08-03 23:23:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2023-08-03 23:23:09,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:23:09,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:23:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:23:09,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:23:09,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:23:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1431919099, now seen corresponding path program 1 times [2023-08-03 23:23:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:23:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514192733] [2023-08-03 23:23:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:23:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:23:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:23:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:23:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:23:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514192733] [2023-08-03 23:23:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514192733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:23:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104760914] [2023-08-03 23:23:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:23:09,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:23:09,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:23:09,805 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:23:09,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 23:23:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:23:09,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 23:23:09,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:23:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:23:09,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:23:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104760914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:23:09,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:23:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 23:23:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380237138] [2023-08-03 23:23:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:23:09,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:23:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:23:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:23:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:23:09,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-03 23:23:09,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-03 23:23:09,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:23:09,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-03 23:23:09,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:23:47,219 INFO L124 PetriNetUnfolderBase]: 366838/477148 cut-off events. [2023-08-03 23:23:47,220 INFO L125 PetriNetUnfolderBase]: For 4347/4347 co-relation queries the response was YES. [2023-08-03 23:23:48,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943625 conditions, 477148 events. 366838/477148 cut-off events. For 4347/4347 co-relation queries the response was YES. Maximal size of possible extension queue 12655. Compared 3243695 event pairs, 296770 based on Foata normal form. 0/417087 useless extension candidates. Maximal degree in co-relation 943588. Up to 460105 conditions per place. [2023-08-03 23:23:49,983 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 23:23:49,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 256 flow [2023-08-03 23:23:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:23:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:23:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-03 23:23:49,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315985130111525 [2023-08-03 23:23:49,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-03 23:23:49,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-03 23:23:49,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:23:49,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-03 23:23:49,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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) [2023-08-03 23:23:49,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:23:49,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:23:49,988 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 136 flow. Second operand 3 states and 429 transitions. [2023-08-03 23:23:49,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 256 flow [2023-08-03 23:23:49,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:23:49,990 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 146 flow [2023-08-03 23:23:49,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-03 23:23:49,990 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-08-03 23:23:49,990 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 146 flow [2023-08-03 23:23:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-03 23:23:49,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:23:49,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:23:49,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 23:23:50,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:23:50,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:23:50,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:23:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1459702299, now seen corresponding path program 1 times [2023-08-03 23:23:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:23:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553308844] [2023-08-03 23:23:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:23:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:23:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:23:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:23:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:23:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553308844] [2023-08-03 23:23:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553308844] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:23:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315965515] [2023-08-03 23:23:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:23:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:23:50,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:23:50,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:23:50,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 23:23:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:23:50,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:23:50,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:23:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:23:50,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:23:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 23:23:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315965515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:23:50,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:23:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 23:23:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122867606] [2023-08-03 23:23:50,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:23:50,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:23:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:23:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:23:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 23:23:50,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-03 23:23:50,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-08-03 23:23:50,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:23:50,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-03 23:23:50,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:18,673 INFO L124 PetriNetUnfolderBase]: 286810/369830 cut-off events. [2023-08-03 23:24:18,674 INFO L125 PetriNetUnfolderBase]: For 3564/3564 co-relation queries the response was YES. [2023-08-03 23:24:19,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731791 conditions, 369830 events. 286810/369830 cut-off events. For 3564/3564 co-relation queries the response was YES. Maximal size of possible extension queue 10410. Compared 2405474 event pairs, 193398 based on Foata normal form. 3/324931 useless extension candidates. Maximal degree in co-relation 259480. Up to 356836 conditions per place. [2023-08-03 23:24:21,063 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 47 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-08-03 23:24:21,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 264 flow [2023-08-03 23:24:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-03 23:24:21,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120817843866171 [2023-08-03 23:24:21,065 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-03 23:24:21,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-03 23:24:21,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:21,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-03 23:24:21,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 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) [2023-08-03 23:24:21,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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) [2023-08-03 23:24:21,068 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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) [2023-08-03 23:24:21,068 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 146 flow. Second operand 4 states and 551 transitions. [2023-08-03 23:24:21,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 264 flow [2023-08-03 23:24:21,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:24:21,071 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 158 flow [2023-08-03 23:24:21,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-03 23:24:21,072 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-08-03 23:24:21,072 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 158 flow [2023-08-03 23:24:21,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-08-03 23:24:21,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:21,072 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:21,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 23:24:21,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:21,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:24:21,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 716266149, now seen corresponding path program 1 times [2023-08-03 23:24:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671012841] [2023-08-03 23:24:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671012841] [2023-08-03 23:24:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671012841] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:24:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907968031] [2023-08-03 23:24:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:21,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:24:21,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:24:21,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:24:21,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 23:24:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:21,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:24:21,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:24:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:21,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:24:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:24:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907968031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:24:21,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:24:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:24:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254821770] [2023-08-03 23:24:21,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:24:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:24:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:24:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:24:21,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-03 23:24:21,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-03 23:24:21,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:21,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-03 23:24:21,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:24:47,289 INFO L124 PetriNetUnfolderBase]: 238048/304645 cut-off events. [2023-08-03 23:24:47,289 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2023-08-03 23:24:48,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603004 conditions, 304645 events. 238048/304645 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 9345. Compared 1909506 event pairs, 153634 based on Foata normal form. 36/268671 useless extension candidates. Maximal degree in co-relation 213457. Up to 292876 conditions per place. [2023-08-03 23:24:49,344 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 58 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2023-08-03 23:24:49,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 320 flow [2023-08-03 23:24:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:24:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:24:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-03 23:24:49,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223048327137546 [2023-08-03 23:24:49,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-03 23:24:49,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-03 23:24:49,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:24:49,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-03 23:24:49,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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) [2023-08-03 23:24:49,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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) [2023-08-03 23:24:49,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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) [2023-08-03 23:24:49,350 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 158 flow. Second operand 4 states and 562 transitions. [2023-08-03 23:24:49,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 320 flow [2023-08-03 23:24:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 313 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:24:49,352 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 165 flow [2023-08-03 23:24:49,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-03 23:24:49,353 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-03 23:24:49,353 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 165 flow [2023-08-03 23:24:49,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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) [2023-08-03 23:24:49,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:24:49,353 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:24:49,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 23:24:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 23:24:49,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:24:49,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:24:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 977556934, now seen corresponding path program 1 times [2023-08-03 23:24:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:24:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763971964] [2023-08-03 23:24:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:24:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:24:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:24:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:24:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:24:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763971964] [2023-08-03 23:24:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763971964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:24:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:24:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:24:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127690753] [2023-08-03 23:24:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:24:49,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:24:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:24:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:24:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:24:49,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 269 [2023-08-03 23:24:49,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-03 23:24:49,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:24:49,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 269 [2023-08-03 23:24:49,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:25:10,186 INFO L124 PetriNetUnfolderBase]: 214312/276013 cut-off events. [2023-08-03 23:25:10,187 INFO L125 PetriNetUnfolderBase]: For 3502/3502 co-relation queries the response was YES. [2023-08-03 23:25:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544812 conditions, 276013 events. 214312/276013 cut-off events. For 3502/3502 co-relation queries the response was YES. Maximal size of possible extension queue 8812. Compared 1745295 event pairs, 34888 based on Foata normal form. 0/248787 useless extension candidates. Maximal degree in co-relation 192876. Up to 249409 conditions per place. [2023-08-03 23:25:12,082 INFO L140 encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-03 23:25:12,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 340 flow [2023-08-03 23:25:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:25:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:25:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-03 23:25:12,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588599752168525 [2023-08-03 23:25:12,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-03 23:25:12,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-03 23:25:12,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:25:12,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-03 23:25:12,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2023-08-03 23:25:12,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:25:12,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:25:12,086 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 165 flow. Second operand 3 states and 451 transitions. [2023-08-03 23:25:12,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 340 flow [2023-08-03 23:25:12,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:25:12,089 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 179 flow [2023-08-03 23:25:12,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-03 23:25:12,090 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-03 23:25:12,090 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 179 flow [2023-08-03 23:25:12,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-03 23:25:12,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:25:12,090 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:25:12,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 23:25:12,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:25:12,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:25:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 239529262, now seen corresponding path program 1 times [2023-08-03 23:25:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:25:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273499939] [2023-08-03 23:25:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:25:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:25:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:25:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 23:25:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:25:12,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273499939] [2023-08-03 23:25:12,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273499939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:25:12,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:25:12,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:25:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886092610] [2023-08-03 23:25:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:25:12,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:25:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:25:12,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:25:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:25:12,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269 [2023-08-03 23:25:12,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-08-03 23:25:12,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:25:12,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269 [2023-08-03 23:25:12,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:25:34,121 INFO L124 PetriNetUnfolderBase]: 211864/268669 cut-off events. [2023-08-03 23:25:34,121 INFO L125 PetriNetUnfolderBase]: For 14245/14245 co-relation queries the response was YES. [2023-08-03 23:25:35,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562948 conditions, 268669 events. 211864/268669 cut-off events. For 14245/14245 co-relation queries the response was YES. Maximal size of possible extension queue 8638. Compared 1641635 event pairs, 174592 based on Foata normal form. 0/239427 useless extension candidates. Maximal degree in co-relation 198729. Up to 257980 conditions per place. [2023-08-03 23:25:36,101 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 59 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-03 23:25:36,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 336 flow [2023-08-03 23:25:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:25:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:25:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-03 23:25:36,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415117719950434 [2023-08-03 23:25:36,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-03 23:25:36,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-03 23:25:36,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:25:36,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-03 23:25:36,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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) [2023-08-03 23:25:36,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:25:36,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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) [2023-08-03 23:25:36,105 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 179 flow. Second operand 3 states and 437 transitions. [2023-08-03 23:25:36,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 336 flow [2023-08-03 23:25:36,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:25:36,108 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 190 flow [2023-08-03 23:25:36,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2023-08-03 23:25:36,109 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-08-03 23:25:36,109 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 190 flow [2023-08-03 23:25:36,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-08-03 23:25:36,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:25:36,110 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:25:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 23:25:36,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:25:36,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:25:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 249490122, now seen corresponding path program 1 times [2023-08-03 23:25:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:25:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350896849] [2023-08-03 23:25:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:25:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:25:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:25:36,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:25:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:25:36,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:25:36,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:25:36,178 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:25:36,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:25:36,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:25:36,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:25:36,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 23:25:36,179 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:25:36,179 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:25:36,182 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:25:36,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:25:36,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:25:36 BasicIcfg [2023-08-03 23:25:36,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:25:36,253 INFO L158 Benchmark]: Toolchain (without parser) took 251803.52ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 543.2MB in the beginning and 9.8GB in the end (delta: -9.3GB). Peak memory consumption was 6.1GB. Max. memory is 16.0GB. [2023-08-03 23:25:36,254 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 289.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:25:36,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.54ms. Allocated memory is still 595.6MB. Free memory was 543.2MB in the beginning and 519.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 23:25:36,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.69ms. Allocated memory is still 595.6MB. Free memory was 519.0MB in the beginning and 516.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:25:36,254 INFO L158 Benchmark]: Boogie Preprocessor took 31.50ms. Allocated memory is still 595.6MB. Free memory was 516.3MB in the beginning and 514.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:25:36,254 INFO L158 Benchmark]: RCFGBuilder took 648.35ms. Allocated memory is still 595.6MB. Free memory was 513.9MB in the beginning and 535.1MB in the end (delta: -21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 23:25:36,255 INFO L158 Benchmark]: TraceAbstraction took 250516.62ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 534.1MB in the beginning and 9.8GB in the end (delta: -9.3GB). Peak memory consumption was 6.1GB. Max. memory is 16.0GB. [2023-08-03 23:25:36,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 289.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 534.54ms. Allocated memory is still 595.6MB. Free memory was 543.2MB in the beginning and 519.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.69ms. Allocated memory is still 595.6MB. Free memory was 519.0MB in the beginning and 516.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.50ms. Allocated memory is still 595.6MB. Free memory was 516.3MB in the beginning and 514.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 648.35ms. Allocated memory is still 595.6MB. Free memory was 513.9MB in the beginning and 535.1MB in the end (delta: -21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 250516.62ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 534.1MB in the beginning and 9.8GB in the end (delta: -9.3GB). Peak memory consumption was 6.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 105 PlacesBefore, 33 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 2987 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1732, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 645, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1732, independent: 989, independent conditional: 0, independent unconditional: 989, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 645, unknown conditional: 0, unknown unconditional: 645] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 135 PlacesBefore, 57 PlacesAfterwards, 124 TransitionsBefore, 44 TransitionsAfterwards, 3492 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 11359 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5088, independent: 4832, independent conditional: 0, independent unconditional: 4832, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1691, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5088, independent: 3171, independent conditional: 0, independent unconditional: 3171, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 1691, unknown conditional: 0, unknown unconditional: 1691] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 290, Positive conditional cache size: 0, Positive unconditional cache size: 290, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 159 PlacesBefore, 62 PlacesAfterwards, 151 TransitionsBefore, 50 TransitionsAfterwards, 5856 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 17574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7611, independent: 7307, independent conditional: 0, independent unconditional: 7307, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3012, independent: 2955, independent conditional: 0, independent unconditional: 2955, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7611, independent: 4352, independent conditional: 0, independent unconditional: 4352, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 3012, unknown conditional: 0, unknown unconditional: 3012] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500[2]; [L842] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t500[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500[asdf], ((void *)0), P0, ((void *)0))=-5, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L842] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t500[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500[asdf], ((void *)0), P0, ((void *)0))=-4, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L842] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L842] COND FALSE 0 !(asdf<2) [L843] 0 pthread_t t501[2]; [L844] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t501[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501[asdf], ((void *)0), P1, ((void *)0))=-3, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND TRUE 0 asdf<2 [L844] FCALL, FORK 0 pthread_create(&t501[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501[asdf], ((void *)0), P1, ((void *)0))=-2, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] COND FALSE 0 !(asdf<2) [L845] 0 pthread_t t502[2]; [L846] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t502[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502[asdf], ((void *)0), P2, ((void *)0))=-1, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 5 y$w_buff1 = y$w_buff0 [L789] 5 y$w_buff0 = 1 [L790] 5 y$w_buff1_used = y$w_buff0_used [L791] 5 y$w_buff0_used = (_Bool)1 [L792] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L792] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t502[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502[asdf], ((void *)0), P2, ((void *)0))=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 6 y$w_buff1 = y$w_buff0 [L789] 6 y$w_buff0 = 1 [L790] 6 y$w_buff1_used = y$w_buff0_used [L791] 6 y$w_buff0_used = (_Bool)1 [L792] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 10 procedures, 173 locations, 7 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: 56.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 10 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 28, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 995 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 135/150 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 10 procedures, 173 locations, 7 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: 190.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 185.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 24 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 23:25:36,276 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...