/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 FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:00:28,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:00:28,679 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 17:00:28,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:00:28,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:00:28,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:00:28,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:00:28,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:00:28,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:00:28,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:00:28,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:00:28,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:00:28,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:00:28,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:00:28,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:00:28,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:00:28,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:00:28,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:00:28,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:00:28,712 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 -> FINITE_AUTOMATA [2025-04-13 17:00:28,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:00:28,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:00:28,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:00:28,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:00:28,931 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:00:28,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2025-04-13 17:00:30,167 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb35b2c3/d9396c323d414a20af8371d111eff3df/FLAGc5d9b5f41 [2025-04-13 17:00:30,385 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:00:30,385 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2025-04-13 17:00:30,403 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb35b2c3/d9396c323d414a20af8371d111eff3df/FLAGc5d9b5f41 [2025-04-13 17:00:31,167 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb35b2c3/d9396c323d414a20af8371d111eff3df [2025-04-13 17:00:31,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:00:31,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:00:31,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:00:31,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:00:31,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:00:31,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1802bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31, skipping insertion in model container [2025-04-13 17:00:31,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:00:31,527 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/queue_ok_longest.i[43280,43293] [2025-04-13 17:00:31,533 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/queue_ok_longest.i[43553,43566] [2025-04-13 17:00:31,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:00:31,578 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:00:31,643 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/queue_ok_longest.i[43280,43293] [2025-04-13 17:00:31,648 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/queue_ok_longest.i[43553,43566] [2025-04-13 17:00:31,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:00:31,740 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:00:31,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31 WrapperNode [2025-04-13 17:00:31,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:00:31,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:00:31,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:00:31,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:00:31,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,867 INFO L138 Inliner]: procedures = 274, calls = 1652, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 1791 [2025-04-13 17:00:31,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:00:31,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:00:31,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:00:31,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:00:31,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,929 INFO L175 MemorySlicer]: Split 1635 memory accesses to 4 slices as follows [2, 5, 802, 826]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 5, 800, 803]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-04-13 17:00:31,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:31,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:00:31,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:00:31,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:00:31,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:00:32,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (1/1) ... [2025-04-13 17:00:32,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:00:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:00:32,025 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 17:00:32,028 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 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 17:00:32,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 17:00:32,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:00:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:00:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:00:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:00:32,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:00:32,046 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 17:00:32,156 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:00:32,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:00:33,665 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:00:33,666 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:00:33,666 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:01:14,818 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:01:14,847 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:01:14,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:01:14 BoogieIcfgContainer [2025-04-13 17:01:14,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:01:15,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:01:15,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:01:15,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:01:15,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:00:31" (1/3) ... [2025-04-13 17:01:15,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe56f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:01:15, skipping insertion in model container [2025-04-13 17:01:15,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:00:31" (2/3) ... [2025-04-13 17:01:15,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe56f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:01:15, skipping insertion in model container [2025-04-13 17:01:15,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:01:14" (3/3) ... [2025-04-13 17:01:15,025 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2025-04-13 17:01:15,037 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:01:15,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longest.i that has 3 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 17:01:15,038 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:01:15,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:01:15,155 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 17:01:15,167 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 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 17:01:15,183 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:01:15,192 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=FINITE_AUTOMATA, 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;@514da013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:01:15,192 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:01:15,195 INFO L278 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 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 17:01:15,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 17:01:15,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:15,199 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 17:01:15,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:15,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:15,202 INFO L85 PathProgramCache]: Analyzing trace with hash 3734, now seen corresponding path program 1 times [2025-04-13 17:01:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:15,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039524413] [2025-04-13 17:01:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:01:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:15,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 17:01:15,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 17:01:15,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:01:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:15,291 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 17:01:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:15,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039524413] [2025-04-13 17:01:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039524413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:01:15,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:01:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 17:01:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237120372] [2025-04-13 17:01:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:01:15,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:01:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:15,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:01:15,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:01:15,312 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 17:01:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:15,586 INFO L93 Difference]: Finished difference Result 92 states and 243 transitions. [2025-04-13 17:01:15,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:01:15,588 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1 [2025-04-13 17:01:15,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:15,595 INFO L225 Difference]: With dead ends: 92 [2025-04-13 17:01:15,596 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 17:01:15,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:01:15,600 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:15,601 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:01:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 17:01:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-13 17:01:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.688888888888889) internal successors, (242), 90 states have internal predecessors, (242), 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 17:01:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 242 transitions. [2025-04-13 17:01:15,627 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 242 transitions. Word has length 1 [2025-04-13 17:01:15,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:15,627 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 242 transitions. [2025-04-13 17:01:15,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 17:01:15,627 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 242 transitions. [2025-04-13 17:01:15,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:01:15,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:15,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:15,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:01:15,628 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:15,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2039444857, now seen corresponding path program 1 times [2025-04-13 17:01:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:15,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273745272] [2025-04-13 17:01:15,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:01:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:01:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:01:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:01:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:16,809 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 17:01:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:16,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273745272] [2025-04-13 17:01:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273745272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:01:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:01:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:01:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561074510] [2025-04-13 17:01:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:01:16,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:01:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:16,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:01:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:01:16,813 INFO L87 Difference]: Start difference. First operand 91 states and 242 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:01:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:17,052 INFO L93 Difference]: Finished difference Result 144 states and 377 transitions. [2025-04-13 17:01:17,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:01:17,053 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-13 17:01:17,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:17,054 INFO L225 Difference]: With dead ends: 144 [2025-04-13 17:01:17,054 INFO L226 Difference]: Without dead ends: 95 [2025-04-13 17:01:17,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:01:17,055 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:17,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:01:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-13 17:01:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-13 17:01:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.478723404255319) internal successors, (233), 94 states have internal predecessors, (233), 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 17:01:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 233 transitions. [2025-04-13 17:01:17,063 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 233 transitions. Word has length 7 [2025-04-13 17:01:17,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:17,063 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 233 transitions. [2025-04-13 17:01:17,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:01:17,064 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 233 transitions. [2025-04-13 17:01:17,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:01:17,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:17,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:17,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:01:17,067 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:17,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1134433765, now seen corresponding path program 1 times [2025-04-13 17:01:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:17,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647170070] [2025-04-13 17:01:17,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:01:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:17,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:01:17,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:01:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:01:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:01:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:17,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647170070] [2025-04-13 17:01:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647170070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:01:17,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:01:17,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:01:17,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153308383] [2025-04-13 17:01:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:01:17,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:01:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:01:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:01:17,534 INFO L87 Difference]: Start difference. First operand 95 states and 233 transitions. 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 17:01:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:18,149 INFO L93 Difference]: Finished difference Result 110 states and 268 transitions. [2025-04-13 17:01:18,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:01:18,149 INFO L79 Accepts]: Start accepts. 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) Word has length 11 [2025-04-13 17:01:18,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:18,150 INFO L225 Difference]: With dead ends: 110 [2025-04-13 17:01:18,150 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 17:01:18,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:01:18,151 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:18,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:01:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 17:01:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-13 17:01:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 66 states have internal predecessors, (141), 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 17:01:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 141 transitions. [2025-04-13 17:01:18,157 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 141 transitions. Word has length 11 [2025-04-13 17:01:18,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:18,158 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 141 transitions. [2025-04-13 17:01:18,158 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 17:01:18,158 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 141 transitions. [2025-04-13 17:01:18,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:01:18,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:18,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:18,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:01:18,158 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:18,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 66357318, now seen corresponding path program 1 times [2025-04-13 17:01:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:18,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158293211] [2025-04-13 17:01:18,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:01:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:18,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:01:18,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:01:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:01:18,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:18,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:18,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158293211] [2025-04-13 17:01:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158293211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:01:18,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282560709] [2025-04-13 17:01:18,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:01:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:18,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:01:18,583 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 17:01:18,585 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 17:01:18,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:01:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:01:19,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:01:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:19,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 3392 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:01:19,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:01:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:19,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:01:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282560709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:01:19,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:01:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 17:01:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487835875] [2025-04-13 17:01:19,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:01:19,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:01:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:19,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:01:19,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:01:19,083 INFO L87 Difference]: Start difference. First operand 67 states and 141 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 17:01:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:20,208 INFO L93 Difference]: Finished difference Result 120 states and 268 transitions. [2025-04-13 17:01:20,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:01:20,209 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) Word has length 13 [2025-04-13 17:01:20,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:20,210 INFO L225 Difference]: With dead ends: 120 [2025-04-13 17:01:20,210 INFO L226 Difference]: Without dead ends: 85 [2025-04-13 17:01:20,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:01:20,210 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:20,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:01:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-13 17:01:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-13 17:01:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.107142857142857) internal successors, (177), 84 states have internal predecessors, (177), 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 17:01:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 177 transitions. [2025-04-13 17:01:20,217 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 177 transitions. Word has length 13 [2025-04-13 17:01:20,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:20,217 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 177 transitions. [2025-04-13 17:01:20,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 17:01:20,217 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 177 transitions. [2025-04-13 17:01:20,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:01:20,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:20,218 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:20,229 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 17:01:20,418 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 17:01:20,419 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:20,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 168523500, now seen corresponding path program 2 times [2025-04-13 17:01:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:20,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089091849] [2025-04-13 17:01:20,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:01:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:20,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 17:01:20,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:01:20,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:01:20,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089091849] [2025-04-13 17:01:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089091849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:01:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667491475] [2025-04-13 17:01:20,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:01:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:01:20,824 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 17:01:20,825 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 17:01:20,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 17:01:21,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:01:21,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:01:21,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:21,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 3464 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 17:01:21,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:01:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:21,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:01:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667491475] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:01:21,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:01:21,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 17:01:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602240045] [2025-04-13 17:01:21,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:01:21,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:01:21,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:21,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:01:21,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:01:21,879 INFO L87 Difference]: Start difference. First operand 85 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 17:01:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:23,245 INFO L93 Difference]: Finished difference Result 156 states and 358 transitions. [2025-04-13 17:01:23,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:01:23,246 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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) Word has length 16 [2025-04-13 17:01:23,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:23,247 INFO L225 Difference]: With dead ends: 156 [2025-04-13 17:01:23,247 INFO L226 Difference]: Without dead ends: 121 [2025-04-13 17:01:23,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:01:23,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:23,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:01:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-13 17:01:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-04-13 17:01:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.075) internal successors, (249), 120 states have internal predecessors, (249), 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 17:01:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 249 transitions. [2025-04-13 17:01:23,253 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 249 transitions. Word has length 16 [2025-04-13 17:01:23,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:23,254 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 249 transitions. [2025-04-13 17:01:23,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 17:01:23,254 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 249 transitions. [2025-04-13 17:01:23,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:01:23,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:23,254 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:23,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:01:23,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:23,455 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:23,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -678926644, now seen corresponding path program 3 times [2025-04-13 17:01:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:23,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971695893] [2025-04-13 17:01:23,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:01:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:23,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 17:01:24,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:01:24,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 17:01:24,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:25,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:25,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971695893] [2025-04-13 17:01:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971695893] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:01:25,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261294173] [2025-04-13 17:01:25,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:01:25,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:25,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:01:25,422 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 17:01:25,424 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 17:01:25,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 17:01:36,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:01:36,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 17:01:36,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:37,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 3608 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 17:01:37,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:01:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:37,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:01:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261294173] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:01:37,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:01:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 17:01:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815446991] [2025-04-13 17:01:37,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:01:37,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:01:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:37,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:01:37,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:01:37,223 INFO L87 Difference]: Start difference. First operand 121 states and 249 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 17:01:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:38,683 INFO L93 Difference]: Finished difference Result 228 states and 538 transitions. [2025-04-13 17:01:38,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:01:38,683 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) Word has length 22 [2025-04-13 17:01:38,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:38,685 INFO L225 Difference]: With dead ends: 228 [2025-04-13 17:01:38,685 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 17:01:38,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:01:38,686 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:38,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 17:01:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 17:01:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 17:01:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.046875) internal successors, (393), 192 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:01:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 393 transitions. [2025-04-13 17:01:38,695 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 393 transitions. Word has length 22 [2025-04-13 17:01:38,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:38,695 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 393 transitions. [2025-04-13 17:01:38,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 17:01:38,695 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 393 transitions. [2025-04-13 17:01:38,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:01:38,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:38,696 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:38,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:01:38,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:38,897 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:38,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1747824596, now seen corresponding path program 4 times [2025-04-13 17:01:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:38,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343041813] [2025-04-13 17:01:38,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:01:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:38,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:01:38,992 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:01:38,992 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:01:38,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:39,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:39,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343041813] [2025-04-13 17:01:39,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343041813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:01:39,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259740882] [2025-04-13 17:01:39,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:01:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:39,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:01:39,920 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 17:01:39,921 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 17:01:40,077 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 17:01:40,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:01:40,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:01:40,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:40,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 3896 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 17:01:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:01:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:40,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:01:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259740882] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:01:41,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:01:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-04-13 17:01:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992430485] [2025-04-13 17:01:41,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:01:41,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 17:01:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:01:41,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 17:01:41,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:01:41,047 INFO L87 Difference]: Start difference. First operand 193 states and 393 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 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 17:01:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:01:42,258 INFO L93 Difference]: Finished difference Result 372 states and 898 transitions. [2025-04-13 17:01:42,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:01:42,259 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 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) Word has length 34 [2025-04-13 17:01:42,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:01:42,261 INFO L225 Difference]: With dead ends: 372 [2025-04-13 17:01:42,261 INFO L226 Difference]: Without dead ends: 337 [2025-04-13 17:01:42,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:01:42,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 560 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:01:42,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:01:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-13 17:01:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-04-13 17:01:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.0267857142857144) internal successors, (681), 336 states have internal predecessors, (681), 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 17:01:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 681 transitions. [2025-04-13 17:01:42,275 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 681 transitions. Word has length 34 [2025-04-13 17:01:42,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:01:42,276 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 681 transitions. [2025-04-13 17:01:42,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 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 17:01:42,276 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 681 transitions. [2025-04-13 17:01:42,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-13 17:01:42,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:01:42,277 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:01:42,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:01:42,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:42,482 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:01:42,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:01:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -128460468, now seen corresponding path program 5 times [2025-04-13 17:01:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:01:42,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655301473] [2025-04-13 17:01:42,482 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:01:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:01:42,562 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-04-13 17:01:45,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-04-13 17:01:45,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 17:01:45,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:01:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:01:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:01:47,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655301473] [2025-04-13 17:01:47,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655301473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:01:47,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428930265] [2025-04-13 17:01:47,791 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:01:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:01:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:01:47,793 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 17:01:47,794 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 17:01:48,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes.