/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:06:09,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:06:09,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:06:09,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:06:09,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:06:09,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:06:09,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:06:09,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:06:09,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:06:09,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:06:09,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:06:09,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:06:09,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:06:09,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:06:09,701 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:06:09,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:06:09,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:06:09,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:06:09,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:09,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:09,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:06:09,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:06:09,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:06:09,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:06:09,704 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:06:09,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:06:09,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:06:09,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:06:09,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:06:09,957 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:06:09,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-13 21:06:11,315 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e137bd85/632f8a39411a413f9133c354eacb6ea6/FLAG4a25de729 [2025-04-13 21:06:11,510 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:06:11,511 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-13 21:06:11,522 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e137bd85/632f8a39411a413f9133c354eacb6ea6/FLAG4a25de729 [2025-04-13 21:06:12,364 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e137bd85/632f8a39411a413f9133c354eacb6ea6 [2025-04-13 21:06:12,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:06:12,367 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:06:12,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:12,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:06:12,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:06:12,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51176fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12, skipping insertion in model container [2025-04-13 21:06:12,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:06:12,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-04-13 21:06:12,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-04-13 21:06:12,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-04-13 21:06:12,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:12,646 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:06:12,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-04-13 21:06:12,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-04-13 21:06:12,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-04-13 21:06:12,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:12,739 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:06:12,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12 WrapperNode [2025-04-13 21:06:12,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:12,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:12,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:06:12,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:06:12,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,772 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-04-13 21:06:12,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:12,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:06:12,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:06:12,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:06:12,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,800 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-04-13 21:06:12,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:06:12,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:06:12,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:06:12,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:06:12,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:12,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:06:12,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:06:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:06:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:06:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:06:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:06:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:06:12,862 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:06:12,984 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:06:12,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:06:13,194 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:06:13,195 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:06:13,195 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:06:13,494 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:13,496 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:13,500 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:06:13,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:13 BoogieIcfgContainer [2025-04-13 21:06:13,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:06:13,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:06:13,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:06:13,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:06:13,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:06:12" (1/3) ... [2025-04-13 21:06:13,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56057d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:13, skipping insertion in model container [2025-04-13 21:06:13,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (2/3) ... [2025-04-13 21:06:13,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56057d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:13, skipping insertion in model container [2025-04-13 21:06:13,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:13" (3/3) ... [2025-04-13 21:06:13,507 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-04-13 21:06:13,517 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:06:13,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 24 locations, 25 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 21:06:13,518 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:06:13,567 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:06:13,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-13 21:06:13,636 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 21:06:13,638 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:06:13,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 46 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-13 21:06:13,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-13 21:06:13,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 55 flow [2025-04-13 21:06:13,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:06:13,661 INFO L340 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@36a38727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:06:13,662 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 21:06:13,669 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:06:13,669 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 21:06:13,669 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:06:13,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:13,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 21:06:13,670 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:13,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 384443970, now seen corresponding path program 1 times [2025-04-13 21:06:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:13,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154672753] [2025-04-13 21:06:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:13,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 21:06:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 21:06:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:13,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154672753] [2025-04-13 21:06:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154672753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:06:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412121478] [2025-04-13 21:06:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:06:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:06:14,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:06:14,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:14,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 55 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:14,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,182 INFO L116 PetriNetUnfolderBase]: 169/289 cut-off events. [2025-04-13 21:06:14,182 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 21:06:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 289 events. 169/289 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 883 event pairs, 138 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 560. Up to 290 conditions per place. [2025-04-13 21:06:14,187 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 20 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-04-13 21:06:14,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 89 flow [2025-04-13 21:06:14,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:06:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:06:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2025-04-13 21:06:14,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:06:14,198 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 55 flow. Second operand 2 states and 27 transitions. [2025-04-13 21:06:14,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 89 flow [2025-04-13 21:06:14,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:06:14,204 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-04-13 21:06:14,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-13 21:06:14,209 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-04-13 21:06:14,209 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-04-13 21:06:14,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 21:06:14,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:06:14,210 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:14,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash 384443971, now seen corresponding path program 1 times [2025-04-13 21:06:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025400214] [2025-04-13 21:06:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 21:06:14,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 21:06:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025400214] [2025-04-13 21:06:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025400214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:06:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569940571] [2025-04-13 21:06:14,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:14,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:14,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:14,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:14,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,550 INFO L116 PetriNetUnfolderBase]: 215/367 cut-off events. [2025-04-13 21:06:14,551 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:06:14,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 367 events. 215/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1247 event pairs, 48 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 753. Up to 265 conditions per place. [2025-04-13 21:06:14,553 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-13 21:06:14,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 32 transitions, 134 flow [2025-04-13 21:06:14,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 21:06:14,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-13 21:06:14,555 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 44 flow. Second operand 3 states and 39 transitions. [2025-04-13 21:06:14,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 32 transitions, 134 flow [2025-04-13 21:06:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:06:14,557 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-13 21:06:14,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-13 21:06:14,558 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2025-04-13 21:06:14,558 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-13 21:06:14,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:14,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:06:14,558 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:14,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash 70169448, now seen corresponding path program 1 times [2025-04-13 21:06:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651368154] [2025-04-13 21:06:14,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:06:14,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:06:14,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651368154] [2025-04-13 21:06:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651368154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:06:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697141505] [2025-04-13 21:06:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:14,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:14,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:14,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,729 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 21:06:14,729 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 21:06:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 352 events. 206/352 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1189 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 784. Up to 263 conditions per place. [2025-04-13 21:06:14,732 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 21:06:14,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 140 flow [2025-04-13 21:06:14,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 21:06:14,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-13 21:06:14,735 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 3 states and 38 transitions. [2025-04-13 21:06:14,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 140 flow [2025-04-13 21:06:14,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:14,736 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 62 flow [2025-04-13 21:06:14,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2025-04-13 21:06:14,736 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-04-13 21:06:14,736 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 62 flow [2025-04-13 21:06:14,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:14,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:06:14,737 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:14,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1378144185, now seen corresponding path program 1 times [2025-04-13 21:06:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349563104] [2025-04-13 21:06:14,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:06:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:06:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:15,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349563104] [2025-04-13 21:06:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349563104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:15,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956826277] [2025-04-13 21:06:15,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:15,019 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) [2025-04-13 21:06:15,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:06:15,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:06:15,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:06:15,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:15,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:06:15,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:15,244 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-13 21:06:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:15,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956826277] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:15,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:06:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 8 [2025-04-13 21:06:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868192575] [2025-04-13 21:06:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:15,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:15,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:15,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:06:15,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:15,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:15,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:15,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:15,678 INFO L116 PetriNetUnfolderBase]: 315/535 cut-off events. [2025-04-13 21:06:15,678 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 21:06:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 535 events. 315/535 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1995 event pairs, 106 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 1207. Up to 273 conditions per place. [2025-04-13 21:06:15,681 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 4 changer transitions 1/36 dead transitions. [2025-04-13 21:06:15,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 174 flow [2025-04-13 21:06:15,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 21:06:15,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2025-04-13 21:06:15,685 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 62 flow. Second operand 3 states and 41 transitions. [2025-04-13 21:06:15,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 174 flow [2025-04-13 21:06:15,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:06:15,686 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 93 flow [2025-04-13 21:06:15,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-13 21:06:15,687 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2025-04-13 21:06:15,687 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 93 flow [2025-04-13 21:06:15,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:15,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:15,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 21:06:15,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:15,888 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:15,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1494349130, now seen corresponding path program 1 times [2025-04-13 21:06:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:15,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142814851] [2025-04-13 21:06:15,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:15,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:06:15,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:06:15,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:15,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:15,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142814851] [2025-04-13 21:06:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142814851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:15,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:15,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113364776] [2025-04-13 21:06:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:15,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:15,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:15,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:15,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:15,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:15,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:15,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:16,059 INFO L116 PetriNetUnfolderBase]: 214/385 cut-off events. [2025-04-13 21:06:16,059 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 21:06:16,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 385 events. 214/385 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1422 event pairs, 75 based on Foata normal form. 28/359 useless extension candidates. Maximal degree in co-relation 929. Up to 223 conditions per place. [2025-04-13 21:06:16,061 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 21:06:16,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 184 flow [2025-04-13 21:06:16,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 21:06:16,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-13 21:06:16,062 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 93 flow. Second operand 3 states and 38 transitions. [2025-04-13 21:06:16,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 184 flow [2025-04-13 21:06:16,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:06:16,066 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 93 flow [2025-04-13 21:06:16,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-13 21:06:16,068 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2025-04-13 21:06:16,068 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 93 flow [2025-04-13 21:06:16,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:16,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:16,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:06:16,068 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:16,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash 916151373, now seen corresponding path program 1 times [2025-04-13 21:06:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:16,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946082017] [2025-04-13 21:06:16,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:16,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:16,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:16,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:16,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728016520] [2025-04-13 21:06:16,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:16,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:16,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:16,102 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) [2025-04-13 21:06:16,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:06:16,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:16,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:16,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:16,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:16,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:06:16,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:16,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 21:06:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:16,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:16,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946082017] [2025-04-13 21:06:16,443 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:16,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728016520] [2025-04-13 21:06:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728016520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209251984] [2025-04-13 21:06:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:16,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:06:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:06:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:06:16,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:16,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-13 21:06:16,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:16,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:16,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:16,648 INFO L116 PetriNetUnfolderBase]: 292/524 cut-off events. [2025-04-13 21:06:16,649 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 21:06:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 524 events. 292/524 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2035 event pairs, 41 based on Foata normal form. 7/448 useless extension candidates. Maximal degree in co-relation 1318. Up to 294 conditions per place. [2025-04-13 21:06:16,651 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 50 selfloop transitions, 6 changer transitions 3/59 dead transitions. [2025-04-13 21:06:16,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 59 transitions, 318 flow [2025-04-13 21:06:16,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:06:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:06:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 21:06:16,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-13 21:06:16,653 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 93 flow. Second operand 5 states and 65 transitions. [2025-04-13 21:06:16,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 59 transitions, 318 flow [2025-04-13 21:06:16,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 59 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:16,655 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 121 flow [2025-04-13 21:06:16,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-04-13 21:06:16,656 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2025-04-13 21:06:16,656 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 121 flow [2025-04-13 21:06:16,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-13 21:06:16,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:16,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:16,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:16,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 21:06:16,857 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:16,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 121152647, now seen corresponding path program 1 times [2025-04-13 21:06:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:16,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656085809] [2025-04-13 21:06:16,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:16,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:16,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:16,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:16,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398015144] [2025-04-13 21:06:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:16,955 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) [2025-04-13 21:06:16,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:06:17,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:17,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 21:06:17,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:17,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:06:17,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:06:17,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 21:06:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:17,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:18,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-13 21:06:18,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 21:06:19,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 279 [2025-04-13 21:06:19,820 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-13 21:06:19,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 279 treesize of output 463 [2025-04-13 21:06:23,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:06:23,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 723 treesize of output 651 [2025-04-13 21:06:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:25,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656085809] [2025-04-13 21:06:25,368 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:25,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398015144] [2025-04-13 21:06:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398015144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:25,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:06:25,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-13 21:06:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636911111] [2025-04-13 21:06:25,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:25,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:06:25,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:25,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:06:25,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:06:25,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:25,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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) [2025-04-13 21:06:25,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:25,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:27,220 INFO L116 PetriNetUnfolderBase]: 530/929 cut-off events. [2025-04-13 21:06:27,220 INFO L117 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2025-04-13 21:06:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 929 events. 530/929 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3941 event pairs, 31 based on Foata normal form. 36/806 useless extension candidates. Maximal degree in co-relation 2338. Up to 171 conditions per place. [2025-04-13 21:06:27,223 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 94 selfloop transitions, 27 changer transitions 18/139 dead transitions. [2025-04-13 21:06:27,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 139 transitions, 741 flow [2025-04-13 21:06:27,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:06:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:06:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2025-04-13 21:06:27,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2025-04-13 21:06:27,224 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 121 flow. Second operand 14 states and 173 transitions. [2025-04-13 21:06:27,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 139 transitions, 741 flow [2025-04-13 21:06:27,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 139 transitions, 728 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:06:27,228 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 355 flow [2025-04-13 21:06:27,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=355, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-04-13 21:06:27,228 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2025-04-13 21:06:27,228 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 355 flow [2025-04-13 21:06:27,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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) [2025-04-13 21:06:27,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:27,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:27,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:27,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:27,429 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:27,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 246096775, now seen corresponding path program 1 times [2025-04-13 21:06:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:27,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947808094] [2025-04-13 21:06:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:27,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:27,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947808094] [2025-04-13 21:06:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947808094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460919313] [2025-04-13 21:06:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:27,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:06:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:27,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:06:27,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:06:27,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:06:27,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:27,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:27,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:06:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:27,796 INFO L116 PetriNetUnfolderBase]: 501/894 cut-off events. [2025-04-13 21:06:27,796 INFO L117 PetriNetUnfolderBase]: For 1594/1594 co-relation queries the response was YES. [2025-04-13 21:06:27,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 894 events. 501/894 cut-off events. For 1594/1594 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3809 event pairs, 122 based on Foata normal form. 6/821 useless extension candidates. Maximal degree in co-relation 2770. Up to 797 conditions per place. [2025-04-13 21:06:27,800 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 58 selfloop transitions, 4 changer transitions 3/65 dead transitions. [2025-04-13 21:06:27,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 517 flow [2025-04-13 21:06:27,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:06:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:06:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-13 21:06:27,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-13 21:06:27,802 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 355 flow. Second operand 5 states and 50 transitions. [2025-04-13 21:06:27,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 517 flow [2025-04-13 21:06:27,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 482 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:27,808 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 299 flow [2025-04-13 21:06:27,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-04-13 21:06:27,808 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-04-13 21:06:27,808 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 299 flow [2025-04-13 21:06:27,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:27,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:27,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:27,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:06:27,809 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:06:27,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1222615148, now seen corresponding path program 1 times [2025-04-13 21:06:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:27,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348140504] [2025-04-13 21:06:27,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:06:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:06:27,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:27,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:27,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791957869] [2025-04-13 21:06:27,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:27,886 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) [2025-04-13 21:06:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:06:27,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:06:28,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:06:28,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:28,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 21:06:28,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:28,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:06:28,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2025-04-13 21:06:28,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:06:28,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-13 21:06:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:28,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:49,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2025-04-13 21:06:49,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2025-04-13 21:06:49,225 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:06:49,226 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:06:49,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 926 treesize of output 811 [2025-04-13 21:07:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:02,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348140504] [2025-04-13 21:07:02,274 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:07:02,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791957869] [2025-04-13 21:07:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791957869] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:02,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:07:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-04-13 21:07:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777870442] [2025-04-13 21:07:02,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:02,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:07:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:07:02,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:07:02,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:07:02,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 299 flow. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 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) [2025-04-13 21:07:02,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:02,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:07:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:11,420 WARN L286 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 350 DAG size of output: 223 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:07:34,432 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 295 DAG size of output: 214 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:07:35,692 INFO L116 PetriNetUnfolderBase]: 668/1210 cut-off events. [2025-04-13 21:07:35,692 INFO L117 PetriNetUnfolderBase]: For 2595/2595 co-relation queries the response was YES. [2025-04-13 21:07:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 1210 events. 668/1210 cut-off events. For 2595/2595 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5614 event pairs, 44 based on Foata normal form. 24/1234 useless extension candidates. Maximal degree in co-relation 3697. Up to 236 conditions per place. [2025-04-13 21:07:35,697 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 121 selfloop transitions, 45 changer transitions 13/179 dead transitions. [2025-04-13 21:07:35,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 179 transitions, 1215 flow [2025-04-13 21:07:35,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:07:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:07:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-04-13 21:07:35,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-13 21:07:35,699 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 299 flow. Second operand 17 states and 189 transitions. [2025-04-13 21:07:35,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 179 transitions, 1215 flow [2025-04-13 21:07:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 179 transitions, 1209 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:07:35,706 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 660 flow [2025-04-13 21:07:35,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=660, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-04-13 21:07:35,706 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 49 predicate places. [2025-04-13 21:07:35,706 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 660 flow [2025-04-13 21:07:35,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 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) [2025-04-13 21:07:35,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:35,706 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:35,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:07:35,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:35,911 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:07:35,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1805193072, now seen corresponding path program 2 times [2025-04-13 21:07:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:35,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738397566] [2025-04-13 21:07:35,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:35,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 21:07:36,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:07:36,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:36,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:07:36,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569515556] [2025-04-13 21:07:36,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:36,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:36,106 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) [2025-04-13 21:07:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:07:36,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 21:07:36,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:07:36,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:36,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:36,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 21:07:36,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:36,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:07:36,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2025-04-13 21:07:36,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:07:36,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-13 21:07:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:36,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:56,668 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-13 21:07:56,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 791 [2025-04-13 21:07:58,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 21:07:58,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2025-04-13 21:08:15,373 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-13 21:08:15,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 791 [2025-04-13 21:08:16,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 21:08:16,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2025-04-13 21:08:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:27,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738397566] [2025-04-13 21:08:27,380 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:08:27,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569515556] [2025-04-13 21:08:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569515556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:27,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:08:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2025-04-13 21:08:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209213863] [2025-04-13 21:08:27,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:27,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:08:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:27,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:08:27,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:08:27,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-13 21:08:27,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 660 flow. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 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) [2025-04-13 21:08:27,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:27,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-13 21:08:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:49,995 WARN L286 SmtUtils]: Spent 21.98s on a formula simplification. DAG size of input: 506 DAG size of output: 294 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:03,676 WARN L286 SmtUtils]: Spent 13.19s on a formula simplification. DAG size of input: 364 DAG size of output: 274 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:24,434 WARN L286 SmtUtils]: Spent 18.18s on a formula simplification. DAG size of input: 456 DAG size of output: 278 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:36,423 WARN L286 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 259 DAG size of output: 243 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:44,526 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 335 DAG size of output: 305 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:10:04,498 WARN L286 SmtUtils]: Spent 19.75s on a formula simplification. DAG size of input: 506 DAG size of output: 279 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:10:25,563 WARN L286 SmtUtils]: Spent 17.38s on a formula simplification. DAG size of input: 364 DAG size of output: 262 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:10:39,233 WARN L286 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 364 DAG size of output: 273 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:10,957 WARN L286 SmtUtils]: Spent 25.14s on a formula simplification. DAG size of input: 402 DAG size of output: 285 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:26,139 WARN L286 SmtUtils]: Spent 13.86s on a formula simplification. DAG size of input: 352 DAG size of output: 241 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:35,429 WARN L286 SmtUtils]: Spent 8.82s on a formula simplification. DAG size of input: 265 DAG size of output: 227 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:45,139 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 265 DAG size of output: 228 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:53,328 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 265 DAG size of output: 217 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:00,274 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 265 DAG size of output: 226 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:01,099 INFO L116 PetriNetUnfolderBase]: 1658/3008 cut-off events. [2025-04-13 21:12:01,099 INFO L117 PetriNetUnfolderBase]: For 17605/17605 co-relation queries the response was YES. [2025-04-13 21:12:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11337 conditions, 3008 events. 1658/3008 cut-off events. For 17605/17605 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16104 event pairs, 113 based on Foata normal form. 60/3068 useless extension candidates. Maximal degree in co-relation 11309. Up to 767 conditions per place. [2025-04-13 21:12:01,111 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 227 selfloop transitions, 119 changer transitions 35/381 dead transitions. [2025-04-13 21:12:01,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 381 transitions, 3438 flow [2025-04-13 21:12:01,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 21:12:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 21:12:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 357 transitions. [2025-04-13 21:12:01,114 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2025-04-13 21:12:01,114 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 660 flow. Second operand 32 states and 357 transitions. [2025-04-13 21:12:01,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 381 transitions, 3438 flow [2025-04-13 21:12:01,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 381 transitions, 3337 flow, removed 44 selfloop flow, removed 4 redundant places. [2025-04-13 21:12:01,159 INFO L231 Difference]: Finished difference. Result has 123 places, 172 transitions, 2184 flow [2025-04-13 21:12:01,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2184, PETRI_PLACES=123, PETRI_TRANSITIONS=172} [2025-04-13 21:12:01,160 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 97 predicate places. [2025-04-13 21:12:01,160 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 172 transitions, 2184 flow [2025-04-13 21:12:01,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 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) [2025-04-13 21:12:01,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:12:01,160 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:12:01,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:12:01,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 21:12:01,360 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:12:01,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:12:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 490978617, now seen corresponding path program 3 times [2025-04-13 21:12:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:12:01,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082033023] [2025-04-13 21:12:01,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:12:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:12:01,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 21:12:01,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:12:01,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:12:01,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:12:01,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801741287] [2025-04-13 21:12:01,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:12:01,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:12:01,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:12:01,551 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) [2025-04-13 21:12:01,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:12:01,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 21:12:01,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:12:01,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:12:01,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:12:01,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 21:12:01,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:12:02,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 21:12:02,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:12:02,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:12:02,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-13 21:12:02,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:12:02,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:12:02,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:12:02,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-04-13 21:12:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:12:02,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:13:37,016 WARN L286 SmtUtils]: Spent 41.03s on a formula simplification. DAG size of input: 362 DAG size of output: 362 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:16:06,363 WARN L286 SmtUtils]: Spent 43.12s on a formula simplification that was a NOOP. DAG size: 419 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:17:25,368 WARN L286 SmtUtils]: Spent 43.36s on a formula simplification that was a NOOP. DAG size: 424 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:18:36,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 105 [2025-04-13 21:18:37,397 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:18:37,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-13 21:18:38,283 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:18:38,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-04-13 21:18:39,363 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:18:39,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-04-13 21:18:39,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:18:39,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-04-13 21:18:41,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4884 treesize of output 4722 [2025-04-13 21:18:43,280 INFO L325 Elim1Store]: treesize reduction 88, result has 47.9 percent of original size [2025-04-13 21:18:43,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 7558 treesize of output 6934 Received shutdown request... [2025-04-13 21:20:44,415 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:20:44,416 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:20:44,610 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 21:20:44,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:20:44,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:44,811 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. [2025-04-13 21:20:44,812 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 21:20:44,813 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 21:20:44,813 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:44,816 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:20:44,816 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:20:44,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:20:44 BasicIcfg [2025-04-13 21:20:44,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:20:44,818 INFO L158 Benchmark]: Toolchain (without parser) took 872451.18ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 84.5MB in the beginning and 365.3MB in the end (delta: -280.8MB). Peak memory consumption was 527.0MB. Max. memory is 8.0GB. [2025-04-13 21:20:44,818 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:20:44,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.84ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 60.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:20:44,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.80ms. Allocated memory is still 125.8MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:20:44,819 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 125.8MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:20:44,819 INFO L158 Benchmark]: RCFGBuilder took 684.73ms. Allocated memory is still 125.8MB. Free memory was 56.0MB in the beginning and 38.1MB in the end (delta: 17.9MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. [2025-04-13 21:20:44,819 INFO L158 Benchmark]: TraceAbstraction took 871315.09ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 37.5MB in the beginning and 365.3MB in the end (delta: -327.8MB). Peak memory consumption was 478.4MB. Max. memory is 8.0GB. [2025-04-13 21:20:44,820 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.17ms. Allocated memory is still 159.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 371.84ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 60.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.80ms. Allocated memory is still 125.8MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 125.8MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 684.73ms. Allocated memory is still 125.8MB. Free memory was 56.0MB in the beginning and 38.1MB in the end (delta: 17.9MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. * TraceAbstraction took 871315.09ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 37.5MB in the beginning and 365.3MB in the end (delta: -327.8MB). Peak memory consumption was 478.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-27-6-2-7-3-7-3-9-4-4-4-5-3-5-4-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 41 locations, 48 edges, 8 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: 871.2s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 250.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 839 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 839 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1940 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 0 mSDtfsCounter, 1940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 255.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2184occurred in iteration=10, InterpolantAutomatonStates: 87, 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, 1.0s SatisfiabilityAnalysisTime, 95.1s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 39192 SizeOfPredicates, 73 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 2/36 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown