/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/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:34:57,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:34:57,499 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 18:34:57,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:34:57,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:34:57,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:34:57,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:34:57,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:34:57,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:34:57,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:34:57,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:34:57,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:34:57,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:34:57,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:34:57,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:34:57,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:34:57,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:34:57,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:34:57,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:34:57,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:34:57,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:34:57,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:34:57,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:34:57,531 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 18:34:57,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:34:57,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:34:57,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:34:57,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:34:57,765 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:34:57,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 18:34:59,031 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6316f8970/55a7930c03d2480ca334df92ea0b9f2e/FLAG8067fbecc [2025-04-13 18:34:59,217 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:34:59,217 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 18:34:59,222 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6316f8970/55a7930c03d2480ca334df92ea0b9f2e/FLAG8067fbecc [2025-04-13 18:35:00,031 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6316f8970/55a7930c03d2480ca334df92ea0b9f2e [2025-04-13 18:35:00,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:35:00,033 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:35:00,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:35:00,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:35:00,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:35:00,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135fae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00, skipping insertion in model container [2025-04-13 18:35:00,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:35:00,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-13 18:35:00,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:35:00,216 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:35:00,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-13 18:35:00,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:35:00,261 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:35:00,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00 WrapperNode [2025-04-13 18:35:00,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:35:00,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:35:00,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:35:00,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:35:00,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,308 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2025-04-13 18:35:00,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:35:00,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:35:00,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:35:00,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:35:00,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,324 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 18:35:00,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:35:00,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:35:00,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:35:00,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:35:00,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (1/1) ... [2025-04-13 18:35:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:35:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:00,359 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 18:35:00,364 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 18:35:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:35:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:35:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:35:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:35:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:35:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:35:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:35:00,379 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 18:35:00,454 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:35:00,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:35:00,609 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:35:00,610 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:35:00,610 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:35:00,719 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:35:00,727 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:35:00,730 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:35:00,733 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:35:00,738 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:35:00,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:35:00 BoogieIcfgContainer [2025-04-13 18:35:00,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:35:00,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:35:00,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:35:00,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:35:00,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:35:00" (1/3) ... [2025-04-13 18:35:00,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdfde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:35:00, skipping insertion in model container [2025-04-13 18:35:00,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:35:00" (2/3) ... [2025-04-13 18:35:00,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdfde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:35:00, skipping insertion in model container [2025-04-13 18:35:00,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:35:00" (3/3) ... [2025-04-13 18:35:00,744 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-04-13 18:35:00,753 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:35:00,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 32 locations, 35 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:35:00,754 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:35:00,795 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:35:00,813 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 18:35:00,881 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 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 18:35:00,898 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:35:00,925 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;@6d9dfda2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:35:00,925 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:35:00,928 INFO L278 IsEmpty]: Start isEmpty. Operand has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 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 18:35:00,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:35:00,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:00,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:00,944 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 18:35:00,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1314656400, now seen corresponding path program 1 times [2025-04-13 18:35:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:00,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194762607] [2025-04-13 18:35:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:01,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:35:01,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:35:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:01,238 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 18:35:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:01,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194762607] [2025-04-13 18:35:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194762607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:01,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:01,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:35:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519564081] [2025-04-13 18:35:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:01,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:35:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:01,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:35:01,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:35:01,262 INFO L87 Difference]: Start difference. First operand has 768 states, 767 states have (on average 5.1199478487614085) internal successors, (3927), 767 states have internal predecessors, (3927), 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 3 states, 2 states have (on average 9.0) internal successors, (18), 2 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 18:35:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:01,389 INFO L93 Difference]: Finished difference Result 1680 states and 8215 transitions. [2025-04-13 18:35:01,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:35:01,391 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 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 18 [2025-04-13 18:35:01,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:01,407 INFO L225 Difference]: With dead ends: 1680 [2025-04-13 18:35:01,408 INFO L226 Difference]: Without dead ends: 958 [2025-04-13 18:35:01,411 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 18:35:01,413 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:01,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-04-13 18:35:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 946. [2025-04-13 18:35:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.706878306878306) internal successors, (4448), 945 states have internal predecessors, (4448), 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 18:35:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 4448 transitions. [2025-04-13 18:35:01,506 INFO L79 Accepts]: Start accepts. Automaton has 946 states and 4448 transitions. Word has length 18 [2025-04-13 18:35:01,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:01,507 INFO L485 AbstractCegarLoop]: Abstraction has 946 states and 4448 transitions. [2025-04-13 18:35:01,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 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 18:35:01,507 INFO L278 IsEmpty]: Start isEmpty. Operand 946 states and 4448 transitions. [2025-04-13 18:35:01,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:35:01,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:01,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:01,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:35:01,512 INFO L403 AbstractCegarLoop]: === Iteration 2 === 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 18:35:01,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash -458200401, now seen corresponding path program 1 times [2025-04-13 18:35:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:01,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066252326] [2025-04-13 18:35:01,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:01,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:35:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:35:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:01,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:01,573 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 18:35:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:01,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066252326] [2025-04-13 18:35:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066252326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:01,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:01,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:35:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18778100] [2025-04-13 18:35:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:01,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:35:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:01,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:35:01,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:35:01,574 INFO L87 Difference]: Start difference. First operand 946 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:01,681 INFO L93 Difference]: Finished difference Result 1511 states and 6732 transitions. [2025-04-13 18:35:01,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:35:01,681 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:35:01,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:01,689 INFO L225 Difference]: With dead ends: 1511 [2025-04-13 18:35:01,689 INFO L226 Difference]: Without dead ends: 946 [2025-04-13 18:35:01,690 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 18:35:01,691 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:01,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-04-13 18:35:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 940. [2025-04-13 18:35:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 3.9424920127795526) internal successors, (3702), 939 states have internal predecessors, (3702), 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 18:35:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 3702 transitions. [2025-04-13 18:35:01,716 INFO L79 Accepts]: Start accepts. Automaton has 940 states and 3702 transitions. Word has length 20 [2025-04-13 18:35:01,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:01,716 INFO L485 AbstractCegarLoop]: Abstraction has 940 states and 3702 transitions. [2025-04-13 18:35:01,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:01,716 INFO L278 IsEmpty]: Start isEmpty. Operand 940 states and 3702 transitions. [2025-04-13 18:35:01,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:35:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:01,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:01,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:35:01,718 INFO L403 AbstractCegarLoop]: === Iteration 3 === 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 18:35:01,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1123555051, now seen corresponding path program 1 times [2025-04-13 18:35:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:01,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901446259] [2025-04-13 18:35:01,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:01,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:35:01,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:35:01,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:01,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:01,771 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 18:35:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:01,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901446259] [2025-04-13 18:35:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901446259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:35:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041001671] [2025-04-13 18:35:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:01,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:35:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:35:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:35:01,773 INFO L87 Difference]: Start difference. First operand 940 states and 3702 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:01,848 INFO L93 Difference]: Finished difference Result 1389 states and 5350 transitions. [2025-04-13 18:35:01,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:35:01,849 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:35:01,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:01,855 INFO L225 Difference]: With dead ends: 1389 [2025-04-13 18:35:01,856 INFO L226 Difference]: Without dead ends: 778 [2025-04-13 18:35:01,857 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 18:35:01,857 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:01,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-04-13 18:35:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2025-04-13 18:35:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 4.164736164736165) internal successors, (3236), 777 states have internal predecessors, (3236), 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 18:35:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3236 transitions. [2025-04-13 18:35:01,879 INFO L79 Accepts]: Start accepts. Automaton has 778 states and 3236 transitions. Word has length 20 [2025-04-13 18:35:01,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:01,880 INFO L485 AbstractCegarLoop]: Abstraction has 778 states and 3236 transitions. [2025-04-13 18:35:01,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:01,880 INFO L278 IsEmpty]: Start isEmpty. Operand 778 states and 3236 transitions. [2025-04-13 18:35:01,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:35:01,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:01,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:01,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:35:01,882 INFO L403 AbstractCegarLoop]: === Iteration 4 === 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 18:35:01,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1658746382, now seen corresponding path program 1 times [2025-04-13 18:35:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:01,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895334558] [2025-04-13 18:35:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:01,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:35:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:35:01,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:01,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:02,103 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 18:35:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:02,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895334558] [2025-04-13 18:35:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895334558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:35:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133174975] [2025-04-13 18:35:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:02,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:35:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:02,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:35:02,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:02,105 INFO L87 Difference]: Start difference. First operand 778 states and 3236 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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 18:35:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:02,327 INFO L93 Difference]: Finished difference Result 3471 states and 14710 transitions. [2025-04-13 18:35:02,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:02,328 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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 26 [2025-04-13 18:35:02,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:02,345 INFO L225 Difference]: With dead ends: 3471 [2025-04-13 18:35:02,345 INFO L226 Difference]: Without dead ends: 2712 [2025-04-13 18:35:02,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:02,350 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:02,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-04-13 18:35:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2578. [2025-04-13 18:35:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 4.207993791230113) internal successors, (10844), 2577 states have internal predecessors, (10844), 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 18:35:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 10844 transitions. [2025-04-13 18:35:02,453 INFO L79 Accepts]: Start accepts. Automaton has 2578 states and 10844 transitions. Word has length 26 [2025-04-13 18:35:02,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:02,454 INFO L485 AbstractCegarLoop]: Abstraction has 2578 states and 10844 transitions. [2025-04-13 18:35:02,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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 18:35:02,454 INFO L278 IsEmpty]: Start isEmpty. Operand 2578 states and 10844 transitions. [2025-04-13 18:35:02,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:02,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:02,461 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:02,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:35:02,461 INFO L403 AbstractCegarLoop]: === Iteration 5 === 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 18:35:02,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -677679207, now seen corresponding path program 1 times [2025-04-13 18:35:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:02,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789237543] [2025-04-13 18:35:02,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:35:02,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:02,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:02,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:02,631 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 18:35:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:02,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789237543] [2025-04-13 18:35:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789237543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:02,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770305003] [2025-04-13 18:35:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:02,635 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 18:35:02,636 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 18:35:02,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:35:02,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:02,784 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 18:35:02,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:02,858 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 18:35:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770305003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:02,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 18:35:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910729237] [2025-04-13 18:35:02,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:02,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:35:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:35:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:02,860 INFO L87 Difference]: Start difference. First operand 2578 states and 10844 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 18:35:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:03,178 INFO L93 Difference]: Finished difference Result 5520 states and 23339 transitions. [2025-04-13 18:35:03,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:03,178 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 28 [2025-04-13 18:35:03,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:03,213 INFO L225 Difference]: With dead ends: 5520 [2025-04-13 18:35:03,213 INFO L226 Difference]: Without dead ends: 4965 [2025-04-13 18:35:03,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:03,217 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 174 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:03,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 23 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4965 states. [2025-04-13 18:35:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4965 to 3386. [2025-04-13 18:35:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 4.2892171344165435) internal successors, (14519), 3385 states have internal predecessors, (14519), 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 18:35:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 14519 transitions. [2025-04-13 18:35:03,353 INFO L79 Accepts]: Start accepts. Automaton has 3386 states and 14519 transitions. Word has length 28 [2025-04-13 18:35:03,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:03,353 INFO L485 AbstractCegarLoop]: Abstraction has 3386 states and 14519 transitions. [2025-04-13 18:35:03,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 18:35:03,354 INFO L278 IsEmpty]: Start isEmpty. Operand 3386 states and 14519 transitions. [2025-04-13 18:35:03,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:03,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:03,363 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:03,370 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 18:35:03,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:03,568 INFO L403 AbstractCegarLoop]: === Iteration 6 === 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 18:35:03,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1039248399, now seen corresponding path program 1 times [2025-04-13 18:35:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:03,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801624972] [2025-04-13 18:35:03,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:03,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:35:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:03,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:03,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:03,704 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 18:35:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:03,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801624972] [2025-04-13 18:35:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801624972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:03,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:03,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354660683] [2025-04-13 18:35:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:03,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:03,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:03,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:03,706 INFO L87 Difference]: Start difference. First operand 3386 states and 14519 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:03,913 INFO L93 Difference]: Finished difference Result 5379 states and 22405 transitions. [2025-04-13 18:35:03,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:03,913 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:03,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:03,948 INFO L225 Difference]: With dead ends: 5379 [2025-04-13 18:35:03,949 INFO L226 Difference]: Without dead ends: 4813 [2025-04-13 18:35:03,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:03,952 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:03,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2025-04-13 18:35:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 3382. [2025-04-13 18:35:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3382 states, 3381 states have (on average 4.278615794143745) internal successors, (14466), 3381 states have internal predecessors, (14466), 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 18:35:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 14466 transitions. [2025-04-13 18:35:04,052 INFO L79 Accepts]: Start accepts. Automaton has 3382 states and 14466 transitions. Word has length 28 [2025-04-13 18:35:04,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:04,052 INFO L485 AbstractCegarLoop]: Abstraction has 3382 states and 14466 transitions. [2025-04-13 18:35:04,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:04,052 INFO L278 IsEmpty]: Start isEmpty. Operand 3382 states and 14466 transitions. [2025-04-13 18:35:04,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:04,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:04,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:04,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:35:04,062 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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 18:35:04,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1036759465, now seen corresponding path program 2 times [2025-04-13 18:35:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:04,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298246347] [2025-04-13 18:35:04,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:04,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:04,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:04,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:04,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:04,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298246347] [2025-04-13 18:35:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298246347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:35:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570766551] [2025-04-13 18:35:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:04,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:35:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:04,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:35:04,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:04,281 INFO L87 Difference]: Start difference. First operand 3382 states and 14466 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 18:35:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:04,464 INFO L93 Difference]: Finished difference Result 5729 states and 24871 transitions. [2025-04-13 18:35:04,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:35:04,465 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:04,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:04,485 INFO L225 Difference]: With dead ends: 5729 [2025-04-13 18:35:04,485 INFO L226 Difference]: Without dead ends: 5174 [2025-04-13 18:35:04,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:04,488 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:04,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 19 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2025-04-13 18:35:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 3550. [2025-04-13 18:35:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 3549 states have (on average 4.3307974077204845) internal successors, (15370), 3549 states have internal predecessors, (15370), 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 18:35:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 15370 transitions. [2025-04-13 18:35:04,614 INFO L79 Accepts]: Start accepts. Automaton has 3550 states and 15370 transitions. Word has length 28 [2025-04-13 18:35:04,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:04,615 INFO L485 AbstractCegarLoop]: Abstraction has 3550 states and 15370 transitions. [2025-04-13 18:35:04,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 18:35:04,615 INFO L278 IsEmpty]: Start isEmpty. Operand 3550 states and 15370 transitions. [2025-04-13 18:35:04,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:04,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:04,622 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:04,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:35:04,623 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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 18:35:04,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1451619149, now seen corresponding path program 2 times [2025-04-13 18:35:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:04,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140115873] [2025-04-13 18:35:04,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:04,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:04,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:04,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:04,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:04,772 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 18:35:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:04,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140115873] [2025-04-13 18:35:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140115873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:04,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594949315] [2025-04-13 18:35:04,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:04,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:04,775 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 18:35:04,776 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 18:35:04,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:04,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:04,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:04,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:04,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:04,890 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 18:35:04,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594949315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:04,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-13 18:35:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126475254] [2025-04-13 18:35:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:04,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:04,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:04,891 INFO L87 Difference]: Start difference. First operand 3550 states and 15370 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:05,027 INFO L93 Difference]: Finished difference Result 5097 states and 21822 transitions. [2025-04-13 18:35:05,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:05,027 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:05,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:05,044 INFO L225 Difference]: With dead ends: 5097 [2025-04-13 18:35:05,044 INFO L226 Difference]: Without dead ends: 4571 [2025-04-13 18:35:05,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:05,047 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:05,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 14 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2025-04-13 18:35:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 3550. [2025-04-13 18:35:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 3549 states have (on average 4.298112144265991) internal successors, (15254), 3549 states have internal predecessors, (15254), 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 18:35:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 15254 transitions. [2025-04-13 18:35:05,124 INFO L79 Accepts]: Start accepts. Automaton has 3550 states and 15254 transitions. Word has length 28 [2025-04-13 18:35:05,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:05,125 INFO L485 AbstractCegarLoop]: Abstraction has 3550 states and 15254 transitions. [2025-04-13 18:35:05,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:05,125 INFO L278 IsEmpty]: Start isEmpty. Operand 3550 states and 15254 transitions. [2025-04-13 18:35:05,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:05,132 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:05,132 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:05,138 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 18:35:05,333 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,SelfDestructingSolverStorable7 [2025-04-13 18:35:05,333 INFO L403 AbstractCegarLoop]: === Iteration 9 === 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 18:35:05,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 482978367, now seen corresponding path program 3 times [2025-04-13 18:35:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:05,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624030598] [2025-04-13 18:35:05,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:05,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:05,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:05,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:05,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:05,525 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 18:35:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:05,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624030598] [2025-04-13 18:35:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624030598] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:05,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740384667] [2025-04-13 18:35:05,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:05,527 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 18:35:05,530 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 18:35:05,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:05,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:05,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:05,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:05,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:05,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:05,628 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 18:35:05,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:05,676 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 18:35:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740384667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:05,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:05,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:35:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835933181] [2025-04-13 18:35:05,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:05,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:35:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:05,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:35:05,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:05,677 INFO L87 Difference]: Start difference. First operand 3550 states and 15254 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 18:35:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:06,056 INFO L93 Difference]: Finished difference Result 7162 states and 32321 transitions. [2025-04-13 18:35:06,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:35:06,057 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 28 [2025-04-13 18:35:06,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:06,084 INFO L225 Difference]: With dead ends: 7162 [2025-04-13 18:35:06,084 INFO L226 Difference]: Without dead ends: 6752 [2025-04-13 18:35:06,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:35:06,089 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 124 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:06,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 36 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:35:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-04-13 18:35:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 5578. [2025-04-13 18:35:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5578 states, 5577 states have (on average 4.547606239913932) internal successors, (25362), 5577 states have internal predecessors, (25362), 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 18:35:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 25362 transitions. [2025-04-13 18:35:06,268 INFO L79 Accepts]: Start accepts. Automaton has 5578 states and 25362 transitions. Word has length 28 [2025-04-13 18:35:06,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:06,268 INFO L485 AbstractCegarLoop]: Abstraction has 5578 states and 25362 transitions. [2025-04-13 18:35:06,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 18:35:06,268 INFO L278 IsEmpty]: Start isEmpty. Operand 5578 states and 25362 transitions. [2025-04-13 18:35:06,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:06,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:06,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:06,288 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 18:35:06,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:06,483 INFO L403 AbstractCegarLoop]: === Iteration 10 === 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 18:35:06,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2026621881, now seen corresponding path program 3 times [2025-04-13 18:35:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:06,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421322009] [2025-04-13 18:35:06,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:06,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:06,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:06,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:06,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:06,632 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 18:35:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:06,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421322009] [2025-04-13 18:35:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421322009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:06,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027555472] [2025-04-13 18:35:06,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:06,634 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 18:35:06,636 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 18:35:06,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:06,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:06,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:06,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:06,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:06,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027555472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-04-13 18:35:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548720422] [2025-04-13 18:35:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:06,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:06,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:06,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:06,735 INFO L87 Difference]: Start difference. First operand 5578 states and 25362 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:06,878 INFO L93 Difference]: Finished difference Result 6737 states and 29455 transitions. [2025-04-13 18:35:06,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:06,879 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:06,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:06,909 INFO L225 Difference]: With dead ends: 6737 [2025-04-13 18:35:06,909 INFO L226 Difference]: Without dead ends: 6013 [2025-04-13 18:35:06,912 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:06,912 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:06,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 13 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2025-04-13 18:35:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 5578. [2025-04-13 18:35:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5578 states, 5577 states have (on average 4.526806526806527) internal successors, (25246), 5577 states have internal predecessors, (25246), 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 18:35:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 25246 transitions. [2025-04-13 18:35:07,028 INFO L79 Accepts]: Start accepts. Automaton has 5578 states and 25246 transitions. Word has length 28 [2025-04-13 18:35:07,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:07,029 INFO L485 AbstractCegarLoop]: Abstraction has 5578 states and 25246 transitions. [2025-04-13 18:35:07,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:07,029 INFO L278 IsEmpty]: Start isEmpty. Operand 5578 states and 25246 transitions. [2025-04-13 18:35:07,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:07,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:07,040 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:07,047 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 18:35:07,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:07,244 INFO L403 AbstractCegarLoop]: === Iteration 11 === 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 18:35:07,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:07,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1130309011, now seen corresponding path program 4 times [2025-04-13 18:35:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:07,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896055618] [2025-04-13 18:35:07,245 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:07,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:07,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:07,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:07,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:07,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:07,354 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 18:35:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:07,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896055618] [2025-04-13 18:35:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896055618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:07,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046218825] [2025-04-13 18:35:07,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:07,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:07,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:07,357 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 18:35:07,358 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 18:35:07,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:07,409 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:07,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:07,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:07,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:07,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:07,459 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 18:35:07,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:07,505 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 18:35:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046218825] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:07,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:35:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054350463] [2025-04-13 18:35:07,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:07,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:35:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:07,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:35:07,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:07,506 INFO L87 Difference]: Start difference. First operand 5578 states and 25246 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 18:35:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:07,784 INFO L93 Difference]: Finished difference Result 8643 states and 38910 transitions. [2025-04-13 18:35:07,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:35:07,784 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 28 [2025-04-13 18:35:07,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:07,813 INFO L225 Difference]: With dead ends: 8643 [2025-04-13 18:35:07,813 INFO L226 Difference]: Without dead ends: 8088 [2025-04-13 18:35:07,817 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:35:07,818 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:07,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 38 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8088 states. [2025-04-13 18:35:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8088 to 5772. [2025-04-13 18:35:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5771 states have (on average 4.547218852885115) internal successors, (26242), 5771 states have internal predecessors, (26242), 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 18:35:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 26242 transitions. [2025-04-13 18:35:07,949 INFO L79 Accepts]: Start accepts. Automaton has 5772 states and 26242 transitions. Word has length 28 [2025-04-13 18:35:07,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:07,950 INFO L485 AbstractCegarLoop]: Abstraction has 5772 states and 26242 transitions. [2025-04-13 18:35:07,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 18:35:07,950 INFO L278 IsEmpty]: Start isEmpty. Operand 5772 states and 26242 transitions. [2025-04-13 18:35:07,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:07,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:07,961 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:07,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:08,161 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,SelfDestructingSolverStorable10 [2025-04-13 18:35:08,161 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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 18:35:08,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -676279671, now seen corresponding path program 4 times [2025-04-13 18:35:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:08,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334069677] [2025-04-13 18:35:08,162 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:08,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:08,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:08,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:08,230 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 18:35:08,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:08,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334069677] [2025-04-13 18:35:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334069677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:08,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:08,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741989682] [2025-04-13 18:35:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:08,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:08,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:08,232 INFO L87 Difference]: Start difference. First operand 5772 states and 26242 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:08,361 INFO L93 Difference]: Finished difference Result 6398 states and 28234 transitions. [2025-04-13 18:35:08,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:08,361 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:08,361 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:08,382 INFO L225 Difference]: With dead ends: 6398 [2025-04-13 18:35:08,382 INFO L226 Difference]: Without dead ends: 5872 [2025-04-13 18:35:08,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:08,385 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:08,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2025-04-13 18:35:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 5764. [2025-04-13 18:35:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5764 states, 5763 states have (on average 4.5288912024986985) internal successors, (26100), 5763 states have internal predecessors, (26100), 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 18:35:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 26100 transitions. [2025-04-13 18:35:08,523 INFO L79 Accepts]: Start accepts. Automaton has 5764 states and 26100 transitions. Word has length 28 [2025-04-13 18:35:08,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:08,523 INFO L485 AbstractCegarLoop]: Abstraction has 5764 states and 26100 transitions. [2025-04-13 18:35:08,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:08,523 INFO L278 IsEmpty]: Start isEmpty. Operand 5764 states and 26100 transitions. [2025-04-13 18:35:08,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:08,534 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:08,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:35:08,534 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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 18:35:08,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1644920453, now seen corresponding path program 5 times [2025-04-13 18:35:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:08,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541002502] [2025-04-13 18:35:08,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:08,538 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:08,542 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:08,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:08,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:08,599 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 18:35:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:08,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541002502] [2025-04-13 18:35:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541002502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:08,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208509294] [2025-04-13 18:35:08,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:08,601 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 18:35:08,602 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 18:35:08,632 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:08,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:08,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:08,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:08,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:08,683 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 18:35:08,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:08,729 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 18:35:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208509294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:08,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:08,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 18:35:08,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654548737] [2025-04-13 18:35:08,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:08,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:35:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:08,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:35:08,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:08,730 INFO L87 Difference]: Start difference. First operand 5764 states and 26100 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 18:35:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:09,042 INFO L93 Difference]: Finished difference Result 9023 states and 39833 transitions. [2025-04-13 18:35:09,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:35:09,043 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 28 [2025-04-13 18:35:09,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:09,071 INFO L225 Difference]: With dead ends: 9023 [2025-04-13 18:35:09,072 INFO L226 Difference]: Without dead ends: 8613 [2025-04-13 18:35:09,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:35:09,075 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:09,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 32 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8613 states. [2025-04-13 18:35:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8613 to 5178. [2025-04-13 18:35:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5178 states, 5177 states have (on average 4.436353100251111) internal successors, (22967), 5177 states have internal predecessors, (22967), 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 18:35:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 22967 transitions. [2025-04-13 18:35:09,189 INFO L79 Accepts]: Start accepts. Automaton has 5178 states and 22967 transitions. Word has length 28 [2025-04-13 18:35:09,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:09,190 INFO L485 AbstractCegarLoop]: Abstraction has 5178 states and 22967 transitions. [2025-04-13 18:35:09,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 18:35:09,190 INFO L278 IsEmpty]: Start isEmpty. Operand 5178 states and 22967 transitions. [2025-04-13 18:35:09,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:09,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:09,223 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:09,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:09,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:09,424 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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 18:35:09,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -101276939, now seen corresponding path program 5 times [2025-04-13 18:35:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:09,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940968648] [2025-04-13 18:35:09,424 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:09,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:09,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:09,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:09,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940968648] [2025-04-13 18:35:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940968648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:09,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:09,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:09,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772171533] [2025-04-13 18:35:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:09,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:09,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:09,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:09,487 INFO L87 Difference]: Start difference. First operand 5178 states and 22967 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:09,624 INFO L93 Difference]: Finished difference Result 6010 states and 25759 transitions. [2025-04-13 18:35:09,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:09,624 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:09,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:09,641 INFO L225 Difference]: With dead ends: 6010 [2025-04-13 18:35:09,641 INFO L226 Difference]: Without dead ends: 5286 [2025-04-13 18:35:09,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:09,644 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:09,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2025-04-13 18:35:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 5010. [2025-04-13 18:35:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 5009 states have (on average 4.427829906168896) internal successors, (22179), 5009 states have internal predecessors, (22179), 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 18:35:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 22179 transitions. [2025-04-13 18:35:09,735 INFO L79 Accepts]: Start accepts. Automaton has 5010 states and 22179 transitions. Word has length 28 [2025-04-13 18:35:09,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:09,735 INFO L485 AbstractCegarLoop]: Abstraction has 5010 states and 22179 transitions. [2025-04-13 18:35:09,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:09,735 INFO L278 IsEmpty]: Start isEmpty. Operand 5010 states and 22179 transitions. [2025-04-13 18:35:09,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:09,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:09,745 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:09,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:35:09,745 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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 18:35:09,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash 102988415, now seen corresponding path program 6 times [2025-04-13 18:35:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:09,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939366065] [2025-04-13 18:35:09,746 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:09,750 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:09,758 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:09,758 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:09,857 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 18:35:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:09,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939366065] [2025-04-13 18:35:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939366065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:09,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181024262] [2025-04-13 18:35:09,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:09,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:09,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:35:09,891 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:09,906 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:09,906 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:09,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:09,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:09,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:09,938 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 18:35:09,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:09,979 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 18:35:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181024262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:09,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:35:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547372013] [2025-04-13 18:35:09,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:09,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:35:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:09,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:35:09,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:09,980 INFO L87 Difference]: Start difference. First operand 5010 states and 22179 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 18:35:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:10,319 INFO L93 Difference]: Finished difference Result 7408 states and 31301 transitions. [2025-04-13 18:35:10,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:10,320 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 28 [2025-04-13 18:35:10,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:10,375 INFO L225 Difference]: With dead ends: 7408 [2025-04-13 18:35:10,375 INFO L226 Difference]: Without dead ends: 6998 [2025-04-13 18:35:10,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:10,377 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 137 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:10,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 42 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:35:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6998 states. [2025-04-13 18:35:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6998 to 4420. [2025-04-13 18:35:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4419 states have (on average 4.3070830504639055) internal successors, (19033), 4419 states have internal predecessors, (19033), 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 18:35:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 19033 transitions. [2025-04-13 18:35:10,496 INFO L79 Accepts]: Start accepts. Automaton has 4420 states and 19033 transitions. Word has length 28 [2025-04-13 18:35:10,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:10,496 INFO L485 AbstractCegarLoop]: Abstraction has 4420 states and 19033 transitions. [2025-04-13 18:35:10,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 18:35:10,496 INFO L278 IsEmpty]: Start isEmpty. Operand 4420 states and 19033 transitions. [2025-04-13 18:35:10,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:35:10,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:10,506 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:10,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:35:10,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:10,708 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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 18:35:10,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:10,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1659889735, now seen corresponding path program 6 times [2025-04-13 18:35:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:10,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884360382] [2025-04-13 18:35:10,709 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:10,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:10,732 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:10,732 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:10,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:10,842 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 18:35:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:10,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884360382] [2025-04-13 18:35:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884360382] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:10,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882225219] [2025-04-13 18:35:10,843 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:10,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:10,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:35:10,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:35:10,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:35:10,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:10,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:10,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:10,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:10,930 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 18:35:10,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882225219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-04-13 18:35:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054083630] [2025-04-13 18:35:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:10,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:10,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:10,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:35:10,932 INFO L87 Difference]: Start difference. First operand 4420 states and 19033 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:11,085 INFO L93 Difference]: Finished difference Result 5297 states and 21945 transitions. [2025-04-13 18:35:11,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:11,085 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 18:35:11,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:11,103 INFO L225 Difference]: With dead ends: 5297 [2025-04-13 18:35:11,103 INFO L226 Difference]: Without dead ends: 4504 [2025-04-13 18:35:11,105 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:35:11,105 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:11,105 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 13 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2025-04-13 18:35:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 4396. [2025-04-13 18:35:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4396 states, 4395 states have (on average 4.30193401592719) internal successors, (18907), 4395 states have internal predecessors, (18907), 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 18:35:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 18907 transitions. [2025-04-13 18:35:11,185 INFO L79 Accepts]: Start accepts. Automaton has 4396 states and 18907 transitions. Word has length 28 [2025-04-13 18:35:11,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:11,185 INFO L485 AbstractCegarLoop]: Abstraction has 4396 states and 18907 transitions. [2025-04-13 18:35:11,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 18:35:11,185 INFO L278 IsEmpty]: Start isEmpty. Operand 4396 states and 18907 transitions. [2025-04-13 18:35:11,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:11,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:11,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:11,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:11,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:35:11,396 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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 18:35:11,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1419718104, now seen corresponding path program 1 times [2025-04-13 18:35:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:11,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802074099] [2025-04-13 18:35:11,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:11,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:35:11,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:11,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:11,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802074099] [2025-04-13 18:35:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802074099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:11,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721943179] [2025-04-13 18:35:11,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:11,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:11,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:11,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:35:11,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:35:11,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:11,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:11,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:11,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721943179] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:11,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 18:35:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785666023] [2025-04-13 18:35:11,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:11,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:35:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:11,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:35:11,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:11,615 INFO L87 Difference]: Start difference. First operand 4396 states and 18907 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 18:35:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:11,864 INFO L93 Difference]: Finished difference Result 6033 states and 26010 transitions. [2025-04-13 18:35:11,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:11,865 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 30 [2025-04-13 18:35:11,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:11,884 INFO L225 Difference]: With dead ends: 6033 [2025-04-13 18:35:11,884 INFO L226 Difference]: Without dead ends: 5568 [2025-04-13 18:35:11,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:11,887 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:11,888 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 32 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2025-04-13 18:35:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5431. [2025-04-13 18:35:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 5430 states have (on average 4.298526703499079) internal successors, (23341), 5430 states have internal predecessors, (23341), 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 18:35:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 23341 transitions. [2025-04-13 18:35:12,018 INFO L79 Accepts]: Start accepts. Automaton has 5431 states and 23341 transitions. Word has length 30 [2025-04-13 18:35:12,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:12,018 INFO L485 AbstractCegarLoop]: Abstraction has 5431 states and 23341 transitions. [2025-04-13 18:35:12,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 18:35:12,019 INFO L278 IsEmpty]: Start isEmpty. Operand 5431 states and 23341 transitions. [2025-04-13 18:35:12,026 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:12,026 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:12,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:12,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:35:12,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 18:35:12,227 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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 18:35:12,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 373852424, now seen corresponding path program 2 times [2025-04-13 18:35:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:12,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560940437] [2025-04-13 18:35:12,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:12,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:12,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:12,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:12,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:12,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560940437] [2025-04-13 18:35:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560940437] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:12,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589901550] [2025-04-13 18:35:12,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:12,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:12,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:35:12,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:12,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:12,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:12,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:12,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:12,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589901550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:12,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-04-13 18:35:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003698912] [2025-04-13 18:35:12,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:12,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:35:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:12,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:35:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:12,481 INFO L87 Difference]: Start difference. First operand 5431 states and 23341 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 18:35:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:12,765 INFO L93 Difference]: Finished difference Result 8446 states and 36601 transitions. [2025-04-13 18:35:12,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:35:12,765 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 30 [2025-04-13 18:35:12,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:12,790 INFO L225 Difference]: With dead ends: 8446 [2025-04-13 18:35:12,790 INFO L226 Difference]: Without dead ends: 7993 [2025-04-13 18:35:12,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:35:12,793 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:12,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 32 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2025-04-13 18:35:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 5897. [2025-04-13 18:35:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5896 states have (on average 4.332428765264586) internal successors, (25544), 5896 states have internal predecessors, (25544), 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 18:35:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 25544 transitions. [2025-04-13 18:35:12,909 INFO L79 Accepts]: Start accepts. Automaton has 5897 states and 25544 transitions. Word has length 30 [2025-04-13 18:35:12,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:12,910 INFO L485 AbstractCegarLoop]: Abstraction has 5897 states and 25544 transitions. [2025-04-13 18:35:12,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 18:35:12,910 INFO L278 IsEmpty]: Start isEmpty. Operand 5897 states and 25544 transitions. [2025-04-13 18:35:12,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:12,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:12,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:12,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:13,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:35:13,120 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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 18:35:13,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash 292600146, now seen corresponding path program 3 times [2025-04-13 18:35:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:13,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044191131] [2025-04-13 18:35:13,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:13,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:13,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:13,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:13,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:35:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:13,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044191131] [2025-04-13 18:35:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044191131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131870202] [2025-04-13 18:35:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:13,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:13,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:13,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:13,207 INFO L87 Difference]: Start difference. First operand 5897 states and 25544 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:13,449 INFO L93 Difference]: Finished difference Result 9325 states and 40682 transitions. [2025-04-13 18:35:13,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:13,449 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:13,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:13,476 INFO L225 Difference]: With dead ends: 9325 [2025-04-13 18:35:13,477 INFO L226 Difference]: Without dead ends: 8187 [2025-04-13 18:35:13,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:35:13,482 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:13,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2025-04-13 18:35:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8175. [2025-04-13 18:35:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 8174 states have (on average 4.409224369953511) internal successors, (36041), 8174 states have internal predecessors, (36041), 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 18:35:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 36041 transitions. [2025-04-13 18:35:13,632 INFO L79 Accepts]: Start accepts. Automaton has 8175 states and 36041 transitions. Word has length 30 [2025-04-13 18:35:13,632 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:13,632 INFO L485 AbstractCegarLoop]: Abstraction has 8175 states and 36041 transitions. [2025-04-13 18:35:13,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:13,632 INFO L278 IsEmpty]: Start isEmpty. Operand 8175 states and 36041 transitions. [2025-04-13 18:35:13,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:13,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:13,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:13,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:35:13,646 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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 18:35:13,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1841071180, now seen corresponding path program 4 times [2025-04-13 18:35:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:13,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825125410] [2025-04-13 18:35:13,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:13,649 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:13,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:13,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:13,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:13,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:13,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825125410] [2025-04-13 18:35:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825125410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:13,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895040627] [2025-04-13 18:35:13,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:13,743 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:13,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 18:35:13,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:13,790 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:13,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:13,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:13,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:13,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:13,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:13,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895040627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:13,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-04-13 18:35:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137368588] [2025-04-13 18:35:13,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:13,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:13,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:13,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:13,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:13,832 INFO L87 Difference]: Start difference. First operand 8175 states and 36041 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:13,956 INFO L93 Difference]: Finished difference Result 9249 states and 39884 transitions. [2025-04-13 18:35:13,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:13,956 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:13,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:13,985 INFO L225 Difference]: With dead ends: 9249 [2025-04-13 18:35:13,986 INFO L226 Difference]: Without dead ends: 8350 [2025-04-13 18:35:13,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:13,991 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:13,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 17 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2025-04-13 18:35:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 8035. [2025-04-13 18:35:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 8034 states have (on average 4.3861090365944735) internal successors, (35238), 8034 states have internal predecessors, (35238), 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 18:35:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 35238 transitions. [2025-04-13 18:35:14,197 INFO L79 Accepts]: Start accepts. Automaton has 8035 states and 35238 transitions. Word has length 30 [2025-04-13 18:35:14,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:14,198 INFO L485 AbstractCegarLoop]: Abstraction has 8035 states and 35238 transitions. [2025-04-13 18:35:14,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:14,198 INFO L278 IsEmpty]: Start isEmpty. Operand 8035 states and 35238 transitions. [2025-04-13 18:35:14,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:14,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:14,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:14,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:14,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:14,412 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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 18:35:14,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1472112942, now seen corresponding path program 5 times [2025-04-13 18:35:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:14,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731390623] [2025-04-13 18:35:14,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:14,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:14,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:14,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:35:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:14,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731390623] [2025-04-13 18:35:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731390623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988404933] [2025-04-13 18:35:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:14,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:14,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:14,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:14,463 INFO L87 Difference]: Start difference. First operand 8035 states and 35238 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:14,644 INFO L93 Difference]: Finished difference Result 12472 states and 53843 transitions. [2025-04-13 18:35:14,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:14,644 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:14,644 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:14,686 INFO L225 Difference]: With dead ends: 12472 [2025-04-13 18:35:14,687 INFO L226 Difference]: Without dead ends: 11478 [2025-04-13 18:35:14,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:14,692 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:14,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11478 states. [2025-04-13 18:35:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11478 to 8295. [2025-04-13 18:35:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8295 states, 8294 states have (on average 4.378104653966723) internal successors, (36312), 8294 states have internal predecessors, (36312), 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 18:35:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8295 states to 8295 states and 36312 transitions. [2025-04-13 18:35:14,861 INFO L79 Accepts]: Start accepts. Automaton has 8295 states and 36312 transitions. Word has length 30 [2025-04-13 18:35:14,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:14,862 INFO L485 AbstractCegarLoop]: Abstraction has 8295 states and 36312 transitions. [2025-04-13 18:35:14,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:14,862 INFO L278 IsEmpty]: Start isEmpty. Operand 8295 states and 36312 transitions. [2025-04-13 18:35:14,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:14,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:14,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:14,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:35:14,876 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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 18:35:14,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1599927480, now seen corresponding path program 6 times [2025-04-13 18:35:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:14,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504194561] [2025-04-13 18:35:14,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:14,879 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:14,885 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:14,885 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:14,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:14,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504194561] [2025-04-13 18:35:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504194561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:14,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416930351] [2025-04-13 18:35:14,969 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:14,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:14,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 18:35:15,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:15,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:15,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:15,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:15,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:15,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416930351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:15,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-04-13 18:35:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292624998] [2025-04-13 18:35:15,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:15,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:35:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:15,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:35:15,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:15,243 INFO L87 Difference]: Start difference. First operand 8295 states and 36312 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 18:35:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:15,959 INFO L93 Difference]: Finished difference Result 16275 states and 72252 transitions. [2025-04-13 18:35:15,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:35:15,960 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 30 [2025-04-13 18:35:15,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:16,019 INFO L225 Difference]: With dead ends: 16275 [2025-04-13 18:35:16,020 INFO L226 Difference]: Without dead ends: 15267 [2025-04-13 18:35:16,026 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:35:16,027 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 149 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:16,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 85 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:35:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15267 states. [2025-04-13 18:35:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15267 to 9475. [2025-04-13 18:35:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9475 states, 9474 states have (on average 4.413763985644923) internal successors, (41816), 9474 states have internal predecessors, (41816), 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 18:35:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9475 states to 9475 states and 41816 transitions. [2025-04-13 18:35:16,276 INFO L79 Accepts]: Start accepts. Automaton has 9475 states and 41816 transitions. Word has length 30 [2025-04-13 18:35:16,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:16,276 INFO L485 AbstractCegarLoop]: Abstraction has 9475 states and 41816 transitions. [2025-04-13 18:35:16,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 18:35:16,276 INFO L278 IsEmpty]: Start isEmpty. Operand 9475 states and 41816 transitions. [2025-04-13 18:35:16,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:16,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:16,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:16,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 18:35:16,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 18:35:16,494 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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 18:35:16,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 629584992, now seen corresponding path program 7 times [2025-04-13 18:35:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:16,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571516065] [2025-04-13 18:35:16,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:16,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:35:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:16,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:16,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:16,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571516065] [2025-04-13 18:35:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571516065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:16,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968959304] [2025-04-13 18:35:16,562 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:16,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:16,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:16,563 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:16,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 18:35:16,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:35:16,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:16,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:16,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:16,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:16,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:16,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968959304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:16,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-13 18:35:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124213879] [2025-04-13 18:35:16,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:16,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:35:16,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:16,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:35:16,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:35:16,685 INFO L87 Difference]: Start difference. First operand 9475 states and 41816 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 18:35:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:17,048 INFO L93 Difference]: Finished difference Result 13688 states and 60278 transitions. [2025-04-13 18:35:17,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:17,049 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 30 [2025-04-13 18:35:17,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:17,095 INFO L225 Difference]: With dead ends: 13688 [2025-04-13 18:35:17,096 INFO L226 Difference]: Without dead ends: 12614 [2025-04-13 18:35:17,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:17,101 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 126 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:17,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 30 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12614 states. [2025-04-13 18:35:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12614 to 11166. [2025-04-13 18:35:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11166 states, 11165 states have (on average 4.4002686968204205) internal successors, (49129), 11165 states have internal predecessors, (49129), 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 18:35:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11166 states to 11166 states and 49129 transitions. [2025-04-13 18:35:17,314 INFO L79 Accepts]: Start accepts. Automaton has 11166 states and 49129 transitions. Word has length 30 [2025-04-13 18:35:17,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:17,315 INFO L485 AbstractCegarLoop]: Abstraction has 11166 states and 49129 transitions. [2025-04-13 18:35:17,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 18:35:17,315 INFO L278 IsEmpty]: Start isEmpty. Operand 11166 states and 49129 transitions. [2025-04-13 18:35:17,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:17,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:17,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:17,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:17,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 18:35:17,536 INFO L403 AbstractCegarLoop]: === Iteration 24 === 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 18:35:17,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -230549700, now seen corresponding path program 8 times [2025-04-13 18:35:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:17,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130399481] [2025-04-13 18:35:17,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:17,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:17,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:17,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:17,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:17,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130399481] [2025-04-13 18:35:17,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130399481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:17,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378670514] [2025-04-13 18:35:17,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:17,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:17,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:17,624 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:17,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 18:35:17,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:17,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:17,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:17,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:17,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:17,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:17,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378670514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:17,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-04-13 18:35:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208299164] [2025-04-13 18:35:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:17,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:17,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:17,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:17,728 INFO L87 Difference]: Start difference. First operand 11166 states and 49129 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:17,909 INFO L93 Difference]: Finished difference Result 15423 states and 67916 transitions. [2025-04-13 18:35:17,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:17,909 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:17,909 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:17,959 INFO L225 Difference]: With dead ends: 15423 [2025-04-13 18:35:17,959 INFO L226 Difference]: Without dead ends: 14183 [2025-04-13 18:35:17,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:17,965 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:17,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14183 states. [2025-04-13 18:35:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14183 to 11894. [2025-04-13 18:35:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11894 states, 11893 states have (on average 4.401833011014883) internal successors, (52351), 11893 states have internal predecessors, (52351), 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 18:35:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11894 states to 11894 states and 52351 transitions. [2025-04-13 18:35:18,249 INFO L79 Accepts]: Start accepts. Automaton has 11894 states and 52351 transitions. Word has length 30 [2025-04-13 18:35:18,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:18,250 INFO L485 AbstractCegarLoop]: Abstraction has 11894 states and 52351 transitions. [2025-04-13 18:35:18,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:18,250 INFO L278 IsEmpty]: Start isEmpty. Operand 11894 states and 52351 transitions. [2025-04-13 18:35:18,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:18,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:18,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:18,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:35:18,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:18,470 INFO L403 AbstractCegarLoop]: === Iteration 25 === 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 18:35:18,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1098082194, now seen corresponding path program 9 times [2025-04-13 18:35:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:18,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826024124] [2025-04-13 18:35:18,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:18,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:18,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:18,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:18,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:18,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826024124] [2025-04-13 18:35:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826024124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213209305] [2025-04-13 18:35:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:18,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:18,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:18,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:18,536 INFO L87 Difference]: Start difference. First operand 11894 states and 52351 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:18,704 INFO L93 Difference]: Finished difference Result 13945 states and 60112 transitions. [2025-04-13 18:35:18,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:18,704 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:18,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:18,751 INFO L225 Difference]: With dead ends: 13945 [2025-04-13 18:35:18,751 INFO L226 Difference]: Without dead ends: 12706 [2025-04-13 18:35:18,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:18,757 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:18,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 19 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12706 states. [2025-04-13 18:35:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12706 to 11910. [2025-04-13 18:35:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11910 states, 11909 states have (on average 4.400789319002435) internal successors, (52409), 11909 states have internal predecessors, (52409), 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 18:35:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11910 states to 11910 states and 52409 transitions. [2025-04-13 18:35:19,069 INFO L79 Accepts]: Start accepts. Automaton has 11910 states and 52409 transitions. Word has length 30 [2025-04-13 18:35:19,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:19,069 INFO L485 AbstractCegarLoop]: Abstraction has 11910 states and 52409 transitions. [2025-04-13 18:35:19,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:19,069 INFO L278 IsEmpty]: Start isEmpty. Operand 11910 states and 52409 transitions. [2025-04-13 18:35:19,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:19,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:19,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:19,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:35:19,088 INFO L403 AbstractCegarLoop]: === Iteration 26 === 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 18:35:19,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 54683742, now seen corresponding path program 10 times [2025-04-13 18:35:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:19,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097564587] [2025-04-13 18:35:19,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:19,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:19,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:19,095 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:19,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:19,149 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 18:35:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:19,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097564587] [2025-04-13 18:35:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097564587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:19,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738058570] [2025-04-13 18:35:19,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:19,151 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:19,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 18:35:19,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:19,198 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:19,198 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:19,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:19,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:19,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:19,254 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 18:35:19,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:19,315 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 18:35:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738058570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:19,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:19,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-04-13 18:35:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539096913] [2025-04-13 18:35:19,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:19,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:35:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:19,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:35:19,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:19,316 INFO L87 Difference]: Start difference. First operand 11910 states and 52409 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 18:35:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:19,928 INFO L93 Difference]: Finished difference Result 21374 states and 93605 transitions. [2025-04-13 18:35:19,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:35:19,928 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 30 [2025-04-13 18:35:19,928 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:19,997 INFO L225 Difference]: With dead ends: 21374 [2025-04-13 18:35:19,997 INFO L226 Difference]: Without dead ends: 19907 [2025-04-13 18:35:20,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:35:20,009 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 213 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:20,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 89 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:35:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19907 states. [2025-04-13 18:35:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19907 to 11915. [2025-04-13 18:35:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11915 states, 11914 states have (on average 4.398522746348833) internal successors, (52404), 11914 states have internal predecessors, (52404), 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 18:35:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11915 states to 11915 states and 52404 transitions. [2025-04-13 18:35:20,447 INFO L79 Accepts]: Start accepts. Automaton has 11915 states and 52404 transitions. Word has length 30 [2025-04-13 18:35:20,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:20,447 INFO L485 AbstractCegarLoop]: Abstraction has 11915 states and 52404 transitions. [2025-04-13 18:35:20,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 18:35:20,447 INFO L278 IsEmpty]: Start isEmpty. Operand 11915 states and 52404 transitions. [2025-04-13 18:35:20,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:20,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:20,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:20,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:20,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 18:35:20,673 INFO L403 AbstractCegarLoop]: === Iteration 27 === 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 18:35:20,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1169525936, now seen corresponding path program 11 times [2025-04-13 18:35:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:20,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566354005] [2025-04-13 18:35:20,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:20,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:20,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:20,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:20,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566354005] [2025-04-13 18:35:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566354005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148446317] [2025-04-13 18:35:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:20,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:20,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:20,736 INFO L87 Difference]: Start difference. First operand 11915 states and 52404 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:20,899 INFO L93 Difference]: Finished difference Result 14096 states and 61133 transitions. [2025-04-13 18:35:20,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:20,900 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:20,900 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:20,956 INFO L225 Difference]: With dead ends: 14096 [2025-04-13 18:35:20,956 INFO L226 Difference]: Without dead ends: 12707 [2025-04-13 18:35:20,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:20,962 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:20,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12707 states. [2025-04-13 18:35:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12707 to 11753. [2025-04-13 18:35:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11753 states, 11752 states have (on average 4.403931245745405) internal successors, (51755), 11752 states have internal predecessors, (51755), 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 18:35:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11753 states to 11753 states and 51755 transitions. [2025-04-13 18:35:21,260 INFO L79 Accepts]: Start accepts. Automaton has 11753 states and 51755 transitions. Word has length 30 [2025-04-13 18:35:21,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:21,260 INFO L485 AbstractCegarLoop]: Abstraction has 11753 states and 51755 transitions. [2025-04-13 18:35:21,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:21,261 INFO L278 IsEmpty]: Start isEmpty. Operand 11753 states and 51755 transitions. [2025-04-13 18:35:21,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:21,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:21,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:21,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:35:21,349 INFO L403 AbstractCegarLoop]: === Iteration 28 === 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 18:35:21,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1686657366, now seen corresponding path program 12 times [2025-04-13 18:35:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:21,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857489611] [2025-04-13 18:35:21,349 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:21,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:35:21,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:21,356 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:21,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857489611] [2025-04-13 18:35:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857489611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:21,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:35:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911248012] [2025-04-13 18:35:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:21,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:35:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:35:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:35:21,437 INFO L87 Difference]: Start difference. First operand 11753 states and 51755 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:21,691 INFO L93 Difference]: Finished difference Result 15587 states and 69558 transitions. [2025-04-13 18:35:21,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:35:21,691 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:21,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:21,747 INFO L225 Difference]: With dead ends: 15587 [2025-04-13 18:35:21,747 INFO L226 Difference]: Without dead ends: 15009 [2025-04-13 18:35:21,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:35:21,754 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:21,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 37 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15009 states. [2025-04-13 18:35:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15009 to 11755. [2025-04-13 18:35:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11755 states, 11754 states have (on average 4.403607282627191) internal successors, (51760), 11754 states have internal predecessors, (51760), 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 18:35:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11755 states to 11755 states and 51760 transitions. [2025-04-13 18:35:22,000 INFO L79 Accepts]: Start accepts. Automaton has 11755 states and 51760 transitions. Word has length 30 [2025-04-13 18:35:22,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:22,000 INFO L485 AbstractCegarLoop]: Abstraction has 11755 states and 51760 transitions. [2025-04-13 18:35:22,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:22,000 INFO L278 IsEmpty]: Start isEmpty. Operand 11755 states and 51760 transitions. [2025-04-13 18:35:22,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:35:22,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:22,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:22,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:35:22,020 INFO L403 AbstractCegarLoop]: === Iteration 29 === 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 18:35:22,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1489694834, now seen corresponding path program 13 times [2025-04-13 18:35:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:22,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334717192] [2025-04-13 18:35:22,020 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:35:22,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:35:22,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:22,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:22,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334717192] [2025-04-13 18:35:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334717192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:22,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069325630] [2025-04-13 18:35:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:22,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:22,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:22,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:22,070 INFO L87 Difference]: Start difference. First operand 11755 states and 51760 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:22,269 INFO L93 Difference]: Finished difference Result 15090 states and 66268 transitions. [2025-04-13 18:35:22,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:22,269 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:35:22,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:22,333 INFO L225 Difference]: With dead ends: 15090 [2025-04-13 18:35:22,333 INFO L226 Difference]: Without dead ends: 14086 [2025-04-13 18:35:22,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:22,340 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:22,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 21 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14086 states. [2025-04-13 18:35:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14086 to 11705. [2025-04-13 18:35:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11705 states, 11704 states have (on average 4.407809295967191) internal successors, (51589), 11704 states have internal predecessors, (51589), 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 18:35:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11705 states to 11705 states and 51589 transitions. [2025-04-13 18:35:22,653 INFO L79 Accepts]: Start accepts. Automaton has 11705 states and 51589 transitions. Word has length 30 [2025-04-13 18:35:22,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:22,653 INFO L485 AbstractCegarLoop]: Abstraction has 11705 states and 51589 transitions. [2025-04-13 18:35:22,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:22,653 INFO L278 IsEmpty]: Start isEmpty. Operand 11705 states and 51589 transitions. [2025-04-13 18:35:22,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:35:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:22,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:22,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:35:22,673 INFO L403 AbstractCegarLoop]: === Iteration 30 === 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 18:35:22,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1730581011, now seen corresponding path program 1 times [2025-04-13 18:35:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:22,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410723261] [2025-04-13 18:35:22,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:22,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:35:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:22,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:22,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410723261] [2025-04-13 18:35:22,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410723261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:22,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152464168] [2025-04-13 18:35:22,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:22,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:22,745 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:22,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 18:35:22,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:35:22,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:22,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:22,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:22,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152464168] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:22,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 18:35:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117807303] [2025-04-13 18:35:22,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:22,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:35:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:22,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:35:22,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:35:22,886 INFO L87 Difference]: Start difference. First operand 11705 states and 51589 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 18:35:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:23,162 INFO L93 Difference]: Finished difference Result 15608 states and 68251 transitions. [2025-04-13 18:35:23,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:23,163 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 32 [2025-04-13 18:35:23,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:23,291 INFO L225 Difference]: With dead ends: 15608 [2025-04-13 18:35:23,291 INFO L226 Difference]: Without dead ends: 14848 [2025-04-13 18:35:23,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:23,295 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 138 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:23,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 30 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14848 states. [2025-04-13 18:35:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14848 to 12449. [2025-04-13 18:35:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12449 states, 12448 states have (on average 4.410025706940874) internal successors, (54896), 12448 states have internal predecessors, (54896), 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 18:35:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12449 states to 12449 states and 54896 transitions. [2025-04-13 18:35:23,515 INFO L79 Accepts]: Start accepts. Automaton has 12449 states and 54896 transitions. Word has length 32 [2025-04-13 18:35:23,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:23,515 INFO L485 AbstractCegarLoop]: Abstraction has 12449 states and 54896 transitions. [2025-04-13 18:35:23,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 18:35:23,515 INFO L278 IsEmpty]: Start isEmpty. Operand 12449 states and 54896 transitions. [2025-04-13 18:35:23,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:35:23,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:23,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:23,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:23,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:23,740 INFO L403 AbstractCegarLoop]: === Iteration 31 === 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 18:35:23,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1065287391, now seen corresponding path program 2 times [2025-04-13 18:35:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:23,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100414989] [2025-04-13 18:35:23,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:23,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:23,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:23,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:23,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:23,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100414989] [2025-04-13 18:35:23,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100414989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:23,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344834589] [2025-04-13 18:35:23,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:23,812 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:23,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 18:35:23,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:23,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:23,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:23,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:23,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:23,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:23,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344834589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:23,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:35:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826304624] [2025-04-13 18:35:23,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:23,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:35:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:23,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:35:23,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:35:23,961 INFO L87 Difference]: Start difference. First operand 12449 states and 54896 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 18:35:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:24,233 INFO L93 Difference]: Finished difference Result 16779 states and 72608 transitions. [2025-04-13 18:35:24,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:35:24,233 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 32 [2025-04-13 18:35:24,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:24,294 INFO L225 Difference]: With dead ends: 16779 [2025-04-13 18:35:24,294 INFO L226 Difference]: Without dead ends: 16019 [2025-04-13 18:35:24,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:35:24,300 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 198 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:24,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 29 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:35:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16019 states. [2025-04-13 18:35:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16019 to 9867. [2025-04-13 18:35:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9867 states, 9866 states have (on average 4.336509223596189) internal successors, (42784), 9866 states have internal predecessors, (42784), 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 18:35:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 42784 transitions. [2025-04-13 18:35:24,523 INFO L79 Accepts]: Start accepts. Automaton has 9867 states and 42784 transitions. Word has length 32 [2025-04-13 18:35:24,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:24,523 INFO L485 AbstractCegarLoop]: Abstraction has 9867 states and 42784 transitions. [2025-04-13 18:35:24,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 18:35:24,524 INFO L278 IsEmpty]: Start isEmpty. Operand 9867 states and 42784 transitions. [2025-04-13 18:35:24,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:35:24,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:24,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:24,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:24,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:24,740 INFO L403 AbstractCegarLoop]: === Iteration 32 === 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 18:35:24,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1261647647, now seen corresponding path program 3 times [2025-04-13 18:35:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:24,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692540767] [2025-04-13 18:35:24,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:24,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:24,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:24,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:35:24,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:35:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:24,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692540767] [2025-04-13 18:35:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692540767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:35:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301587701] [2025-04-13 18:35:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:24,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:24,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:24,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:35:24,790 INFO L87 Difference]: Start difference. First operand 9867 states and 42784 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 18:35:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:24,953 INFO L93 Difference]: Finished difference Result 13075 states and 56205 transitions. [2025-04-13 18:35:24,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:24,953 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2025-04-13 18:35:24,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:25,004 INFO L225 Difference]: With dead ends: 13075 [2025-04-13 18:35:25,004 INFO L226 Difference]: Without dead ends: 12301 [2025-04-13 18:35:25,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:35:25,010 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:25,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 24 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2025-04-13 18:35:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 11515. [2025-04-13 18:35:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11515 states, 11514 states have (on average 4.3699843668577385) internal successors, (50316), 11514 states have internal predecessors, (50316), 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 18:35:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11515 states to 11515 states and 50316 transitions. [2025-04-13 18:35:25,303 INFO L79 Accepts]: Start accepts. Automaton has 11515 states and 50316 transitions. Word has length 32 [2025-04-13 18:35:25,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:25,303 INFO L485 AbstractCegarLoop]: Abstraction has 11515 states and 50316 transitions. [2025-04-13 18:35:25,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 18:35:25,304 INFO L278 IsEmpty]: Start isEmpty. Operand 11515 states and 50316 transitions. [2025-04-13 18:35:25,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:35:25,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:25,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:25,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:35:25,325 INFO L403 AbstractCegarLoop]: === Iteration 33 === 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 18:35:25,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1083392825, now seen corresponding path program 4 times [2025-04-13 18:35:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:25,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078080112] [2025-04-13 18:35:25,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:25,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:25,333 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:25,333 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:25,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:25,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078080112] [2025-04-13 18:35:25,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078080112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:25,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189419178] [2025-04-13 18:35:25,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:25,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:25,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:25,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 18:35:25,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:25,470 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:25,470 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:25,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:25,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:25,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:25,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:35:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189419178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:35:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-04-13 18:35:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277637872] [2025-04-13 18:35:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:25,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:35:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:25,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:35:25,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:35:25,510 INFO L87 Difference]: Start difference. First operand 11515 states and 50316 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 18:35:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:25,688 INFO L93 Difference]: Finished difference Result 12830 states and 55215 transitions. [2025-04-13 18:35:25,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:35:25,688 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2025-04-13 18:35:25,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:25,742 INFO L225 Difference]: With dead ends: 12830 [2025-04-13 18:35:25,742 INFO L226 Difference]: Without dead ends: 12393 [2025-04-13 18:35:25,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:35:25,748 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:25,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 17 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:35:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12393 states. [2025-04-13 18:35:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12393 to 10923. [2025-04-13 18:35:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10923 states, 10922 states have (on average 4.353506683757553) internal successors, (47549), 10922 states have internal predecessors, (47549), 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 18:35:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10923 states to 10923 states and 47549 transitions. [2025-04-13 18:35:25,977 INFO L79 Accepts]: Start accepts. Automaton has 10923 states and 47549 transitions. Word has length 32 [2025-04-13 18:35:25,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:25,978 INFO L485 AbstractCegarLoop]: Abstraction has 10923 states and 47549 transitions. [2025-04-13 18:35:25,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 18:35:25,978 INFO L278 IsEmpty]: Start isEmpty. Operand 10923 states and 47549 transitions. [2025-04-13 18:35:25,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:35:25,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:25,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:26,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:26,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:26,198 INFO L403 AbstractCegarLoop]: === Iteration 34 === 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 18:35:26,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash 752667003, now seen corresponding path program 5 times [2025-04-13 18:35:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:26,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908147129] [2025-04-13 18:35:26,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:26,201 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:26,205 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:26,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:26,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:26,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:26,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908147129] [2025-04-13 18:35:26,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908147129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:26,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893656067] [2025-04-13 18:35:26,252 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:26,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:26,254 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:35:26,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:35:26,301 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:35:26,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:26,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:26,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:35:26,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:26,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893656067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:26,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:26,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:35:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208089971] [2025-04-13 18:35:26,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:26,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:35:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:26,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:35:26,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:35:26,417 INFO L87 Difference]: Start difference. First operand 10923 states and 47549 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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 18:35:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:26,852 INFO L93 Difference]: Finished difference Result 18229 states and 80388 transitions. [2025-04-13 18:35:26,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:35:26,853 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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) Word has length 32 [2025-04-13 18:35:26,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:26,915 INFO L225 Difference]: With dead ends: 18229 [2025-04-13 18:35:26,915 INFO L226 Difference]: Without dead ends: 17698 [2025-04-13 18:35:26,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:35:26,922 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 136 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:26,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 74 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:35:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17698 states. [2025-04-13 18:35:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17698 to 8195. [2025-04-13 18:35:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8195 states, 8194 states have (on average 4.323529411764706) internal successors, (35427), 8194 states have internal predecessors, (35427), 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 18:35:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8195 states to 8195 states and 35427 transitions. [2025-04-13 18:35:27,139 INFO L79 Accepts]: Start accepts. Automaton has 8195 states and 35427 transitions. Word has length 32 [2025-04-13 18:35:27,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:27,140 INFO L485 AbstractCegarLoop]: Abstraction has 8195 states and 35427 transitions. [2025-04-13 18:35:27,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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 18:35:27,140 INFO L278 IsEmpty]: Start isEmpty. Operand 8195 states and 35427 transitions. [2025-04-13 18:35:27,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:35:27,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:27,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:27,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:27,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:27,354 INFO L403 AbstractCegarLoop]: === Iteration 35 === 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 18:35:27,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 24575032, now seen corresponding path program 1 times [2025-04-13 18:35:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:27,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977004685] [2025-04-13 18:35:27,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:27,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:35:27,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:35:27,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:27,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:27,493 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 18:35:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:27,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977004685] [2025-04-13 18:35:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977004685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:27,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042734766] [2025-04-13 18:35:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:35:27,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:27,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:27,496 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:27,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:35:27,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:35:27,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:35:27,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:27,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:27,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:35:27,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:27,584 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 18:35:27,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:27,684 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 18:35:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042734766] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:27,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-13 18:35:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851242563] [2025-04-13 18:35:27,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:27,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:35:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:35:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:35:27,686 INFO L87 Difference]: Start difference. First operand 8195 states and 35427 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 18:35:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:28,135 INFO L93 Difference]: Finished difference Result 21016 states and 91203 transitions. [2025-04-13 18:35:28,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:35:28,136 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 18:35:28,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:28,226 INFO L225 Difference]: With dead ends: 21016 [2025-04-13 18:35:28,227 INFO L226 Difference]: Without dead ends: 18887 [2025-04-13 18:35:28,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:35:28,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:28,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:35:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18887 states. [2025-04-13 18:35:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18887 to 12945. [2025-04-13 18:35:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12945 states, 12944 states have (on average 4.359780593325093) internal successors, (56433), 12944 states have internal predecessors, (56433), 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 18:35:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12945 states to 12945 states and 56433 transitions. [2025-04-13 18:35:28,649 INFO L79 Accepts]: Start accepts. Automaton has 12945 states and 56433 transitions. Word has length 34 [2025-04-13 18:35:28,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:28,649 INFO L485 AbstractCegarLoop]: Abstraction has 12945 states and 56433 transitions. [2025-04-13 18:35:28,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 18:35:28,649 INFO L278 IsEmpty]: Start isEmpty. Operand 12945 states and 56433 transitions. [2025-04-13 18:35:28,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:35:28,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:28,679 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:28,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:28,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 18:35:28,880 INFO L403 AbstractCegarLoop]: === Iteration 36 === 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 18:35:28,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1649571633, now seen corresponding path program 2 times [2025-04-13 18:35:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:28,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702178994] [2025-04-13 18:35:28,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:28,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:35:28,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:35:28,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:28,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:29,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702178994] [2025-04-13 18:35:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702178994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:29,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628272493] [2025-04-13 18:35:29,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:29,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:29,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:29,048 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:29,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:35:29,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:35:29,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:35:29,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:29,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:29,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:29,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:29,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628272493] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:29,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-04-13 18:35:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283912414] [2025-04-13 18:35:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:29,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:35:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:29,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:35:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:35:29,180 INFO L87 Difference]: Start difference. First operand 12945 states and 56433 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 18:35:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:29,906 INFO L93 Difference]: Finished difference Result 32307 states and 142116 transitions. [2025-04-13 18:35:29,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:35:29,906 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 36 [2025-04-13 18:35:29,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:30,025 INFO L225 Difference]: With dead ends: 32307 [2025-04-13 18:35:30,026 INFO L226 Difference]: Without dead ends: 30710 [2025-04-13 18:35:30,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:35:30,039 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 331 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:30,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 82 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:35:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30710 states. [2025-04-13 18:35:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30710 to 15449. [2025-04-13 18:35:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15449 states, 15448 states have (on average 4.3790781978249615) internal successors, (67648), 15448 states have internal predecessors, (67648), 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 18:35:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15449 states to 15449 states and 67648 transitions. [2025-04-13 18:35:30,471 INFO L79 Accepts]: Start accepts. Automaton has 15449 states and 67648 transitions. Word has length 36 [2025-04-13 18:35:30,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:30,472 INFO L485 AbstractCegarLoop]: Abstraction has 15449 states and 67648 transitions. [2025-04-13 18:35:30,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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 18:35:30,472 INFO L278 IsEmpty]: Start isEmpty. Operand 15449 states and 67648 transitions. [2025-04-13 18:35:30,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:35:30,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:30,498 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:30,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:35:30,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 18:35:30,699 INFO L403 AbstractCegarLoop]: === Iteration 37 === 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 18:35:30,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:30,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1423757111, now seen corresponding path program 3 times [2025-04-13 18:35:30,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:30,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152560695] [2025-04-13 18:35:30,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:30,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-13 18:35:30,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:35:30,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:35:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:30,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152560695] [2025-04-13 18:35:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152560695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:30,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920182995] [2025-04-13 18:35:30,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:30,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:30,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:30,782 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:30,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:35:30,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-13 18:35:30,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:35:30,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:35:30,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:30,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:30,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:30,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920182995] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:30,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 18:35:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543904007] [2025-04-13 18:35:30,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:30,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:35:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:30,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:35:30,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:35:30,964 INFO L87 Difference]: Start difference. First operand 15449 states and 67648 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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 18:35:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:32,775 INFO L93 Difference]: Finished difference Result 47063 states and 211452 transitions. [2025-04-13 18:35:32,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:35:32,775 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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 36 [2025-04-13 18:35:32,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:32,946 INFO L225 Difference]: With dead ends: 47063 [2025-04-13 18:35:32,947 INFO L226 Difference]: Without dead ends: 41576 [2025-04-13 18:35:32,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:35:32,968 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 331 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 3691 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:32,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 367 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3691 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:35:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41576 states. [2025-04-13 18:35:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41576 to 23081. [2025-04-13 18:35:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23081 states, 23080 states have (on average 4.375649913344887) internal successors, (100990), 23080 states have internal predecessors, (100990), 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 18:35:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23081 states to 23081 states and 100990 transitions. [2025-04-13 18:35:33,585 INFO L79 Accepts]: Start accepts. Automaton has 23081 states and 100990 transitions. Word has length 36 [2025-04-13 18:35:33,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:33,585 INFO L485 AbstractCegarLoop]: Abstraction has 23081 states and 100990 transitions. [2025-04-13 18:35:33,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 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 18:35:33,585 INFO L278 IsEmpty]: Start isEmpty. Operand 23081 states and 100990 transitions. [2025-04-13 18:35:33,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:35:33,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:33,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:33,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:35:33,827 INFO L403 AbstractCegarLoop]: === Iteration 38 === 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 18:35:33,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1818960406, now seen corresponding path program 4 times [2025-04-13 18:35:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:33,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230451887] [2025-04-13 18:35:33,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:33,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:33,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:33,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:33,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230451887] [2025-04-13 18:35:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230451887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:33,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570071304] [2025-04-13 18:35:33,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:33,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:33,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:33,931 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:33,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:35:33,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:33,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:33,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:33,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:33,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:33,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:34,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570071304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:34,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 18:35:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175657700] [2025-04-13 18:35:34,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:34,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:35:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:34,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:35:34,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:35:34,083 INFO L87 Difference]: Start difference. First operand 23081 states and 100990 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 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 18:35:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:35,278 INFO L93 Difference]: Finished difference Result 66408 states and 308693 transitions. [2025-04-13 18:35:35,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:35:35,278 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 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) Word has length 38 [2025-04-13 18:35:35,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:35,598 INFO L225 Difference]: With dead ends: 66408 [2025-04-13 18:35:35,598 INFO L226 Difference]: Without dead ends: 63520 [2025-04-13 18:35:35,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:35:35,624 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 388 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:35,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 149 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:35:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63520 states. [2025-04-13 18:35:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63520 to 36759. [2025-04-13 18:35:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36759 states, 36758 states have (on average 4.523069807932967) internal successors, (166259), 36758 states have internal predecessors, (166259), 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 18:35:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36759 states to 36759 states and 166259 transitions. [2025-04-13 18:35:36,646 INFO L79 Accepts]: Start accepts. Automaton has 36759 states and 166259 transitions. Word has length 38 [2025-04-13 18:35:36,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:36,646 INFO L485 AbstractCegarLoop]: Abstraction has 36759 states and 166259 transitions. [2025-04-13 18:35:36,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 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 18:35:36,646 INFO L278 IsEmpty]: Start isEmpty. Operand 36759 states and 166259 transitions. [2025-04-13 18:35:36,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:35:36,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:36,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:36,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 18:35:36,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:36,922 INFO L403 AbstractCegarLoop]: === Iteration 39 === 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 18:35:36,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 888304990, now seen corresponding path program 5 times [2025-04-13 18:35:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:36,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496699036] [2025-04-13 18:35:36,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:36,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:36,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:36,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:36,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496699036] [2025-04-13 18:35:36,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496699036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:36,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108319972] [2025-04-13 18:35:36,998 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:36,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:36,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:37,000 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:37,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:35:37,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:37,042 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:37,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:37,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:37,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:37,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:37,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108319972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:37,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:37,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-04-13 18:35:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876237283] [2025-04-13 18:35:37,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:37,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:35:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:37,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:35:37,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:35:37,181 INFO L87 Difference]: Start difference. First operand 36759 states and 166259 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 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 18:35:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:38,907 INFO L93 Difference]: Finished difference Result 99448 states and 467187 transitions. [2025-04-13 18:35:38,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:35:38,907 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 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 38 [2025-04-13 18:35:38,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:39,626 INFO L225 Difference]: With dead ends: 99448 [2025-04-13 18:35:39,626 INFO L226 Difference]: Without dead ends: 96781 [2025-04-13 18:35:39,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:35:39,648 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 318 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:39,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 146 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:35:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96781 states. [2025-04-13 18:35:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96781 to 50756. [2025-04-13 18:35:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50756 states, 50755 states have (on average 4.618264210422619) internal successors, (234400), 50755 states have internal predecessors, (234400), 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 18:35:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50756 states to 50756 states and 234400 transitions. [2025-04-13 18:35:41,651 INFO L79 Accepts]: Start accepts. Automaton has 50756 states and 234400 transitions. Word has length 38 [2025-04-13 18:35:41,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:41,651 INFO L485 AbstractCegarLoop]: Abstraction has 50756 states and 234400 transitions. [2025-04-13 18:35:41,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 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 18:35:41,651 INFO L278 IsEmpty]: Start isEmpty. Operand 50756 states and 234400 transitions. [2025-04-13 18:35:41,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:35:41,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:41,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:41,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 18:35:41,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 18:35:41,976 INFO L403 AbstractCegarLoop]: === Iteration 40 === 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 18:35:41,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1487257622, now seen corresponding path program 6 times [2025-04-13 18:35:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:41,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759714196] [2025-04-13 18:35:41,977 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:41,980 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:41,987 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:41,987 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:42,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759714196] [2025-04-13 18:35:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759714196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:42,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925782135] [2025-04-13 18:35:42,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:42,077 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:42,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:35:42,114 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:35:42,131 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:42,132 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:42,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:42,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:42,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:35:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925782135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:42,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:42,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 18:35:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946903546] [2025-04-13 18:35:42,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:42,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:35:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:42,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:35:42,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:35:42,542 INFO L87 Difference]: Start difference. First operand 50756 states and 234400 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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 18:35:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:45,949 INFO L93 Difference]: Finished difference Result 139077 states and 654520 transitions. [2025-04-13 18:35:45,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:35:45,949 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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 38 [2025-04-13 18:35:45,949 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:46,657 INFO L225 Difference]: With dead ends: 139077 [2025-04-13 18:35:46,657 INFO L226 Difference]: Without dead ends: 134547 [2025-04-13 18:35:46,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1174, Invalid=4376, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 18:35:46,700 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 647 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:46,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 311 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:35:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134547 states. [2025-04-13 18:35:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134547 to 71192. [2025-04-13 18:35:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71192 states, 71191 states have (on average 4.657189813319099) internal successors, (331550), 71191 states have internal predecessors, (331550), 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 18:35:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71192 states to 71192 states and 331550 transitions. [2025-04-13 18:35:49,906 INFO L79 Accepts]: Start accepts. Automaton has 71192 states and 331550 transitions. Word has length 38 [2025-04-13 18:35:49,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:49,907 INFO L485 AbstractCegarLoop]: Abstraction has 71192 states and 331550 transitions. [2025-04-13 18:35:49,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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 18:35:49,907 INFO L278 IsEmpty]: Start isEmpty. Operand 71192 states and 331550 transitions. [2025-04-13 18:35:50,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:35:50,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:50,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:50,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:50,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 18:35:50,323 INFO L403 AbstractCegarLoop]: === Iteration 41 === 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 18:35:50,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -480716010, now seen corresponding path program 7 times [2025-04-13 18:35:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:50,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709686149] [2025-04-13 18:35:50,324 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:50,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:35:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:50,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709686149] [2025-04-13 18:35:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709686149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:50,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840251081] [2025-04-13 18:35:50,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:50,590 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:35:50,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:35:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:35:50,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:35:50,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:50,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:50,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:35:50,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:50,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:35:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840251081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:50,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 18:35:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551504210] [2025-04-13 18:35:50,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:50,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:35:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:50,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:35:50,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:35:50,806 INFO L87 Difference]: Start difference. First operand 71192 states and 331550 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 18:35:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:55,758 INFO L93 Difference]: Finished difference Result 176290 states and 846264 transitions. [2025-04-13 18:35:55,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-04-13 18:35:55,758 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 38 [2025-04-13 18:35:55,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:56,891 INFO L225 Difference]: With dead ends: 176290 [2025-04-13 18:35:56,891 INFO L226 Difference]: Without dead ends: 171759 [2025-04-13 18:35:56,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1237, Invalid=8663, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 18:35:56,943 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 489 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:56,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 532 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3923 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:35:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171759 states. [2025-04-13 18:36:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171759 to 105850. [2025-04-13 18:36:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105850 states, 105849 states have (on average 4.796209694942796) internal successors, (507674), 105849 states have internal predecessors, (507674), 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 18:36:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105850 states to 105850 states and 507674 transitions. [2025-04-13 18:36:01,498 INFO L79 Accepts]: Start accepts. Automaton has 105850 states and 507674 transitions. Word has length 38 [2025-04-13 18:36:01,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:01,498 INFO L485 AbstractCegarLoop]: Abstraction has 105850 states and 507674 transitions. [2025-04-13 18:36:01,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 18:36:01,498 INFO L278 IsEmpty]: Start isEmpty. Operand 105850 states and 507674 transitions. [2025-04-13 18:36:02,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:36:02,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:02,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:02,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:36:02,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-04-13 18:36:02,291 INFO L403 AbstractCegarLoop]: === Iteration 42 === 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 18:36:02,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 937482198, now seen corresponding path program 8 times [2025-04-13 18:36:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:02,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465558069] [2025-04-13 18:36:02,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:36:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:02,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:36:02,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:02,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:36:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:02,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465558069] [2025-04-13 18:36:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465558069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:02,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986713927] [2025-04-13 18:36:02,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:36:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:02,403 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:36:02,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:36:02,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:36:02,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:02,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:02,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:02,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:36:02,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:36:02,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:36:02,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986713927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:02,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:02,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 18:36:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424334917] [2025-04-13 18:36:02,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:02,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:36:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:02,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:36:02,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:36:02,600 INFO L87 Difference]: Start difference. First operand 105850 states and 507674 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 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 18:36:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:05,245 INFO L93 Difference]: Finished difference Result 218164 states and 1051040 transitions. [2025-04-13 18:36:05,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:36:05,245 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 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) Word has length 38 [2025-04-13 18:36:05,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:06,840 INFO L225 Difference]: With dead ends: 218164 [2025-04-13 18:36:06,841 INFO L226 Difference]: Without dead ends: 216302 [2025-04-13 18:36:06,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:36:06,904 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 340 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:06,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 128 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:36:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216302 states. [2025-04-13 18:36:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216302 to 108954. [2025-04-13 18:36:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108954 states, 108953 states have (on average 4.792883169807165) internal successors, (522199), 108953 states have internal predecessors, (522199), 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 18:36:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108954 states to 108954 states and 522199 transitions. [2025-04-13 18:36:12,256 INFO L79 Accepts]: Start accepts. Automaton has 108954 states and 522199 transitions. Word has length 38 [2025-04-13 18:36:12,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:12,256 INFO L485 AbstractCegarLoop]: Abstraction has 108954 states and 522199 transitions. [2025-04-13 18:36:12,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 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 18:36:12,256 INFO L278 IsEmpty]: Start isEmpty. Operand 108954 states and 522199 transitions. [2025-04-13 18:36:12,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:36:12,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:12,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:12,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 18:36:13,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:13,065 INFO L403 AbstractCegarLoop]: === Iteration 43 === 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 18:36:13,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1092012640, now seen corresponding path program 9 times [2025-04-13 18:36:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:13,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975091063] [2025-04-13 18:36:13,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:13,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:36:13,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 38 statements. [2025-04-13 18:36:13,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:13,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:13,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975091063] [2025-04-13 18:36:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975091063] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:13,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273646265] [2025-04-13 18:36:13,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:13,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:13,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:13,259 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:36:13,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:36:13,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:36:13,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 38 statements. [2025-04-13 18:36:13,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:13,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:13,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:36:13,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:13,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273646265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:13,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:13,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 18:36:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255987526] [2025-04-13 18:36:13,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:13,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:36:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:13,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:36:13,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:36:13,479 INFO L87 Difference]: Start difference. First operand 108954 states and 522199 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 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 18:36:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:17,192 INFO L93 Difference]: Finished difference Result 309664 states and 1519700 transitions. [2025-04-13 18:36:17,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:36:17,192 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 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) Word has length 38 [2025-04-13 18:36:17,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:19,674 INFO L225 Difference]: With dead ends: 309664 [2025-04-13 18:36:19,674 INFO L226 Difference]: Without dead ends: 306948 [2025-04-13 18:36:19,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=888, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:36:19,773 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 595 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:19,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 109 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:36:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306948 states. [2025-04-13 18:36:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306948 to 132102. [2025-04-13 18:36:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132102 states, 132101 states have (on average 4.844838419088425) internal successors, (640008), 132101 states have internal predecessors, (640008), 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 18:36:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132102 states to 132102 states and 640008 transitions. [2025-04-13 18:36:26,820 INFO L79 Accepts]: Start accepts. Automaton has 132102 states and 640008 transitions. Word has length 38 [2025-04-13 18:36:26,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:26,820 INFO L485 AbstractCegarLoop]: Abstraction has 132102 states and 640008 transitions. [2025-04-13 18:36:26,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 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 18:36:26,820 INFO L278 IsEmpty]: Start isEmpty. Operand 132102 states and 640008 transitions. [2025-04-13 18:36:27,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:36:27,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:27,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:27,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 18:36:27,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:27,745 INFO L403 AbstractCegarLoop]: === Iteration 44 === 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 18:36:27,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2064640840, now seen corresponding path program 10 times [2025-04-13 18:36:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:27,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701034049] [2025-04-13 18:36:27,745 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:36:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:27,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:36:27,758 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:27,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:36:27,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:27,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701034049] [2025-04-13 18:36:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701034049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:27,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635826964] [2025-04-13 18:36:27,830 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:36:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:27,832 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:36:27,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:36:27,860 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:36:27,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:27,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:36:27,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:27,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:36:27,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:36:27,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:36:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635826964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:28,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 18:36:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198374117] [2025-04-13 18:36:28,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:28,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:36:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:36:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:36:28,034 INFO L87 Difference]: Start difference. First operand 132102 states and 640008 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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 18:36:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:33,695 INFO L93 Difference]: Finished difference Result 357743 states and 1792472 transitions. [2025-04-13 18:36:33,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 18:36:33,696 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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 38 [2025-04-13 18:36:33,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:37,603 INFO L225 Difference]: With dead ends: 357743 [2025-04-13 18:36:37,603 INFO L226 Difference]: Without dead ends: 337191 [2025-04-13 18:36:37,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=545, Invalid=3237, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:36:37,782 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 618 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:37,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 327 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:36:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337191 states. [2025-04-13 18:36:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337191 to 231324. [2025-04-13 18:36:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231324 states, 231323 states have (on average 4.995607872974153) internal successors, (1155599), 231323 states have internal predecessors, (1155599), 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 18:36:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231324 states to 231324 states and 1155599 transitions. [2025-04-13 18:36:47,148 INFO L79 Accepts]: Start accepts. Automaton has 231324 states and 1155599 transitions. Word has length 38 [2025-04-13 18:36:47,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:47,148 INFO L485 AbstractCegarLoop]: Abstraction has 231324 states and 1155599 transitions. [2025-04-13 18:36:47,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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 18:36:47,148 INFO L278 IsEmpty]: Start isEmpty. Operand 231324 states and 1155599 transitions. [2025-04-13 18:36:48,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:36:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:48,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:48,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 18:36:48,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:48,402 INFO L403 AbstractCegarLoop]: === Iteration 45 === 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 18:36:48,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash -301013572, now seen corresponding path program 11 times [2025-04-13 18:36:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:48,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411475553] [2025-04-13 18:36:48,403 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:36:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:48,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:36:48,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:48,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:36:48,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:48,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411475553] [2025-04-13 18:36:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411475553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:48,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925467408] [2025-04-13 18:36:48,472 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:36:48,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:48,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:48,474 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:36:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:36:48,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:36:48,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:36:48,526 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:36:48,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:48,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:36:48,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:48,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:36:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925467408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:48,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 18:36:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008723791] [2025-04-13 18:36:48,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:48,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:36:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:48,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:36:48,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:36:48,648 INFO L87 Difference]: Start difference. First operand 231324 states and 1155599 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 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)