/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-more-queue-add-3-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:32:00,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:32:00,185 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:32:00,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:32:00,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:32:00,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:32:00,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:32:00,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:32:00,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:32:00,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:32:00,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:32:00,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:32:00,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:32:00,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:32:00,213 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:32:00,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:32:00,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:32:00,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:32:00,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:32:00,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:32:00,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:32:00,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:32:00,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:32:00,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:32:00,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:32:00,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:32:00,217 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:32:00,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:32:00,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:32:00,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:32:00,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:32:00,456 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:32:00,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-13 18:32:01,751 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db3b22f5/5e99e0413a33406fb2f005808cfdf6e3/FLAG5f4c08fae [2025-04-13 18:32:01,941 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:32:01,941 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-13 18:32:01,951 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db3b22f5/5e99e0413a33406fb2f005808cfdf6e3/FLAG5f4c08fae [2025-04-13 18:32:03,853 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db3b22f5/5e99e0413a33406fb2f005808cfdf6e3 [2025-04-13 18:32:03,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:32:03,856 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:32:03,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:32:03,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:32:03,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:32:03,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:32:03" (1/1) ... [2025-04-13 18:32:03,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1287b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:03, skipping insertion in model container [2025-04-13 18:32:03,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:32:03" (1/1) ... [2025-04-13 18:32:03,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:32:04,043 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-04-13 18:32:04,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:32:04,061 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:32:04,085 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-04-13 18:32:04,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:32:04,095 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:32:04,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04 WrapperNode [2025-04-13 18:32:04,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:32:04,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:32:04,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:32:04,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:32:04,100 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:32:04" (1/1) ... [2025-04-13 18:32:04,108 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:32:04" (1/1) ... [2025-04-13 18:32:04,129 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-04-13 18:32:04,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:32:04,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:32:04,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:32:04,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:32:04,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,157 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:32:04,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:32:04,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:32:04,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:32:04,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:32:04,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (1/1) ... [2025-04-13 18:32:04,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:32:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:04,200 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:32:04,202 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:32:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:32:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:32:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:32:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:32:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:32:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:32:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:32:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:32:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:32:04,220 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:32:04,305 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:32:04,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:32:04,561 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:32:04,561 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:32:04,561 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:32:04,815 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:32:04,821 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 18:32:04,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:32:04 BoogieIcfgContainer [2025-04-13 18:32:04,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:32:04,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:32:04,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:32:04,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:32:04,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:32:03" (1/3) ... [2025-04-13 18:32:04,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a499b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:32:04, skipping insertion in model container [2025-04-13 18:32:04,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:32:04" (2/3) ... [2025-04-13 18:32:04,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a499b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:32:04, skipping insertion in model container [2025-04-13 18:32:04,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:32:04" (3/3) ... [2025-04-13 18:32:04,828 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-04-13 18:32:04,838 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:32:04,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:32:04,839 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:32:04,880 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:32:04,901 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 18:32:04,960 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 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:32:04,976 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:32:04,982 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;@7cac151e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:32:04,983 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:32:04,985 INFO L278 IsEmpty]: Start isEmpty. Operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 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:32:04,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:32:04,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:04,996 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:32:04,996 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 1 more)] === [2025-04-13 18:32:04,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash -893175406, now seen corresponding path program 1 times [2025-04-13 18:32:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:05,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824295375] [2025-04-13 18:32:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:05,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:32:05,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:32:05,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:05,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:05,164 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:32:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:05,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824295375] [2025-04-13 18:32:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824295375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:32:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355742538] [2025-04-13 18:32:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:05,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 18:32:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:05,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 18:32:05,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:32:05,190 INFO L87 Difference]: Start difference. First operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:05,261 INFO L93 Difference]: Finished difference Result 464 states and 1650 transitions. [2025-04-13 18:32:05,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 18:32:05,262 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:32:05,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:05,270 INFO L225 Difference]: With dead ends: 464 [2025-04-13 18:32:05,270 INFO L226 Difference]: Without dead ends: 342 [2025-04-13 18:32:05,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:32:05,274 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:05,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:32:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-04-13 18:32:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-04-13 18:32:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 3.436950146627566) internal successors, (1172), 341 states have internal predecessors, (1172), 0 states have call successors, (0), 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:32:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1172 transitions. [2025-04-13 18:32:05,324 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 1172 transitions. Word has length 20 [2025-04-13 18:32:05,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:05,325 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 1172 transitions. [2025-04-13 18:32:05,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:05,326 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 1172 transitions. [2025-04-13 18:32:05,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:32:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:05,328 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] [2025-04-13 18:32:05,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:32:05,328 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 1 more)] === [2025-04-13 18:32:05,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1843537026, now seen corresponding path program 1 times [2025-04-13 18:32:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:05,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769705211] [2025-04-13 18:32:05,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:32:05,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:32:05,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:05,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:05,515 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:32:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:05,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769705211] [2025-04-13 18:32:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769705211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:32:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807027885] [2025-04-13 18:32:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:05,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:32:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:32:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:32:05,517 INFO L87 Difference]: Start difference. First operand 342 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:05,608 INFO L93 Difference]: Finished difference Result 592 states and 2055 transitions. [2025-04-13 18:32:05,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:32:05,609 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-04-13 18:32:05,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:05,612 INFO L225 Difference]: With dead ends: 592 [2025-04-13 18:32:05,612 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 18:32:05,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:32:05,615 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:05,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 18:32:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-04-13 18:32:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.3324808184143224) internal successors, (1303), 391 states have internal predecessors, (1303), 0 states have call successors, (0), 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:32:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1303 transitions. [2025-04-13 18:32:05,644 INFO L79 Accepts]: Start accepts. Automaton has 392 states and 1303 transitions. Word has length 23 [2025-04-13 18:32:05,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:05,644 INFO L485 AbstractCegarLoop]: Abstraction has 392 states and 1303 transitions. [2025-04-13 18:32:05,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:05,644 INFO L278 IsEmpty]: Start isEmpty. Operand 392 states and 1303 transitions. [2025-04-13 18:32:05,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:32:05,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:05,646 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] [2025-04-13 18:32:05,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:32:05,646 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 1 more)] === [2025-04-13 18:32:05,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1930421784, now seen corresponding path program 2 times [2025-04-13 18:32:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:05,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098917833] [2025-04-13 18:32:05,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:05,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:32:05,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:32:05,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:05,852 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:32:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:05,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098917833] [2025-04-13 18:32:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098917833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:32:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11043781] [2025-04-13 18:32:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:05,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:32:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:05,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:32:05,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:32:05,853 INFO L87 Difference]: Start difference. First operand 392 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:05,958 INFO L93 Difference]: Finished difference Result 812 states and 2687 transitions. [2025-04-13 18:32:05,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:32:05,959 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-04-13 18:32:05,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:05,963 INFO L225 Difference]: With dead ends: 812 [2025-04-13 18:32:05,964 INFO L226 Difference]: Without dead ends: 393 [2025-04-13 18:32:05,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:32:05,965 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:05,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-13 18:32:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-04-13 18:32:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.326530612244898) internal successors, (1304), 392 states have internal predecessors, (1304), 0 states have call successors, (0), 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:32:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1304 transitions. [2025-04-13 18:32:05,985 INFO L79 Accepts]: Start accepts. Automaton has 393 states and 1304 transitions. Word has length 23 [2025-04-13 18:32:05,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:05,985 INFO L485 AbstractCegarLoop]: Abstraction has 393 states and 1304 transitions. [2025-04-13 18:32:05,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:05,985 INFO L278 IsEmpty]: Start isEmpty. Operand 393 states and 1304 transitions. [2025-04-13 18:32:05,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:32:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:05,986 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] [2025-04-13 18:32:05,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:32:05,986 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 1 more)] === [2025-04-13 18:32:05,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1826840262, now seen corresponding path program 1 times [2025-04-13 18:32:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:05,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334717192] [2025-04-13 18:32:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:32:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:32:06,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:06,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334717192] [2025-04-13 18:32:06,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334717192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:06,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:32:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629076870] [2025-04-13 18:32:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:06,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:32:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:06,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:32:06,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:32:06,136 INFO L87 Difference]: Start difference. First operand 393 states and 1304 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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:32:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:06,221 INFO L93 Difference]: Finished difference Result 783 states and 2604 transitions. [2025-04-13 18:32:06,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:32:06,222 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-04-13 18:32:06,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:06,225 INFO L225 Difference]: With dead ends: 783 [2025-04-13 18:32:06,225 INFO L226 Difference]: Without dead ends: 394 [2025-04-13 18:32:06,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:32:06,228 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:06,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-04-13 18:32:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-04-13 18:32:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.3206106870229006) internal successors, (1305), 393 states have internal predecessors, (1305), 0 states have call successors, (0), 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:32:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1305 transitions. [2025-04-13 18:32:06,246 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 1305 transitions. Word has length 24 [2025-04-13 18:32:06,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:06,247 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 1305 transitions. [2025-04-13 18:32:06,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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:32:06,247 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 1305 transitions. [2025-04-13 18:32:06,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:06,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:06,248 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] [2025-04-13 18:32:06,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:32:06,248 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 1 more)] === [2025-04-13 18:32:06,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash -263896091, now seen corresponding path program 1 times [2025-04-13 18:32:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:06,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149555320] [2025-04-13 18:32:06,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:06,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:32:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:07,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:07,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149555320] [2025-04-13 18:32:07,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149555320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:07,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:07,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858059148] [2025-04-13 18:32:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:07,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:07,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:07,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:07,007 INFO L87 Difference]: Start difference. First operand 394 states and 1305 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:07,368 INFO L93 Difference]: Finished difference Result 604 states and 1994 transitions. [2025-04-13 18:32:07,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:07,369 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:07,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:07,372 INFO L225 Difference]: With dead ends: 604 [2025-04-13 18:32:07,373 INFO L226 Difference]: Without dead ends: 598 [2025-04-13 18:32:07,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:07,373 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:07,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-04-13 18:32:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 494. [2025-04-13 18:32:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.2778904665314403) internal successors, (1616), 493 states have internal predecessors, (1616), 0 states have call successors, (0), 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:32:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1616 transitions. [2025-04-13 18:32:07,398 INFO L79 Accepts]: Start accepts. Automaton has 494 states and 1616 transitions. Word has length 25 [2025-04-13 18:32:07,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:07,399 INFO L485 AbstractCegarLoop]: Abstraction has 494 states and 1616 transitions. [2025-04-13 18:32:07,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:07,399 INFO L278 IsEmpty]: Start isEmpty. Operand 494 states and 1616 transitions. [2025-04-13 18:32:07,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:07,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:07,400 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] [2025-04-13 18:32:07,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:32:07,400 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 1 more)] === [2025-04-13 18:32:07,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1238026661, now seen corresponding path program 2 times [2025-04-13 18:32:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:07,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550029866] [2025-04-13 18:32:07,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:07,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:07,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:07,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:07,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550029866] [2025-04-13 18:32:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550029866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589680792] [2025-04-13 18:32:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:07,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:07,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:07,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:07,864 INFO L87 Difference]: Start difference. First operand 494 states and 1616 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:08,169 INFO L93 Difference]: Finished difference Result 630 states and 2072 transitions. [2025-04-13 18:32:08,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:08,169 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:08,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:08,173 INFO L225 Difference]: With dead ends: 630 [2025-04-13 18:32:08,173 INFO L226 Difference]: Without dead ends: 624 [2025-04-13 18:32:08,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:08,174 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:08,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-04-13 18:32:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 502. [2025-04-13 18:32:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.2534930139720557) internal successors, (1630), 501 states have internal predecessors, (1630), 0 states have call successors, (0), 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:32:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1630 transitions. [2025-04-13 18:32:08,204 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1630 transitions. Word has length 25 [2025-04-13 18:32:08,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:08,204 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1630 transitions. [2025-04-13 18:32:08,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:08,204 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1630 transitions. [2025-04-13 18:32:08,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:08,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:08,206 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] [2025-04-13 18:32:08,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:32:08,207 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 1 more)] === [2025-04-13 18:32:08,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 481025293, now seen corresponding path program 3 times [2025-04-13 18:32:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:08,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343533924] [2025-04-13 18:32:08,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:32:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:08,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:08,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:08,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:32:08,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:08,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343533924] [2025-04-13 18:32:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343533924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:08,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:08,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881196389] [2025-04-13 18:32:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:08,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:08,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:08,666 INFO L87 Difference]: Start difference. First operand 502 states and 1630 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:09,026 INFO L93 Difference]: Finished difference Result 685 states and 2217 transitions. [2025-04-13 18:32:09,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:09,027 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:09,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:09,032 INFO L225 Difference]: With dead ends: 685 [2025-04-13 18:32:09,032 INFO L226 Difference]: Without dead ends: 679 [2025-04-13 18:32:09,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:09,033 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:09,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-04-13 18:32:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 508. [2025-04-13 18:32:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 3.232741617357002) internal successors, (1639), 507 states have internal predecessors, (1639), 0 states have call successors, (0), 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:32:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1639 transitions. [2025-04-13 18:32:09,069 INFO L79 Accepts]: Start accepts. Automaton has 508 states and 1639 transitions. Word has length 25 [2025-04-13 18:32:09,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:09,069 INFO L485 AbstractCegarLoop]: Abstraction has 508 states and 1639 transitions. [2025-04-13 18:32:09,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:09,070 INFO L278 IsEmpty]: Start isEmpty. Operand 508 states and 1639 transitions. [2025-04-13 18:32:09,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:09,071 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] [2025-04-13 18:32:09,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:32:09,071 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 1 more)] === [2025-04-13 18:32:09,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 713023785, now seen corresponding path program 4 times [2025-04-13 18:32:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:09,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598475932] [2025-04-13 18:32:09,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:09,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:09,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:09,103 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:09,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:09,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598475932] [2025-04-13 18:32:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598475932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986628188] [2025-04-13 18:32:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:09,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:09,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:09,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:09,432 INFO L87 Difference]: Start difference. First operand 508 states and 1639 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:09,649 INFO L93 Difference]: Finished difference Result 610 states and 1996 transitions. [2025-04-13 18:32:09,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:09,652 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:09,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:09,655 INFO L225 Difference]: With dead ends: 610 [2025-04-13 18:32:09,655 INFO L226 Difference]: Without dead ends: 604 [2025-04-13 18:32:09,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:09,656 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:09,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-04-13 18:32:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 512. [2025-04-13 18:32:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.2348336594911937) internal successors, (1653), 511 states have internal predecessors, (1653), 0 states have call successors, (0), 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:32:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1653 transitions. [2025-04-13 18:32:09,673 INFO L79 Accepts]: Start accepts. Automaton has 512 states and 1653 transitions. Word has length 25 [2025-04-13 18:32:09,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:09,673 INFO L485 AbstractCegarLoop]: Abstraction has 512 states and 1653 transitions. [2025-04-13 18:32:09,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:09,673 INFO L278 IsEmpty]: Start isEmpty. Operand 512 states and 1653 transitions. [2025-04-13 18:32:09,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:09,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:09,675 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] [2025-04-13 18:32:09,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:32:09,675 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 1 more)] === [2025-04-13 18:32:09,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 868532805, now seen corresponding path program 5 times [2025-04-13 18:32:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:09,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541781335] [2025-04-13 18:32:09,675 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:09,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:09,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:09,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:09,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541781335] [2025-04-13 18:32:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541781335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551767076] [2025-04-13 18:32:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:09,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:09,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:09,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:09,974 INFO L87 Difference]: Start difference. First operand 512 states and 1653 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:10,186 INFO L93 Difference]: Finished difference Result 623 states and 2028 transitions. [2025-04-13 18:32:10,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:10,186 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:10,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:10,190 INFO L225 Difference]: With dead ends: 623 [2025-04-13 18:32:10,190 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 18:32:10,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:10,192 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:10,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 18:32:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 512. [2025-04-13 18:32:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.2270058708414875) internal successors, (1649), 511 states have internal predecessors, (1649), 0 states have call successors, (0), 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:32:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1649 transitions. [2025-04-13 18:32:10,209 INFO L79 Accepts]: Start accepts. Automaton has 512 states and 1649 transitions. Word has length 25 [2025-04-13 18:32:10,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:10,210 INFO L485 AbstractCegarLoop]: Abstraction has 512 states and 1649 transitions. [2025-04-13 18:32:10,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:10,210 INFO L278 IsEmpty]: Start isEmpty. Operand 512 states and 1649 transitions. [2025-04-13 18:32:10,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:10,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:10,212 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] [2025-04-13 18:32:10,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:32:10,212 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 1 more)] === [2025-04-13 18:32:10,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 869127451, now seen corresponding path program 6 times [2025-04-13 18:32:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:10,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972064031] [2025-04-13 18:32:10,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:10,222 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:10,240 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:10,240 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:32:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:10,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972064031] [2025-04-13 18:32:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972064031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363714489] [2025-04-13 18:32:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:10,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:10,523 INFO L87 Difference]: Start difference. First operand 512 states and 1649 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:10,755 INFO L93 Difference]: Finished difference Result 655 states and 2152 transitions. [2025-04-13 18:32:10,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:10,755 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:10,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:10,758 INFO L225 Difference]: With dead ends: 655 [2025-04-13 18:32:10,759 INFO L226 Difference]: Without dead ends: 645 [2025-04-13 18:32:10,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:10,759 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:10,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-04-13 18:32:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 520. [2025-04-13 18:32:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.2157996146435455) internal successors, (1669), 519 states have internal predecessors, (1669), 0 states have call successors, (0), 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:32:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1669 transitions. [2025-04-13 18:32:10,776 INFO L79 Accepts]: Start accepts. Automaton has 520 states and 1669 transitions. Word has length 25 [2025-04-13 18:32:10,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:10,777 INFO L485 AbstractCegarLoop]: Abstraction has 520 states and 1669 transitions. [2025-04-13 18:32:10,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:10,777 INFO L278 IsEmpty]: Start isEmpty. Operand 520 states and 1669 transitions. [2025-04-13 18:32:10,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:10,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:10,779 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] [2025-04-13 18:32:10,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:32:10,779 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 1 more)] === [2025-04-13 18:32:10,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 564365521, now seen corresponding path program 7 times [2025-04-13 18:32:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:10,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335821644] [2025-04-13 18:32:10,780 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:10,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:32:10,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:10,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:10,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:11,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335821644] [2025-04-13 18:32:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335821644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:11,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075341076] [2025-04-13 18:32:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:11,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:11,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:11,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:11,090 INFO L87 Difference]: Start difference. First operand 520 states and 1669 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:11,370 INFO L93 Difference]: Finished difference Result 665 states and 2189 transitions. [2025-04-13 18:32:11,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:11,370 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:11,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:11,374 INFO L225 Difference]: With dead ends: 665 [2025-04-13 18:32:11,374 INFO L226 Difference]: Without dead ends: 659 [2025-04-13 18:32:11,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:11,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:11,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-04-13 18:32:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 520. [2025-04-13 18:32:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.2157996146435455) internal successors, (1669), 519 states have internal predecessors, (1669), 0 states have call successors, (0), 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:32:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1669 transitions. [2025-04-13 18:32:11,401 INFO L79 Accepts]: Start accepts. Automaton has 520 states and 1669 transitions. Word has length 25 [2025-04-13 18:32:11,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:11,401 INFO L485 AbstractCegarLoop]: Abstraction has 520 states and 1669 transitions. [2025-04-13 18:32:11,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:11,401 INFO L278 IsEmpty]: Start isEmpty. Operand 520 states and 1669 transitions. [2025-04-13 18:32:11,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:11,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:11,403 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] [2025-04-13 18:32:11,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:32:11,403 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 1 more)] === [2025-04-13 18:32:11,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash -396074801, now seen corresponding path program 8 times [2025-04-13 18:32:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:11,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185124725] [2025-04-13 18:32:11,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:11,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:11,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:11,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:11,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185124725] [2025-04-13 18:32:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185124725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865793921] [2025-04-13 18:32:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:11,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:11,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:11,676 INFO L87 Difference]: Start difference. First operand 520 states and 1669 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:11,906 INFO L93 Difference]: Finished difference Result 727 states and 2404 transitions. [2025-04-13 18:32:11,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:11,907 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:11,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:11,911 INFO L225 Difference]: With dead ends: 727 [2025-04-13 18:32:11,911 INFO L226 Difference]: Without dead ends: 717 [2025-04-13 18:32:11,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:11,912 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:11,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-04-13 18:32:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 536. [2025-04-13 18:32:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.1906542056074767) internal successors, (1707), 535 states have internal predecessors, (1707), 0 states have call successors, (0), 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:32:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1707 transitions. [2025-04-13 18:32:11,940 INFO L79 Accepts]: Start accepts. Automaton has 536 states and 1707 transitions. Word has length 25 [2025-04-13 18:32:11,940 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:11,940 INFO L485 AbstractCegarLoop]: Abstraction has 536 states and 1707 transitions. [2025-04-13 18:32:11,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:11,940 INFO L278 IsEmpty]: Start isEmpty. Operand 536 states and 1707 transitions. [2025-04-13 18:32:11,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:11,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:11,941 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] [2025-04-13 18:32:11,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:32:11,942 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 1 more)] === [2025-04-13 18:32:11,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash -700836731, now seen corresponding path program 9 times [2025-04-13 18:32:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:11,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410037397] [2025-04-13 18:32:11,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:32:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:11,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:11,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:11,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:32:11,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:12,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410037397] [2025-04-13 18:32:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410037397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144243403] [2025-04-13 18:32:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:12,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:12,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:12,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:12,229 INFO L87 Difference]: Start difference. First operand 536 states and 1707 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:12,548 INFO L93 Difference]: Finished difference Result 745 states and 2455 transitions. [2025-04-13 18:32:12,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:12,549 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:12,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:12,554 INFO L225 Difference]: With dead ends: 745 [2025-04-13 18:32:12,554 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 18:32:12,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:12,555 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:12,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 18:32:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 528. [2025-04-13 18:32:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 3.2011385199240987) internal successors, (1687), 527 states have internal predecessors, (1687), 0 states have call successors, (0), 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:32:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1687 transitions. [2025-04-13 18:32:12,584 INFO L79 Accepts]: Start accepts. Automaton has 528 states and 1687 transitions. Word has length 25 [2025-04-13 18:32:12,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:12,584 INFO L485 AbstractCegarLoop]: Abstraction has 528 states and 1687 transitions. [2025-04-13 18:32:12,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:12,584 INFO L278 IsEmpty]: Start isEmpty. Operand 528 states and 1687 transitions. [2025-04-13 18:32:12,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:12,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:12,585 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] [2025-04-13 18:32:12,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:32:12,587 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 1 more)] === [2025-04-13 18:32:12,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash -674077661, now seen corresponding path program 10 times [2025-04-13 18:32:12,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:12,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105339824] [2025-04-13 18:32:12,587 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:12,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:12,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:12,605 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:12,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:12,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105339824] [2025-04-13 18:32:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105339824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889469903] [2025-04-13 18:32:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:12,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:12,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:12,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:12,894 INFO L87 Difference]: Start difference. First operand 528 states and 1687 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:13,217 INFO L93 Difference]: Finished difference Result 760 states and 2462 transitions. [2025-04-13 18:32:13,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:32:13,217 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:13,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:13,221 INFO L225 Difference]: With dead ends: 760 [2025-04-13 18:32:13,221 INFO L226 Difference]: Without dead ends: 754 [2025-04-13 18:32:13,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:13,222 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:13,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-04-13 18:32:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 528. [2025-04-13 18:32:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 3.2011385199240987) internal successors, (1687), 527 states have internal predecessors, (1687), 0 states have call successors, (0), 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:32:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1687 transitions. [2025-04-13 18:32:13,240 INFO L79 Accepts]: Start accepts. Automaton has 528 states and 1687 transitions. Word has length 25 [2025-04-13 18:32:13,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:13,241 INFO L485 AbstractCegarLoop]: Abstraction has 528 states and 1687 transitions. [2025-04-13 18:32:13,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:13,241 INFO L278 IsEmpty]: Start isEmpty. Operand 528 states and 1687 transitions. [2025-04-13 18:32:13,242 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:13,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:13,242 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] [2025-04-13 18:32:13,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:32:13,242 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 1 more)] === [2025-04-13 18:32:13,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash 57381001, now seen corresponding path program 11 times [2025-04-13 18:32:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:13,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808247929] [2025-04-13 18:32:13,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:13,249 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:13,260 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:13,260 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:13,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:13,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808247929] [2025-04-13 18:32:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808247929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:13,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152685255] [2025-04-13 18:32:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:13,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:13,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:13,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:13,529 INFO L87 Difference]: Start difference. First operand 528 states and 1687 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:13,777 INFO L93 Difference]: Finished difference Result 641 states and 2070 transitions. [2025-04-13 18:32:13,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:13,777 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:13,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:13,780 INFO L225 Difference]: With dead ends: 641 [2025-04-13 18:32:13,782 INFO L226 Difference]: Without dead ends: 635 [2025-04-13 18:32:13,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:13,783 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:13,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-04-13 18:32:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 567. [2025-04-13 18:32:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.217314487632509) internal successors, (1821), 566 states have internal predecessors, (1821), 0 states have call successors, (0), 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:32:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1821 transitions. [2025-04-13 18:32:13,806 INFO L79 Accepts]: Start accepts. Automaton has 567 states and 1821 transitions. Word has length 25 [2025-04-13 18:32:13,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:13,806 INFO L485 AbstractCegarLoop]: Abstraction has 567 states and 1821 transitions. [2025-04-13 18:32:13,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:13,806 INFO L278 IsEmpty]: Start isEmpty. Operand 567 states and 1821 transitions. [2025-04-13 18:32:13,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:13,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:13,808 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] [2025-04-13 18:32:13,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:32:13,808 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 1 more)] === [2025-04-13 18:32:13,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -916749569, now seen corresponding path program 12 times [2025-04-13 18:32:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:13,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122207436] [2025-04-13 18:32:13,808 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:13,817 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:13,828 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:13,828 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:32:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:14,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:14,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122207436] [2025-04-13 18:32:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122207436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932767011] [2025-04-13 18:32:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:14,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:14,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:14,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:14,076 INFO L87 Difference]: Start difference. First operand 567 states and 1821 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:14,359 INFO L93 Difference]: Finished difference Result 664 states and 2143 transitions. [2025-04-13 18:32:14,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:14,359 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:14,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:14,362 INFO L225 Difference]: With dead ends: 664 [2025-04-13 18:32:14,362 INFO L226 Difference]: Without dead ends: 658 [2025-04-13 18:32:14,362 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:14,363 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:14,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:32:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-04-13 18:32:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 552. [2025-04-13 18:32:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 3.232304900181488) internal successors, (1781), 551 states have internal predecessors, (1781), 0 states have call successors, (0), 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:32:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1781 transitions. [2025-04-13 18:32:14,390 INFO L79 Accepts]: Start accepts. Automaton has 552 states and 1781 transitions. Word has length 25 [2025-04-13 18:32:14,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:14,390 INFO L485 AbstractCegarLoop]: Abstraction has 552 states and 1781 transitions. [2025-04-13 18:32:14,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:14,390 INFO L278 IsEmpty]: Start isEmpty. Operand 552 states and 1781 transitions. [2025-04-13 18:32:14,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:14,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:14,392 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] [2025-04-13 18:32:14,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:32:14,392 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 1 more)] === [2025-04-13 18:32:14,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 190730251, now seen corresponding path program 13 times [2025-04-13 18:32:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:14,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081630382] [2025-04-13 18:32:14,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:14,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:32:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:14,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:14,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081630382] [2025-04-13 18:32:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081630382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890192429] [2025-04-13 18:32:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:14,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:14,697 INFO L87 Difference]: Start difference. First operand 552 states and 1781 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:14,919 INFO L93 Difference]: Finished difference Result 630 states and 2044 transitions. [2025-04-13 18:32:14,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:14,920 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:14,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:14,923 INFO L225 Difference]: With dead ends: 630 [2025-04-13 18:32:14,923 INFO L226 Difference]: Without dead ends: 624 [2025-04-13 18:32:14,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:14,924 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:14,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-04-13 18:32:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 556. [2025-04-13 18:32:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.234234234234234) internal successors, (1795), 555 states have internal predecessors, (1795), 0 states have call successors, (0), 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:32:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1795 transitions. [2025-04-13 18:32:14,942 INFO L79 Accepts]: Start accepts. Automaton has 556 states and 1795 transitions. Word has length 25 [2025-04-13 18:32:14,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:14,942 INFO L485 AbstractCegarLoop]: Abstraction has 556 states and 1795 transitions. [2025-04-13 18:32:14,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:14,942 INFO L278 IsEmpty]: Start isEmpty. Operand 556 states and 1795 transitions. [2025-04-13 18:32:14,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:14,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:14,943 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] [2025-04-13 18:32:14,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:32:14,943 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 1 more)] === [2025-04-13 18:32:14,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 346239271, now seen corresponding path program 14 times [2025-04-13 18:32:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:14,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413208103] [2025-04-13 18:32:14,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:14,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:14,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:14,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:14,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:15,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413208103] [2025-04-13 18:32:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413208103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115656864] [2025-04-13 18:32:15,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:15,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:15,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:15,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:15,214 INFO L87 Difference]: Start difference. First operand 556 states and 1795 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:15,419 INFO L93 Difference]: Finished difference Result 643 states and 2076 transitions. [2025-04-13 18:32:15,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:15,419 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:15,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:15,422 INFO L225 Difference]: With dead ends: 643 [2025-04-13 18:32:15,422 INFO L226 Difference]: Without dead ends: 633 [2025-04-13 18:32:15,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:15,423 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:15,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-04-13 18:32:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 552. [2025-04-13 18:32:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 3.232304900181488) internal successors, (1781), 551 states have internal predecessors, (1781), 0 states have call successors, (0), 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:32:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1781 transitions. [2025-04-13 18:32:15,441 INFO L79 Accepts]: Start accepts. Automaton has 552 states and 1781 transitions. Word has length 25 [2025-04-13 18:32:15,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:15,441 INFO L485 AbstractCegarLoop]: Abstraction has 552 states and 1781 transitions. [2025-04-13 18:32:15,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:15,442 INFO L278 IsEmpty]: Start isEmpty. Operand 552 states and 1781 transitions. [2025-04-13 18:32:15,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:15,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:15,443 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] [2025-04-13 18:32:15,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:32:15,443 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 1 more)] === [2025-04-13 18:32:15,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 346833917, now seen corresponding path program 15 times [2025-04-13 18:32:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:15,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308412553] [2025-04-13 18:32:15,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:32:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:15,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:15,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:15,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:32:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:15,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308412553] [2025-04-13 18:32:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308412553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843423060] [2025-04-13 18:32:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:15,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:15,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:15,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:15,676 INFO L87 Difference]: Start difference. First operand 552 states and 1781 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:15,920 INFO L93 Difference]: Finished difference Result 671 states and 2190 transitions. [2025-04-13 18:32:15,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:15,920 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:15,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:15,923 INFO L225 Difference]: With dead ends: 671 [2025-04-13 18:32:15,923 INFO L226 Difference]: Without dead ends: 661 [2025-04-13 18:32:15,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:15,923 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:15,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-04-13 18:32:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 560. [2025-04-13 18:32:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.221824686940966) internal successors, (1801), 559 states have internal predecessors, (1801), 0 states have call successors, (0), 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:32:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1801 transitions. [2025-04-13 18:32:15,942 INFO L79 Accepts]: Start accepts. Automaton has 560 states and 1801 transitions. Word has length 25 [2025-04-13 18:32:15,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:15,942 INFO L485 AbstractCegarLoop]: Abstraction has 560 states and 1801 transitions. [2025-04-13 18:32:15,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:15,943 INFO L278 IsEmpty]: Start isEmpty. Operand 560 states and 1801 transitions. [2025-04-13 18:32:15,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:15,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:15,944 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] [2025-04-13 18:32:15,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:32:15,944 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 1 more)] === [2025-04-13 18:32:15,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 42071987, now seen corresponding path program 16 times [2025-04-13 18:32:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:15,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129456940] [2025-04-13 18:32:15,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:15,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:15,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:15,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:15,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:16,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129456940] [2025-04-13 18:32:16,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129456940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:16,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:32:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668948875] [2025-04-13 18:32:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:16,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:32:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:16,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:32:16,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:32:16,205 INFO L87 Difference]: Start difference. First operand 560 states and 1801 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:16,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:16,451 INFO L93 Difference]: Finished difference Result 681 states and 2227 transitions. [2025-04-13 18:32:16,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:16,452 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:16,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:16,455 INFO L225 Difference]: With dead ends: 681 [2025-04-13 18:32:16,455 INFO L226 Difference]: Without dead ends: 675 [2025-04-13 18:32:16,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:32:16,455 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:16,455 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:32:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-04-13 18:32:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 532. [2025-04-13 18:32:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 3.2222222222222223) internal successors, (1711), 531 states have internal predecessors, (1711), 0 states have call successors, (0), 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:32:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1711 transitions. [2025-04-13 18:32:16,481 INFO L79 Accepts]: Start accepts. Automaton has 532 states and 1711 transitions. Word has length 25 [2025-04-13 18:32:16,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:16,482 INFO L485 AbstractCegarLoop]: Abstraction has 532 states and 1711 transitions. [2025-04-13 18:32:16,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:16,482 INFO L278 IsEmpty]: Start isEmpty. Operand 532 states and 1711 transitions. [2025-04-13 18:32:16,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:16,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:16,483 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] [2025-04-13 18:32:16,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:32:16,483 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 1 more)] === [2025-04-13 18:32:16,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1406512019, now seen corresponding path program 17 times [2025-04-13 18:32:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:16,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249102159] [2025-04-13 18:32:16,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:16,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:16,492 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:16,492 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:16,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:16,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249102159] [2025-04-13 18:32:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249102159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:32:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297050755] [2025-04-13 18:32:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:16,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:32:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:16,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:32:16,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:32:16,512 INFO L87 Difference]: Start difference. First operand 532 states and 1711 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:16,565 INFO L93 Difference]: Finished difference Result 860 states and 2750 transitions. [2025-04-13 18:32:16,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:32:16,566 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:16,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:16,568 INFO L225 Difference]: With dead ends: 860 [2025-04-13 18:32:16,568 INFO L226 Difference]: Without dead ends: 468 [2025-04-13 18:32:16,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:32:16,568 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:16,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:32:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-04-13 18:32:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-04-13 18:32:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 3.017130620985011) internal successors, (1409), 467 states have internal predecessors, (1409), 0 states have call successors, (0), 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:32:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1409 transitions. [2025-04-13 18:32:16,586 INFO L79 Accepts]: Start accepts. Automaton has 468 states and 1409 transitions. Word has length 25 [2025-04-13 18:32:16,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:16,586 INFO L485 AbstractCegarLoop]: Abstraction has 468 states and 1409 transitions. [2025-04-13 18:32:16,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:16,586 INFO L278 IsEmpty]: Start isEmpty. Operand 468 states and 1409 transitions. [2025-04-13 18:32:16,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:32:16,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:16,588 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, 1] [2025-04-13 18:32:16,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:32:16,588 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 1 more)] === [2025-04-13 18:32:16,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1848685095, now seen corresponding path program 1 times [2025-04-13 18:32:16,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:16,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899596573] [2025-04-13 18:32:16,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:16,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:32:16,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:32:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:16,647 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:32:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:16,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899596573] [2025-04-13 18:32:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899596573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:16,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213818742] [2025-04-13 18:32:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:16,649 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:32:16,651 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:32:16,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:32:16,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:32:16,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:16,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:16,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:32:16,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:16,796 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:32:16,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:16,853 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:32:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213818742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:16,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:32:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962984637] [2025-04-13 18:32:16,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:16,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:32:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:32:16,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:32:16,855 INFO L87 Difference]: Start difference. First operand 468 states and 1409 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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:32:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:17,012 INFO L93 Difference]: Finished difference Result 1216 states and 3748 transitions. [2025-04-13 18:32:17,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:32:17,012 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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 27 [2025-04-13 18:32:17,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:17,015 INFO L225 Difference]: With dead ends: 1216 [2025-04-13 18:32:17,015 INFO L226 Difference]: Without dead ends: 694 [2025-04-13 18:32:17,016 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:32:17,017 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:17,017 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-04-13 18:32:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 486. [2025-04-13 18:32:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.9876288659793815) internal successors, (1449), 485 states have internal predecessors, (1449), 0 states have call successors, (0), 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:32:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1449 transitions. [2025-04-13 18:32:17,040 INFO L79 Accepts]: Start accepts. Automaton has 486 states and 1449 transitions. Word has length 27 [2025-04-13 18:32:17,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:17,040 INFO L485 AbstractCegarLoop]: Abstraction has 486 states and 1449 transitions. [2025-04-13 18:32:17,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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:32:17,040 INFO L278 IsEmpty]: Start isEmpty. Operand 486 states and 1449 transitions. [2025-04-13 18:32:17,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:32:17,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:17,041 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] [2025-04-13 18:32:17,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:17,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 18:32:17,242 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 1 more)] === [2025-04-13 18:32:17,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1039062265, now seen corresponding path program 1 times [2025-04-13 18:32:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:17,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301570095] [2025-04-13 18:32:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:32:17,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:32:17,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:17,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:17,277 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:32:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:17,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301570095] [2025-04-13 18:32:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301570095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:32:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955006514] [2025-04-13 18:32:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:17,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:32:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:32:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:32:17,279 INFO L87 Difference]: Start difference. First operand 486 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:32:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:17,373 INFO L93 Difference]: Finished difference Result 982 states and 3115 transitions. [2025-04-13 18:32:17,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:32:17,374 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-04-13 18:32:17,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:17,377 INFO L225 Difference]: With dead ends: 982 [2025-04-13 18:32:17,377 INFO L226 Difference]: Without dead ends: 811 [2025-04-13 18:32:17,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:32:17,378 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:17,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-04-13 18:32:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 695. [2025-04-13 18:32:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 3.211815561959654) internal successors, (2229), 694 states have internal predecessors, (2229), 0 states have call successors, (0), 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:32:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 2229 transitions. [2025-04-13 18:32:17,402 INFO L79 Accepts]: Start accepts. Automaton has 695 states and 2229 transitions. Word has length 27 [2025-04-13 18:32:17,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:17,402 INFO L485 AbstractCegarLoop]: Abstraction has 695 states and 2229 transitions. [2025-04-13 18:32:17,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:32:17,402 INFO L278 IsEmpty]: Start isEmpty. Operand 695 states and 2229 transitions. [2025-04-13 18:32:17,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:17,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:17,403 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:32:17,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:32:17,403 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 1 more)] === [2025-04-13 18:32:17,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2077282727, now seen corresponding path program 2 times [2025-04-13 18:32:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:17,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490180363] [2025-04-13 18:32:17,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:17,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:17,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-13 18:32:17,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:17,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490180363] [2025-04-13 18:32:17,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490180363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:17,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:17,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:32:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723680604] [2025-04-13 18:32:17,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:17,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:32:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:17,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:32:17,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:32:17,468 INFO L87 Difference]: Start difference. First operand 695 states and 2229 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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:32:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:17,616 INFO L93 Difference]: Finished difference Result 799 states and 2534 transitions. [2025-04-13 18:32:17,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:32:17,616 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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:32:17,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:17,620 INFO L225 Difference]: With dead ends: 799 [2025-04-13 18:32:17,620 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 18:32:17,620 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:32:17,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:17,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 18:32:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 658. [2025-04-13 18:32:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 3.2663622526636225) internal successors, (2146), 657 states have internal predecessors, (2146), 0 states have call successors, (0), 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:32:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2146 transitions. [2025-04-13 18:32:17,651 INFO L79 Accepts]: Start accepts. Automaton has 658 states and 2146 transitions. Word has length 28 [2025-04-13 18:32:17,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:17,651 INFO L485 AbstractCegarLoop]: Abstraction has 658 states and 2146 transitions. [2025-04-13 18:32:17,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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:32:17,651 INFO L278 IsEmpty]: Start isEmpty. Operand 658 states and 2146 transitions. [2025-04-13 18:32:17,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:17,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:17,653 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] [2025-04-13 18:32:17,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:32:17,653 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 1 more)] === [2025-04-13 18:32:17,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash 969211747, now seen corresponding path program 1 times [2025-04-13 18:32:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:17,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128438478] [2025-04-13 18:32:17,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:17,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:32:17,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:17,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:17,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:17,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128438478] [2025-04-13 18:32:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128438478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:17,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253052878] [2025-04-13 18:32:17,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:17,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:17,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:17,734 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:32:17,736 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:32:17,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:32:17,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:17,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:17,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:17,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:32:17,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:17,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253052878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:17,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 18:32:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189153819] [2025-04-13 18:32:17,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:17,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:32:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:32:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:32:17,959 INFO L87 Difference]: Start difference. First operand 658 states and 2146 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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:32:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:18,160 INFO L93 Difference]: Finished difference Result 965 states and 3018 transitions. [2025-04-13 18:32:18,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:32:18,160 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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:32:18,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:18,163 INFO L225 Difference]: With dead ends: 965 [2025-04-13 18:32:18,163 INFO L226 Difference]: Without dead ends: 641 [2025-04-13 18:32:18,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:32:18,166 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:18,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-04-13 18:32:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-04-13 18:32:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.2921875) internal successors, (2107), 640 states have internal predecessors, (2107), 0 states have call successors, (0), 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:32:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2107 transitions. [2025-04-13 18:32:18,196 INFO L79 Accepts]: Start accepts. Automaton has 641 states and 2107 transitions. Word has length 28 [2025-04-13 18:32:18,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:18,196 INFO L485 AbstractCegarLoop]: Abstraction has 641 states and 2107 transitions. [2025-04-13 18:32:18,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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:32:18,196 INFO L278 IsEmpty]: Start isEmpty. Operand 641 states and 2107 transitions. [2025-04-13 18:32:18,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:32:18,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:18,198 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] [2025-04-13 18:32:18,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:18,398 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,SelfDestructingSolverStorable24 [2025-04-13 18:32:18,398 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 1 more)] === [2025-04-13 18:32:18,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 275067729, now seen corresponding path program 2 times [2025-04-13 18:32:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:18,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020989430] [2025-04-13 18:32:18,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:18,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:32:18,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:32:18,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:18,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:18,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:18,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020989430] [2025-04-13 18:32:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020989430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:32:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737833914] [2025-04-13 18:32:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:18,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:32:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:18,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:32:18,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:32:18,447 INFO L87 Difference]: Start difference. First operand 641 states and 2107 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:32:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:18,579 INFO L93 Difference]: Finished difference Result 2162 states and 7288 transitions. [2025-04-13 18:32:18,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:32:18,579 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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 29 [2025-04-13 18:32:18,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:18,584 INFO L225 Difference]: With dead ends: 2162 [2025-04-13 18:32:18,584 INFO L226 Difference]: Without dead ends: 1609 [2025-04-13 18:32:18,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:32:18,585 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:18,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-04-13 18:32:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1417. [2025-04-13 18:32:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 3.444915254237288) internal successors, (4878), 1416 states have internal predecessors, (4878), 0 states have call successors, (0), 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:32:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 4878 transitions. [2025-04-13 18:32:18,640 INFO L79 Accepts]: Start accepts. Automaton has 1417 states and 4878 transitions. Word has length 29 [2025-04-13 18:32:18,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:18,641 INFO L485 AbstractCegarLoop]: Abstraction has 1417 states and 4878 transitions. [2025-04-13 18:32:18,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:32:18,641 INFO L278 IsEmpty]: Start isEmpty. Operand 1417 states and 4878 transitions. [2025-04-13 18:32:18,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:32:18,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:18,643 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] [2025-04-13 18:32:18,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:32:18,643 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 1 more)] === [2025-04-13 18:32:18,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -285186417, now seen corresponding path program 1 times [2025-04-13 18:32:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:18,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145789266] [2025-04-13 18:32:18,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:18,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:32:18,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:32:18,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:18,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:18,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145789266] [2025-04-13 18:32:18,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145789266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:18,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930743137] [2025-04-13 18:32:18,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:18,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:18,720 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:32:18,722 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:32:18,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:32:18,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:32:18,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:18,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:18,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:32:18,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:18,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930743137] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:18,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:32:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192037214] [2025-04-13 18:32:18,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:18,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:32:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:18,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:32:18,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:32:18,929 INFO L87 Difference]: Start difference. First operand 1417 states and 4878 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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:32:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:19,122 INFO L93 Difference]: Finished difference Result 3101 states and 10588 transitions. [2025-04-13 18:32:19,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:32:19,123 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 31 [2025-04-13 18:32:19,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:19,128 INFO L225 Difference]: With dead ends: 3101 [2025-04-13 18:32:19,128 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 18:32:19,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:32:19,132 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:19,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 18:32:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2025-04-13 18:32:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 3.4431898376852503) internal successors, (4879), 1417 states have internal predecessors, (4879), 0 states have call successors, (0), 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:32:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4879 transitions. [2025-04-13 18:32:19,193 INFO L79 Accepts]: Start accepts. Automaton has 1418 states and 4879 transitions. Word has length 31 [2025-04-13 18:32:19,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:19,193 INFO L485 AbstractCegarLoop]: Abstraction has 1418 states and 4879 transitions. [2025-04-13 18:32:19,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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:32:19,193 INFO L278 IsEmpty]: Start isEmpty. Operand 1418 states and 4879 transitions. [2025-04-13 18:32:19,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:32:19,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:19,196 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] [2025-04-13 18:32:19,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:19,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:19,396 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 1 more)] === [2025-04-13 18:32:19,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -981162594, now seen corresponding path program 2 times [2025-04-13 18:32:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:19,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401620185] [2025-04-13 18:32:19,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:19,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:32:19,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 32 statements. [2025-04-13 18:32:19,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:32:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:32:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:19,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401620185] [2025-04-13 18:32:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401620185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:32:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533472973] [2025-04-13 18:32:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:19,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:32:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:19,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:32:19,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:32:19,506 INFO L87 Difference]: Start difference. First operand 1418 states and 4879 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 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:32:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:19,745 INFO L93 Difference]: Finished difference Result 2267 states and 7947 transitions. [2025-04-13 18:32:19,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:32:19,746 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 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 32 [2025-04-13 18:32:19,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:19,752 INFO L225 Difference]: With dead ends: 2267 [2025-04-13 18:32:19,752 INFO L226 Difference]: Without dead ends: 2131 [2025-04-13 18:32:19,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:32:19,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:19,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:32:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2025-04-13 18:32:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1830. [2025-04-13 18:32:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1829 states have (on average 3.4598141060688903) internal successors, (6328), 1829 states have internal predecessors, (6328), 0 states have call successors, (0), 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:32:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 6328 transitions. [2025-04-13 18:32:19,831 INFO L79 Accepts]: Start accepts. Automaton has 1830 states and 6328 transitions. Word has length 32 [2025-04-13 18:32:19,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:19,831 INFO L485 AbstractCegarLoop]: Abstraction has 1830 states and 6328 transitions. [2025-04-13 18:32:19,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 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:32:19,831 INFO L278 IsEmpty]: Start isEmpty. Operand 1830 states and 6328 transitions. [2025-04-13 18:32:19,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:32:19,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:19,833 INFO L218 NwaCegarLoop]: trace histogram [2, 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:32:19,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:32:19,834 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 1 more)] === [2025-04-13 18:32:19,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1341102786, now seen corresponding path program 1 times [2025-04-13 18:32:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:19,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117088877] [2025-04-13 18:32:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:19,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:32:19,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:32:19,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:19,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:21,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:21,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117088877] [2025-04-13 18:32:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117088877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:21,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48856059] [2025-04-13 18:32:21,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:32:21,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:21,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:21,431 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:32:21,433 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:32:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:32:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:32:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:21,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 18:32:21,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:32:22,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:26,891 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)) (= c_~N~0 (+ c_~t~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) is different from false [2025-04-13 18:32:30,941 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (= c_~N~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)))))))) is different from false [2025-04-13 18:32:59,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:59,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 293 [2025-04-13 18:33:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:33:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48856059] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:01,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 13] total 51 [2025-04-13 18:33:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810917716] [2025-04-13 18:33:01,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:01,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 18:33:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:01,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 18:33:01,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2409, Unknown=9, NotChecked=198, Total=2756 [2025-04-13 18:33:01,116 INFO L87 Difference]: Start difference. First operand 1830 states and 6328 transitions. Second operand has 53 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 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:33:07,369 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 18:33:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:08,347 INFO L93 Difference]: Finished difference Result 2121 states and 7016 transitions. [2025-04-13 18:33:08,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:33:08,348 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 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:33:08,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:08,354 INFO L225 Difference]: With dead ends: 2121 [2025-04-13 18:33:08,354 INFO L226 Difference]: Without dead ends: 2105 [2025-04-13 18:33:08,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=300, Invalid=5399, Unknown=9, NotChecked=298, Total=6006 [2025-04-13 18:33:08,356 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 544 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:08,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3299 Invalid, 1 Unknown, 544 Unchecked, 5.7s Time] [2025-04-13 18:33:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-04-13 18:33:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1885. [2025-04-13 18:33:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 3.4288747346072186) internal successors, (6460), 1884 states have internal predecessors, (6460), 0 states have call successors, (0), 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:33:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 6460 transitions. [2025-04-13 18:33:08,439 INFO L79 Accepts]: Start accepts. Automaton has 1885 states and 6460 transitions. Word has length 34 [2025-04-13 18:33:08,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:08,439 INFO L485 AbstractCegarLoop]: Abstraction has 1885 states and 6460 transitions. [2025-04-13 18:33:08,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 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:33:08,440 INFO L278 IsEmpty]: Start isEmpty. Operand 1885 states and 6460 transitions. [2025-04-13 18:33:08,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:33:08,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:08,442 INFO L218 NwaCegarLoop]: trace histogram [2, 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:33:08,449 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:33:08,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:33:08,647 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 1 more)] === [2025-04-13 18:33:08,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2057855752, now seen corresponding path program 2 times [2025-04-13 18:33:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:08,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556881556] [2025-04-13 18:33:08,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:33:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:08,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:33:08,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:33:08,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:33:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:10,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556881556] [2025-04-13 18:33:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556881556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:10,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371288819] [2025-04-13 18:33:10,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:33:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:10,088 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:33:10,090 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:33:10,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:33:10,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:33:10,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:10,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 18:33:10,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:10,817 INFO L325 Elim1Store]: treesize reduction 20, result has 61.5 percent of original size [2025-04-13 18:33:10,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 41 [2025-04-13 18:33:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:11,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:12,600 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-13 18:33:12,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-13 18:33:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371288819] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:13,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:13,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 60 [2025-04-13 18:33:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517830181] [2025-04-13 18:33:13,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:13,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-13 18:33:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:13,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-13 18:33:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3537, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:33:13,695 INFO L87 Difference]: Start difference. First operand 1885 states and 6460 transitions. Second operand has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 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:33:22,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:33:44,980 WARN L286 SmtUtils]: Spent 21.03s on a formula simplification. DAG size of input: 137 DAG size of output: 92 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:33:48,984 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:33:53,011 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:34:27,297 WARN L286 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 132 DAG size of output: 89 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:34:31,911 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:34:36,263 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:34:40,275 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:34:44,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:34:48,995 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:35:00,342 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:05,253 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:09,658 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:35:13,666 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:35:24,522 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:28,527 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:31,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:32,402 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:36,408 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:40,414 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:44,649 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:47,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:51,974 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:35:58,194 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:02,534 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:17,960 INFO L93 Difference]: Finished difference Result 3520 states and 11671 transitions. [2025-04-13 18:36:17,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 18:36:17,961 INFO L79 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 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:36:17,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:17,990 INFO L225 Difference]: With dead ends: 3520 [2025-04-13 18:36:17,990 INFO L226 Difference]: Without dead ends: 3379 [2025-04-13 18:36:18,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=1264, Invalid=13983, Unknown=5, NotChecked=0, Total=15252 [2025-04-13 18:36:18,013 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 506 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7005 mSolverCounterSat, 398 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 7005 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:18,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 0 Invalid, 7420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 7005 Invalid, 17 Unknown, 0 Unchecked, 96.9s Time] [2025-04-13 18:36:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-04-13 18:36:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2126. [2025-04-13 18:36:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 3.3557647058823528) internal successors, (7131), 2125 states have internal predecessors, (7131), 0 states have call successors, (0), 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:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 7131 transitions. [2025-04-13 18:36:18,320 INFO L79 Accepts]: Start accepts. Automaton has 2126 states and 7131 transitions. Word has length 34 [2025-04-13 18:36:18,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:18,320 INFO L485 AbstractCegarLoop]: Abstraction has 2126 states and 7131 transitions. [2025-04-13 18:36:18,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 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:18,320 INFO L278 IsEmpty]: Start isEmpty. Operand 2126 states and 7131 transitions. [2025-04-13 18:36:18,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:36:18,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:18,328 INFO L218 NwaCegarLoop]: trace histogram [2, 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:18,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 18:36:18,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:18,529 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 1 more)] === [2025-04-13 18:36:18,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1876332588, now seen corresponding path program 3 times [2025-04-13 18:36:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:18,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687616202] [2025-04-13 18:36:18,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:18,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:36:18,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:36:18,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:21,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687616202] [2025-04-13 18:36:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687616202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:21,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748040123] [2025-04-13 18:36:21,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:21,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:21,302 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:36:21,304 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:36:21,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:36:21,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:36:21,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:21,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:21,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-13 18:36:21,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:23,082 INFO L325 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2025-04-13 18:36:23,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 16 [2025-04-13 18:36:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:23,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:25,604 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-13 18:36:25,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-13 18:36:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:27,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748040123] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:27,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:27,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 21] total 66 [2025-04-13 18:36:27,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235380982] [2025-04-13 18:36:27,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:27,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 18:36:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:27,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 18:36:27,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=4233, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 18:36:27,189 INFO L87 Difference]: Start difference. First operand 2126 states and 7131 transitions. Second operand has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 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:39,741 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:43,757 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:47,760 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:51,766 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:36:55,770 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:10,596 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:14,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:18,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:24,537 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:28,545 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:32,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:36,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:40,765 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:44,769 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:49,318 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:53,322 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:37:57,324 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:01,345 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:38:08,901 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:13,045 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:18,382 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:24,122 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:43,503 WARN L286 SmtUtils]: Spent 18.98s on a formula simplification. DAG size of input: 143 DAG size of output: 99 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:38:47,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:49,712 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:38:59,797 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:03,810 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:08,244 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:12,254 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:39:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:19,101 INFO L93 Difference]: Finished difference Result 4806 states and 15987 transitions. [2025-04-13 18:39:19,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-04-13 18:39:19,101 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 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:39:19,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:19,126 INFO L225 Difference]: With dead ends: 4806 [2025-04-13 18:39:19,126 INFO L226 Difference]: Without dead ends: 4730 [2025-04-13 18:39:19,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6847 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=2708, Invalid=24024, Unknown=0, NotChecked=0, Total=26732 [2025-04-13 18:39:19,133 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 600 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9124 mSolverCounterSat, 745 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 9124 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:19,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 0 Invalid, 9896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 9124 Invalid, 27 Unknown, 0 Unchecked, 127.4s Time] [2025-04-13 18:39:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2025-04-13 18:39:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2569. [2025-04-13 18:39:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2568 states have (on average 3.30101246105919) internal successors, (8477), 2568 states have internal predecessors, (8477), 0 states have call successors, (0), 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:39:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 8477 transitions. [2025-04-13 18:39:19,655 INFO L79 Accepts]: Start accepts. Automaton has 2569 states and 8477 transitions. Word has length 34 [2025-04-13 18:39:19,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:19,655 INFO L485 AbstractCegarLoop]: Abstraction has 2569 states and 8477 transitions. [2025-04-13 18:39:19,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 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:39:19,655 INFO L278 IsEmpty]: Start isEmpty. Operand 2569 states and 8477 transitions. [2025-04-13 18:39:19,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:39:19,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:19,661 INFO L218 NwaCegarLoop]: trace histogram [2, 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:39:19,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:39:19,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:19,862 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 1 more)] === [2025-04-13 18:39:19,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1522625950, now seen corresponding path program 4 times [2025-04-13 18:39:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:19,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166756659] [2025-04-13 18:39:19,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:19,877 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:39:19,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:39:19,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:19,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:21,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166756659] [2025-04-13 18:39:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166756659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:21,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120430106] [2025-04-13 18:39:21,063 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:21,065 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:39:21,066 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:39:21,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:39:21,167 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:39:21,167 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-13 18:39:21,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:21,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-04-13 18:39:21,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:39:21,897 INFO L325 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-04-13 18:39:21,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 7 [2025-04-13 18:39:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:22,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:23,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:23,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 617 [2025-04-13 18:39:23,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:23,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2025-04-13 18:39:23,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:23,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 555 treesize of output 557 [2025-04-13 18:39:26,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:26,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 593 [2025-04-13 18:39:26,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2025-04-13 18:39:26,107 INFO L325 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-04-13 18:39:26,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 558 treesize of output 488 [2025-04-13 18:39:26,228 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:26,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 593 [2025-04-13 18:39:26,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 162 [2025-04-13 18:39:26,300 INFO L325 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-04-13 18:39:26,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 332 [2025-04-13 18:39:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:26,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120430106] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:26,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:26,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 56 [2025-04-13 18:39:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377937589] [2025-04-13 18:39:26,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:26,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 18:39:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:26,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 18:39:26,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3051, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:39:26,667 INFO L87 Difference]: Start difference. First operand 2569 states and 8477 transitions. Second operand has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 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:39:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:36,126 INFO L93 Difference]: Finished difference Result 4124 states and 13710 transitions. [2025-04-13 18:39:36,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:39:36,126 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 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:39:36,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:36,149 INFO L225 Difference]: With dead ends: 4124 [2025-04-13 18:39:36,149 INFO L226 Difference]: Without dead ends: 3755 [2025-04-13 18:39:36,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2946 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1108, Invalid=10448, Unknown=0, NotChecked=0, Total=11556 [2025-04-13 18:39:36,151 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5577 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 5577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:36,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 0 Invalid, 5952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 5577 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 18:39:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2025-04-13 18:39:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 2551. [2025-04-13 18:39:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2550 states have (on average 3.2901960784313724) internal successors, (8390), 2550 states have internal predecessors, (8390), 0 states have call successors, (0), 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:39:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 8390 transitions. [2025-04-13 18:39:36,580 INFO L79 Accepts]: Start accepts. Automaton has 2551 states and 8390 transitions. Word has length 34 [2025-04-13 18:39:36,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:36,580 INFO L485 AbstractCegarLoop]: Abstraction has 2551 states and 8390 transitions. [2025-04-13 18:39:36,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.736842105263158) internal successors, (99), 57 states have internal predecessors, (99), 0 states have call successors, (0), 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:39:36,580 INFO L278 IsEmpty]: Start isEmpty. Operand 2551 states and 8390 transitions. [2025-04-13 18:39:36,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:39:36,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:36,583 INFO L218 NwaCegarLoop]: trace histogram [2, 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:39:36,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:39:36,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:36,784 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 1 more)] === [2025-04-13 18:39:36,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 176396538, now seen corresponding path program 5 times [2025-04-13 18:39:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:36,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643219634] [2025-04-13 18:39:36,784 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:36,790 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:39:36,807 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:39:36,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:36,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:39,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643219634] [2025-04-13 18:39:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643219634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:39,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608296218] [2025-04-13 18:39:39,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:39,012 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:39:39,013 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:39:39,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:39:39,129 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:39:39,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:39,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 18:39:39,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:39:40,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:44,610 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)) (= c_~N~0 (+ c_~t~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) is different from false [2025-04-13 18:39:48,651 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (= c_~N~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)))))))) is different from false [2025-04-13 18:40:13,238 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 293 [2025-04-13 18:40:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:40:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608296218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:23,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 13] total 50 [2025-04-13 18:40:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691150915] [2025-04-13 18:40:23,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:23,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 18:40:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:23,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 18:40:23,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2298, Unknown=8, NotChecked=194, Total=2652 [2025-04-13 18:40:23,632 INFO L87 Difference]: Start difference. First operand 2551 states and 8390 transitions. Second operand has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:40:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:28,814 INFO L93 Difference]: Finished difference Result 2846 states and 9181 transitions. [2025-04-13 18:40:28,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 18:40:28,814 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:40:28,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:28,822 INFO L225 Difference]: With dead ends: 2846 [2025-04-13 18:40:28,822 INFO L226 Difference]: Without dead ends: 2785 [2025-04-13 18:40:28,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=343, Invalid=4769, Unknown=8, NotChecked=282, Total=5402 [2025-04-13 18:40:28,824 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 337 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:28,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 0 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4212 Invalid, 0 Unknown, 648 Unchecked, 2.8s Time] [2025-04-13 18:40:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2025-04-13 18:40:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2545. [2025-04-13 18:40:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2544 states have (on average 3.2928459119496853) internal successors, (8377), 2544 states have internal predecessors, (8377), 0 states have call successors, (0), 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:40:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 8377 transitions. [2025-04-13 18:40:29,256 INFO L79 Accepts]: Start accepts. Automaton has 2545 states and 8377 transitions. Word has length 34 [2025-04-13 18:40:29,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:29,256 INFO L485 AbstractCegarLoop]: Abstraction has 2545 states and 8377 transitions. [2025-04-13 18:40:29,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:40:29,256 INFO L278 IsEmpty]: Start isEmpty. Operand 2545 states and 8377 transitions. [2025-04-13 18:40:29,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:40:29,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:29,259 INFO L218 NwaCegarLoop]: trace histogram [2, 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:40:29,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:40:29,459 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,SelfDestructingSolverStorable32 [2025-04-13 18:40:29,460 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 1 more)] === [2025-04-13 18:40:29,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1011811034, now seen corresponding path program 6 times [2025-04-13 18:40:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:29,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396663335] [2025-04-13 18:40:29,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:40:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:29,466 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:40:29,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:40:29,484 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:40:29,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:31,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396663335] [2025-04-13 18:40:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396663335] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:31,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730240133] [2025-04-13 18:40:31,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:40:31,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:31,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:31,130 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:40:31,130 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:40:31,188 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:40:31,212 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:40:31,212 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:40:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:31,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-13 18:40:31,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:32,365 INFO L325 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2025-04-13 18:40:32,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2025-04-13 18:40:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:32,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:34,580 INFO L325 Elim1Store]: treesize reduction 66, result has 82.4 percent of original size [2025-04-13 18:40:34,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 151 treesize of output 371 [2025-04-13 18:44:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730240133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:01,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:01,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2025-04-13 18:44:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159630830] [2025-04-13 18:44:01,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:01,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 18:44:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:01,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 18:44:01,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4105, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:44:01,389 INFO L87 Difference]: Start difference. First operand 2545 states and 8377 transitions. Second operand has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 66 states have internal predecessors, (102), 0 states have call successors, (0), 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:44:16,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:44:42,946 INFO L93 Difference]: Finished difference Result 5649 states and 18459 transitions. [2025-04-13 18:44:42,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-04-13 18:44:42,946 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 66 states have internal predecessors, (102), 0 states have call successors, (0), 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:44:42,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:44:42,959 INFO L225 Difference]: With dead ends: 5649 [2025-04-13 18:44:42,959 INFO L226 Difference]: Without dead ends: 5638 [2025-04-13 18:44:42,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7250 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=3076, Invalid=25316, Unknown=0, NotChecked=0, Total=28392 [2025-04-13 18:44:42,961 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 732 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10421 mSolverCounterSat, 785 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 10421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:42,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 0 Invalid, 11207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 10421 Invalid, 1 Unknown, 0 Unchecked, 16.7s Time] [2025-04-13 18:44:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2025-04-13 18:44:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 2771. [2025-04-13 18:44:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2770 states have (on average 3.2808664259927798) internal successors, (9088), 2770 states have internal predecessors, (9088), 0 states have call successors, (0), 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:44:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 9088 transitions. [2025-04-13 18:44:43,659 INFO L79 Accepts]: Start accepts. Automaton has 2771 states and 9088 transitions. Word has length 34 [2025-04-13 18:44:43,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:44:43,660 INFO L485 AbstractCegarLoop]: Abstraction has 2771 states and 9088 transitions. [2025-04-13 18:44:43,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 66 states have internal predecessors, (102), 0 states have call successors, (0), 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:44:43,660 INFO L278 IsEmpty]: Start isEmpty. Operand 2771 states and 9088 transitions. [2025-04-13 18:44:43,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:44:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:44:43,664 INFO L218 NwaCegarLoop]: trace histogram [2, 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:44:43,671 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:44:43,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:43,865 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 1 more)] === [2025-04-13 18:44:43,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:44:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1916757092, now seen corresponding path program 7 times [2025-04-13 18:44:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:44:43,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269194768] [2025-04-13 18:44:43,865 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:44:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:44:43,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:44:43,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:44:43,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:44:43,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:45,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:44:45,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269194768] [2025-04-13 18:44:45,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269194768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:44:45,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043601310] [2025-04-13 18:44:45,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:44:45,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:45,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:44:45,674 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:44:45,675 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:44:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:44:45,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:44:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:44:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:45,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 18:44:45,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:44:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:44:46,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:51,149 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)) (= c_~N~0 (+ c_~t~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) is different from false [2025-04-13 18:44:55,188 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (= c_~N~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)))))))) is different from false [2025-04-13 18:45:15,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:15,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 293 [2025-04-13 18:45:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:45:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043601310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:19,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:19,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 13] total 50 [2025-04-13 18:45:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536081734] [2025-04-13 18:45:19,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:19,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 18:45:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 18:45:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2317, Unknown=7, NotChecked=194, Total=2652 [2025-04-13 18:45:19,256 INFO L87 Difference]: Start difference. First operand 2771 states and 9088 transitions. Second operand has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:45:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:23,719 INFO L93 Difference]: Finished difference Result 2949 states and 9605 transitions. [2025-04-13 18:45:23,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:45:23,720 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:45:23,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:23,728 INFO L225 Difference]: With dead ends: 2949 [2025-04-13 18:45:23,728 INFO L226 Difference]: Without dead ends: 2935 [2025-04-13 18:45:23,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=248, Invalid=4309, Unknown=7, NotChecked=266, Total=4830 [2025-04-13 18:45:23,729 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:23,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4215 Invalid, 0 Unknown, 430 Unchecked, 2.3s Time] [2025-04-13 18:45:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2025-04-13 18:45:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2804. [2025-04-13 18:45:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2803 states have (on average 3.2757759543346414) internal successors, (9182), 2803 states have internal predecessors, (9182), 0 states have call successors, (0), 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:45:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 9182 transitions. [2025-04-13 18:45:24,550 INFO L79 Accepts]: Start accepts. Automaton has 2804 states and 9182 transitions. Word has length 34 [2025-04-13 18:45:24,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:24,550 INFO L485 AbstractCegarLoop]: Abstraction has 2804 states and 9182 transitions. [2025-04-13 18:45:24,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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:45:24,550 INFO L278 IsEmpty]: Start isEmpty. Operand 2804 states and 9182 transitions. [2025-04-13 18:45:24,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:45:24,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:24,554 INFO L218 NwaCegarLoop]: trace histogram [2, 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:45:24,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:45:24,754 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,SelfDestructingSolverStorable34 [2025-04-13 18:45:24,754 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 1 more)] === [2025-04-13 18:45:24,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1583220212, now seen corresponding path program 8 times [2025-04-13 18:45:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:24,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339177746] [2025-04-13 18:45:24,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:24,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:24,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:24,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:24,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:26,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339177746] [2025-04-13 18:45:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339177746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:26,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794315761] [2025-04-13 18:45:26,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:26,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:26,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:26,235 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:45:26,237 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:45:26,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:26,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:26,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:26,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:26,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-13 18:45:26,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:27,478 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 18:45:27,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 18:45:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:27,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:29,574 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-13 18:45:29,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-13 18:45:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794315761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:31,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2025-04-13 18:45:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656476290] [2025-04-13 18:45:31,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:31,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 18:45:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:31,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 18:45:31,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=4133, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:45:31,283 INFO L87 Difference]: Start difference. First operand 2804 states and 9182 transitions. Second operand has 67 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 66 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 18:46:02,111 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:46:02,141 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:46:03,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:46:03,311 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 18:46:03,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 18:46:03,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:46:03,485 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=829, Invalid=7727, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 18:46:03,486 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:03,486 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 18:46:03,490 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:46:03,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:46:03,490 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2804states) and FLOYD_HOARE automaton (currently 48 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-13 18:46:03,492 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:46:03,492 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:46:03,492 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:46:03,495 INFO L422 BasicCegarLoop]: Path program histogram: [17, 8, 2, 2, 2, 2, 1, 1, 1] [2025-04-13 18:46:03,498 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:46:03,498 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:46:03,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:46:03 BasicIcfg [2025-04-13 18:46:03,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:46:03,501 INFO L158 Benchmark]: Toolchain (without parser) took 839645.27ms. Allocated memory was 125.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 88.4MB in the beginning and 611.1MB in the end (delta: -522.7MB). Peak memory consumption was 402.4MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,501 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:46:03,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.57ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 72.2MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.24ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,501 INFO L158 Benchmark]: Boogie Preprocessor took 45.88ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 67.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,501 INFO L158 Benchmark]: RCFGBuilder took 644.57ms. Allocated memory is still 125.8MB. Free memory was 67.1MB in the beginning and 41.5MB in the end (delta: 25.6MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,502 INFO L158 Benchmark]: TraceAbstraction took 838678.22ms. Allocated memory was 125.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 40.9MB in the beginning and 611.1MB in the end (delta: -570.2MB). Peak memory consumption was 358.3MB. Max. memory is 8.0GB. [2025-04-13 18:46:03,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.57ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 72.2MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.24ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.88ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 67.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 644.57ms. Allocated memory is still 125.8MB. Free memory was 67.1MB in the beginning and 41.5MB in the end (delta: 25.6MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 838678.22ms. Allocated memory was 125.8MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 40.9MB in the beginning and 611.1MB in the end (delta: -570.2MB). Peak memory consumption was 358.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (2804states) and FLOYD_HOARE automaton (currently 48 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2804states) and FLOYD_HOARE automaton (currently 48 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2804states) and FLOYD_HOARE automaton (currently 48 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (2804states) and FLOYD_HOARE automaton (currently 48 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 838.6s, OverallIterations: 36, TraceHistogramMax: 2, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.1s, AutomataDifference: 462.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 4332 SdHoareTripleChecker+Valid, 263.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4332 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 259.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1622 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2544 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56316 IncrementalHoareTripleChecker+Invalid, 60528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2544 mSolverCounterUnsat, 0 mSDtfsCounter, 56316 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1474 GetRequests, 408 SyntacticMatches, 23 SemanticMatches, 1042 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 25946 ImplicationChecksByTransitivity, 289.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2804occurred in iteration=35, InterpolantAutomatonStates: 722, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 11013 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 367.6s InterpolantComputationTime, 1347 NumberOfCodeBlocks, 1321 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1647 ConstructedInterpolants, 210 QuantifiedInterpolants, 46287 SizeOfPredicates, 203 NumberOfNonLiveVariables, 3224 ConjunctsInSsa, 561 ConjunctsInUnsatCore, 58 InterpolantComputations, 25 PerfectInterpolantSequences, 113/319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown