/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/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:50:21,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:50:21,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:50:21,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:50:21,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:50:21,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:50:21,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:50:21,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:50:21,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:50:21,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:50:21,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:50:21,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:50:21,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:50:21,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:50:21,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:50:21,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:50:21,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:50:21,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:50:21,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:50:21,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:50:21,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:50:21,566 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:50:21,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-13 17:50:22,835 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3542b80/5f29466ff50e4853a6d494a941728334/FLAG754307b92 [2025-04-13 17:50:23,070 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:50:23,071 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2025-04-13 17:50:23,077 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3542b80/5f29466ff50e4853a6d494a941728334/FLAG754307b92 [2025-04-13 17:50:23,884 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3542b80/5f29466ff50e4853a6d494a941728334 [2025-04-13 17:50:23,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:50:23,887 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:50:23,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:50:23,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:50:23,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:50:23,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:50:23" (1/1) ... [2025-04-13 17:50:23,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8f3345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:23, skipping insertion in model container [2025-04-13 17:50:23,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:50:23" (1/1) ... [2025-04-13 17:50:23,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:50:24,094 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-13 17:50:24,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:50:24,110 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:50:24,160 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-04-13 17:50:24,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:50:24,176 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:50:24,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24 WrapperNode [2025-04-13 17:50:24,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:50:24,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:50:24,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:50:24,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:50:24,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,230 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-04-13 17:50:24,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:50:24,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:50:24,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:50:24,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:50:24,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,271 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 17:50:24,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:50:24,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:50:24,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:50:24,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:50:24,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (1/1) ... [2025-04-13 17:50:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:50:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:24,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:50:24,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:50:24,342 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:50:24,342 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 17:50:24,342 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:50:24,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:50:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:50:24,344 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:50:24,454 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:50:24,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:50:25,040 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:50:25,041 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:50:25,041 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:50:25,822 INFO L313 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-13 17:50:25,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:50:25 BoogieIcfgContainer [2025-04-13 17:50:25,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:50:25,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:50:25,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:50:25,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:50:25,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:50:23" (1/3) ... [2025-04-13 17:50:25,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fff60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:50:25, skipping insertion in model container [2025-04-13 17:50:25,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:50:24" (2/3) ... [2025-04-13 17:50:25,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fff60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:50:25, skipping insertion in model container [2025-04-13 17:50:25,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:50:25" (3/3) ... [2025-04-13 17:50:25,829 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-04-13 17:50:25,839 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:50:25,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 17:50:25,840 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:50:25,940 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 17:50:25,961 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 17:50:25,977 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:26,000 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:50:26,009 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;@7103149f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:50:26,009 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:50:26,011 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:26,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:50:26,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:26,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:26,019 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 17:50:26,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -72813166, now seen corresponding path program 1 times [2025-04-13 17:50:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:26,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718637343] [2025-04-13 17:50:26,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:26,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:50:26,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:50:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:50:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:26,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718637343] [2025-04-13 17:50:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718637343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:26,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:50:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20496112] [2025-04-13 17:50:26,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:26,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:50:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:26,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:50:26,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:26,402 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:26,501 INFO L93 Difference]: Finished difference Result 195 states and 749 transitions. [2025-04-13 17:50:26,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:50:26,503 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-04-13 17:50:26,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:26,509 INFO L225 Difference]: With dead ends: 195 [2025-04-13 17:50:26,509 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 17:50:26,511 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 17:50:26,513 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:26,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 17:50:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-13 17:50:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 3.797979797979798) internal successors, (376), 99 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 376 transitions. [2025-04-13 17:50:26,540 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 376 transitions. Word has length 17 [2025-04-13 17:50:26,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:26,540 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 376 transitions. [2025-04-13 17:50:26,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:26,541 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 376 transitions. [2025-04-13 17:50:26,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:50:26,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:26,544 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 17:50:26,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:50:26,544 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 17:50:26,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2058450732, now seen corresponding path program 1 times [2025-04-13 17:50:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:26,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824211609] [2025-04-13 17:50:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:26,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:50:26,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:50:26,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:50:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:26,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824211609] [2025-04-13 17:50:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824211609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:26,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451838000] [2025-04-13 17:50:26,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:26,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:50:26,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 17:50:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:50:26,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:50:26,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:26,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:26,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:50:26,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:50:27,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:50:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451838000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:27,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:27,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 17:50:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082491246] [2025-04-13 17:50:27,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:27,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:50:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:27,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:50:27,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:50:27,044 INFO L87 Difference]: Start difference. First operand 100 states and 376 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:27,153 INFO L93 Difference]: Finished difference Result 206 states and 766 transitions. [2025-04-13 17:50:27,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:50:27,154 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:50:27,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:27,155 INFO L225 Difference]: With dead ends: 206 [2025-04-13 17:50:27,155 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 17:50:27,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:50:27,156 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:27,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 17:50:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 17:50:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 3.564814814814815) internal successors, (385), 108 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 385 transitions. [2025-04-13 17:50:27,164 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 385 transitions. Word has length 20 [2025-04-13 17:50:27,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:27,164 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 385 transitions. [2025-04-13 17:50:27,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:27,164 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 385 transitions. [2025-04-13 17:50:27,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:27,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:27,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:27,172 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 17:50:27,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:27,370 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 17:50:27,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1131104530, now seen corresponding path program 2 times [2025-04-13 17:50:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:27,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040387526] [2025-04-13 17:50:27,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:27,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:27,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 17:50:27,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:50:27,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:50:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:27,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040387526] [2025-04-13 17:50:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040387526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805564652] [2025-04-13 17:50:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:27,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:27,961 INFO L87 Difference]: Start difference. First operand 109 states and 385 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:28,184 INFO L93 Difference]: Finished difference Result 201 states and 645 transitions. [2025-04-13 17:50:28,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:28,184 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 29 [2025-04-13 17:50:28,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:28,186 INFO L225 Difference]: With dead ends: 201 [2025-04-13 17:50:28,186 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 17:50:28,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:28,186 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:28,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 17:50:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2025-04-13 17:50:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 3.43801652892562) internal successors, (416), 121 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 416 transitions. [2025-04-13 17:50:28,195 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 416 transitions. Word has length 29 [2025-04-13 17:50:28,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:28,195 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 416 transitions. [2025-04-13 17:50:28,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:28,195 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 416 transitions. [2025-04-13 17:50:28,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:28,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:28,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:50:28,196 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 17:50:28,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1574613372, now seen corresponding path program 3 times [2025-04-13 17:50:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:28,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260796736] [2025-04-13 17:50:28,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:28,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 17:50:28,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 17:50:28,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:50:28,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:50:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:28,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260796736] [2025-04-13 17:50:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260796736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835348751] [2025-04-13 17:50:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:28,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:28,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:28,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:28,655 INFO L87 Difference]: Start difference. First operand 122 states and 416 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:28,991 INFO L93 Difference]: Finished difference Result 274 states and 908 transitions. [2025-04-13 17:50:28,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:50:28,992 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 29 [2025-04-13 17:50:28,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:28,994 INFO L225 Difference]: With dead ends: 274 [2025-04-13 17:50:28,994 INFO L226 Difference]: Without dead ends: 268 [2025-04-13 17:50:28,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:50:28,995 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:28,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-04-13 17:50:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 125. [2025-04-13 17:50:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 3.3951612903225805) internal successors, (421), 124 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 421 transitions. [2025-04-13 17:50:29,011 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 421 transitions. Word has length 29 [2025-04-13 17:50:29,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:29,012 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 421 transitions. [2025-04-13 17:50:29,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:29,012 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 421 transitions. [2025-04-13 17:50:29,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:29,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:29,014 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:29,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:50:29,014 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 17:50:29,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -563806496, now seen corresponding path program 4 times [2025-04-13 17:50:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:29,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55817599] [2025-04-13 17:50:29,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:29,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:29,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:29,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:29,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:50:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:29,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55817599] [2025-04-13 17:50:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55817599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:29,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420543070] [2025-04-13 17:50:29,179 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:29,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:50:29,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 17:50:29,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:29,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:29,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:29,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:29,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:50:29,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:50:29,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:50:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420543070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:29,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 17:50:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131461375] [2025-04-13 17:50:29,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:29,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:50:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:50:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:50:29,428 INFO L87 Difference]: Start difference. First operand 125 states and 421 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:29,539 INFO L93 Difference]: Finished difference Result 247 states and 841 transitions. [2025-04-13 17:50:29,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:50:29,540 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:29,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:29,541 INFO L225 Difference]: With dead ends: 247 [2025-04-13 17:50:29,541 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 17:50:29,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:50:29,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:29,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 17:50:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-13 17:50:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 3.338582677165354) internal successors, (424), 127 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 424 transitions. [2025-04-13 17:50:29,551 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 424 transitions. Word has length 29 [2025-04-13 17:50:29,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:29,551 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 424 transitions. [2025-04-13 17:50:29,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:29,551 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 424 transitions. [2025-04-13 17:50:29,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 17:50:29,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:29,552 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:29,559 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 17:50:29,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:29,756 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 17:50:29,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2104860026, now seen corresponding path program 5 times [2025-04-13 17:50:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:29,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229724368] [2025-04-13 17:50:29,756 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:29,774 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 17:50:29,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 17:50:29,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:29,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:30,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229724368] [2025-04-13 17:50:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229724368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340043669] [2025-04-13 17:50:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:30,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:30,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:30,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:30,446 INFO L87 Difference]: Start difference. First operand 128 states and 424 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:30,716 INFO L93 Difference]: Finished difference Result 196 states and 593 transitions. [2025-04-13 17:50:30,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:30,716 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 32 [2025-04-13 17:50:30,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:30,718 INFO L225 Difference]: With dead ends: 196 [2025-04-13 17:50:30,718 INFO L226 Difference]: Without dead ends: 190 [2025-04-13 17:50:30,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:30,719 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:30,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-13 17:50:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2025-04-13 17:50:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.351145038167939) internal successors, (439), 131 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 439 transitions. [2025-04-13 17:50:30,727 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 439 transitions. Word has length 32 [2025-04-13 17:50:30,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:30,728 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 439 transitions. [2025-04-13 17:50:30,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:30,728 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 439 transitions. [2025-04-13 17:50:30,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 17:50:30,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:30,728 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:30,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:50:30,729 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 17:50:30,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash -651144932, now seen corresponding path program 6 times [2025-04-13 17:50:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:30,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105050576] [2025-04-13 17:50:30,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:30,747 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-04-13 17:50:30,759 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 17:50:30,759 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:50:30,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:31,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105050576] [2025-04-13 17:50:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105050576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918886427] [2025-04-13 17:50:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:31,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:31,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:31,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:31,003 INFO L87 Difference]: Start difference. First operand 132 states and 439 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:31,273 INFO L93 Difference]: Finished difference Result 320 states and 1098 transitions. [2025-04-13 17:50:31,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:50:31,273 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 32 [2025-04-13 17:50:31,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:31,275 INFO L225 Difference]: With dead ends: 320 [2025-04-13 17:50:31,275 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 17:50:31,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:31,276 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:31,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 17:50:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 134. [2025-04-13 17:50:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.3233082706766917) internal successors, (442), 133 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 442 transitions. [2025-04-13 17:50:31,284 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 442 transitions. Word has length 32 [2025-04-13 17:50:31,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:31,284 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 442 transitions. [2025-04-13 17:50:31,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:31,285 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 442 transitions. [2025-04-13 17:50:31,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 17:50:31,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:31,285 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:31,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:50:31,285 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 17:50:31,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 871701854, now seen corresponding path program 7 times [2025-04-13 17:50:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:31,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838184802] [2025-04-13 17:50:31,289 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:31,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 17:50:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 17:50:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:31,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:31,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838184802] [2025-04-13 17:50:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838184802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228645030] [2025-04-13 17:50:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:31,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:31,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:31,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:31,675 INFO L87 Difference]: Start difference. First operand 134 states and 442 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:31,984 INFO L93 Difference]: Finished difference Result 317 states and 1080 transitions. [2025-04-13 17:50:31,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:50:31,984 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 32 [2025-04-13 17:50:31,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:31,986 INFO L225 Difference]: With dead ends: 317 [2025-04-13 17:50:31,986 INFO L226 Difference]: Without dead ends: 311 [2025-04-13 17:50:31,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:31,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:31,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-13 17:50:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 136. [2025-04-13 17:50:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.3407407407407406) internal successors, (451), 135 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 451 transitions. [2025-04-13 17:50:31,998 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 451 transitions. Word has length 32 [2025-04-13 17:50:31,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:31,998 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 451 transitions. [2025-04-13 17:50:31,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:31,998 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 451 transitions. [2025-04-13 17:50:31,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 17:50:31,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:31,998 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:31,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:50:31,999 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 17:50:31,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 970905884, now seen corresponding path program 8 times [2025-04-13 17:50:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:31,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152330817] [2025-04-13 17:50:31,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:32,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 17:50:32,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 17:50:32,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:50:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:32,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152330817] [2025-04-13 17:50:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152330817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:32,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:32,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695762742] [2025-04-13 17:50:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:32,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:32,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:32,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:32,271 INFO L87 Difference]: Start difference. First operand 136 states and 451 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:32,518 INFO L93 Difference]: Finished difference Result 233 states and 753 transitions. [2025-04-13 17:50:32,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:32,518 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 32 [2025-04-13 17:50:32,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:32,520 INFO L225 Difference]: With dead ends: 233 [2025-04-13 17:50:32,520 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 17:50:32,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:32,521 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:32,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 17:50:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 136. [2025-04-13 17:50:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.3407407407407406) internal successors, (451), 135 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 451 transitions. [2025-04-13 17:50:32,552 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 451 transitions. Word has length 32 [2025-04-13 17:50:32,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:32,552 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 451 transitions. [2025-04-13 17:50:32,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 17:50:32,552 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 451 transitions. [2025-04-13 17:50:32,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:32,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:32,553 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:32,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:50:32,553 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 17:50:32,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2032679904, now seen corresponding path program 1 times [2025-04-13 17:50:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:32,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148906135] [2025-04-13 17:50:32,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:32,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:50:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:50:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:32,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148906135] [2025-04-13 17:50:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148906135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:32,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481124858] [2025-04-13 17:50:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:32,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:50:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:32,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:50:32,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:50:32,719 INFO L87 Difference]: Start difference. First operand 136 states and 451 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:32,853 INFO L93 Difference]: Finished difference Result 180 states and 561 transitions. [2025-04-13 17:50:32,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:50:32,854 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:32,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:32,855 INFO L225 Difference]: With dead ends: 180 [2025-04-13 17:50:32,855 INFO L226 Difference]: Without dead ends: 156 [2025-04-13 17:50:32,856 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 17:50:32,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:32,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-13 17:50:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2025-04-13 17:50:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.253623188405797) internal successors, (449), 138 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 449 transitions. [2025-04-13 17:50:32,874 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 449 transitions. Word has length 33 [2025-04-13 17:50:32,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:32,874 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 449 transitions. [2025-04-13 17:50:32,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:32,874 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 449 transitions. [2025-04-13 17:50:32,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:32,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:32,875 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:32,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:50:32,875 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 17:50:32,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2014507430, now seen corresponding path program 1 times [2025-04-13 17:50:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:32,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618530739] [2025-04-13 17:50:32,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:32,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:50:32,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:50:32,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:32,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:33,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618530739] [2025-04-13 17:50:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618530739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60380584] [2025-04-13 17:50:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:33,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:33,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:33,098 INFO L87 Difference]: Start difference. First operand 139 states and 449 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:33,245 INFO L93 Difference]: Finished difference Result 220 states and 647 transitions. [2025-04-13 17:50:33,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:33,245 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:33,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:33,247 INFO L225 Difference]: With dead ends: 220 [2025-04-13 17:50:33,247 INFO L226 Difference]: Without dead ends: 185 [2025-04-13 17:50:33,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:50:33,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:33,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-13 17:50:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2025-04-13 17:50:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.217391304347826) internal successors, (444), 138 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 444 transitions. [2025-04-13 17:50:33,260 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 444 transitions. Word has length 33 [2025-04-13 17:50:33,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:33,260 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 444 transitions. [2025-04-13 17:50:33,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,260 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 444 transitions. [2025-04-13 17:50:33,260 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:33,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:33,261 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:33,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:50:33,261 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 17:50:33,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1828750398, now seen corresponding path program 1 times [2025-04-13 17:50:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:33,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301145808] [2025-04-13 17:50:33,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:33,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:50:33,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:50:33,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:33,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:33,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301145808] [2025-04-13 17:50:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301145808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129589719] [2025-04-13 17:50:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:33,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:33,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:33,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:33,423 INFO L87 Difference]: Start difference. First operand 139 states and 444 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:33,626 INFO L93 Difference]: Finished difference Result 276 states and 856 transitions. [2025-04-13 17:50:33,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:50:33,626 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:33,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:33,628 INFO L225 Difference]: With dead ends: 276 [2025-04-13 17:50:33,628 INFO L226 Difference]: Without dead ends: 248 [2025-04-13 17:50:33,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:50:33,628 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:33,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-13 17:50:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 144. [2025-04-13 17:50:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.13986013986014) internal successors, (449), 143 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 449 transitions. [2025-04-13 17:50:33,643 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 449 transitions. Word has length 33 [2025-04-13 17:50:33,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:33,643 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 449 transitions. [2025-04-13 17:50:33,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,643 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 449 transitions. [2025-04-13 17:50:33,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:33,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:33,644 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:33,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:50:33,645 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 17:50:33,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1603588218, now seen corresponding path program 2 times [2025-04-13 17:50:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:33,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071521362] [2025-04-13 17:50:33,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:33,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:50:33,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 17:50:33,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:50:33,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:33,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071521362] [2025-04-13 17:50:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071521362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073717014] [2025-04-13 17:50:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:33,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:33,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:33,749 INFO L87 Difference]: Start difference. First operand 144 states and 449 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:33,955 INFO L93 Difference]: Finished difference Result 241 states and 680 transitions. [2025-04-13 17:50:33,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:50:33,956 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:33,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:33,957 INFO L225 Difference]: With dead ends: 241 [2025-04-13 17:50:33,957 INFO L226 Difference]: Without dead ends: 201 [2025-04-13 17:50:33,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:33,958 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:33,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-13 17:50:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 137. [2025-04-13 17:50:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.110294117647059) internal successors, (423), 136 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 423 transitions. [2025-04-13 17:50:33,970 INFO L79 Accepts]: Start accepts. Automaton has 137 states and 423 transitions. Word has length 33 [2025-04-13 17:50:33,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:33,971 INFO L485 AbstractCegarLoop]: Abstraction has 137 states and 423 transitions. [2025-04-13 17:50:33,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:33,972 INFO L278 IsEmpty]: Start isEmpty. Operand 137 states and 423 transitions. [2025-04-13 17:50:33,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:33,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:33,972 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:33,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:50:33,972 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 17:50:33,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1682656266, now seen corresponding path program 3 times [2025-04-13 17:50:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:33,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896693914] [2025-04-13 17:50:33,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:33,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:50:33,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 17:50:33,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:50:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:34,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:34,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896693914] [2025-04-13 17:50:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896693914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061408499] [2025-04-13 17:50:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:34,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:34,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:34,114 INFO L87 Difference]: Start difference. First operand 137 states and 423 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:34,283 INFO L93 Difference]: Finished difference Result 190 states and 546 transitions. [2025-04-13 17:50:34,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:34,283 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:34,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:34,284 INFO L225 Difference]: With dead ends: 190 [2025-04-13 17:50:34,284 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 17:50:34,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:50:34,285 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:34,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 17:50:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2025-04-13 17:50:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.112) internal successors, (389), 125 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 389 transitions. [2025-04-13 17:50:34,295 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 389 transitions. Word has length 33 [2025-04-13 17:50:34,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:34,295 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 389 transitions. [2025-04-13 17:50:34,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,295 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 389 transitions. [2025-04-13 17:50:34,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:34,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:34,296 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:34,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:50:34,296 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 17:50:34,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1524593402, now seen corresponding path program 4 times [2025-04-13 17:50:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:34,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525078863] [2025-04-13 17:50:34,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:34,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:50:34,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:50:34,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:34,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:34,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525078863] [2025-04-13 17:50:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525078863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:34,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013313574] [2025-04-13 17:50:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:34,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:50:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:34,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:50:34,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:50:34,446 INFO L87 Difference]: Start difference. First operand 126 states and 389 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:34,551 INFO L93 Difference]: Finished difference Result 161 states and 468 transitions. [2025-04-13 17:50:34,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:50:34,552 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:34,552 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:34,553 INFO L225 Difference]: With dead ends: 161 [2025-04-13 17:50:34,553 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 17:50:34,553 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 17:50:34,553 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:34,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 17:50:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2025-04-13 17:50:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.977777777777778) internal successors, (402), 135 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 402 transitions. [2025-04-13 17:50:34,564 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 402 transitions. Word has length 33 [2025-04-13 17:50:34,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:34,564 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 402 transitions. [2025-04-13 17:50:34,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,565 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 402 transitions. [2025-04-13 17:50:34,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:34,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:34,565 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:34,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:50:34,565 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 17:50:34,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash -110254458, now seen corresponding path program 2 times [2025-04-13 17:50:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:34,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027631499] [2025-04-13 17:50:34,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:34,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:50:34,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 17:50:34,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:50:34,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:34,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027631499] [2025-04-13 17:50:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027631499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062819263] [2025-04-13 17:50:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:34,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:50:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:34,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:50:34,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:50:34,639 INFO L87 Difference]: Start difference. First operand 136 states and 402 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:34,734 INFO L93 Difference]: Finished difference Result 164 states and 462 transitions. [2025-04-13 17:50:34,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:50:34,735 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:34,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:34,736 INFO L225 Difference]: With dead ends: 164 [2025-04-13 17:50:34,736 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 17:50:34,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 17:50:34,736 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:34,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 17:50:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-04-13 17:50:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.96) internal successors, (370), 125 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 370 transitions. [2025-04-13 17:50:34,746 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 370 transitions. Word has length 33 [2025-04-13 17:50:34,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:34,746 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 370 transitions. [2025-04-13 17:50:34,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,746 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 370 transitions. [2025-04-13 17:50:34,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:34,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:34,746 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:34,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:50:34,746 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 17:50:34,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 672404026, now seen corresponding path program 2 times [2025-04-13 17:50:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:34,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315763122] [2025-04-13 17:50:34,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:34,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:50:34,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 17:50:34,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:50:34,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:34,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315763122] [2025-04-13 17:50:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315763122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:34,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:34,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:50:34,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992447852] [2025-04-13 17:50:34,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:34,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:50:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:34,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:50:34,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:34,829 INFO L87 Difference]: Start difference. First operand 126 states and 370 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:34,940 INFO L93 Difference]: Finished difference Result 150 states and 412 transitions. [2025-04-13 17:50:34,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:50:34,940 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:34,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:34,941 INFO L225 Difference]: With dead ends: 150 [2025-04-13 17:50:34,941 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 17:50:34,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:50:34,942 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:34,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 17:50:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2025-04-13 17:50:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.9834710743801653) internal successors, (361), 121 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 361 transitions. [2025-04-13 17:50:34,952 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 361 transitions. Word has length 33 [2025-04-13 17:50:34,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:34,952 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 361 transitions. [2025-04-13 17:50:34,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:34,952 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 361 transitions. [2025-04-13 17:50:34,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:50:34,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:34,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:34,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:50:34,953 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 17:50:34,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -679859030, now seen corresponding path program 3 times [2025-04-13 17:50:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:34,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292857615] [2025-04-13 17:50:34,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:34,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 17:50:34,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 17:50:34,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:50:34,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:35,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:35,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292857615] [2025-04-13 17:50:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292857615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:35,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:35,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139225041] [2025-04-13 17:50:35,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:35,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:50:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:35,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:50:35,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:50:35,039 INFO L87 Difference]: Start difference. First operand 122 states and 361 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:35,139 INFO L93 Difference]: Finished difference Result 138 states and 399 transitions. [2025-04-13 17:50:35,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:50:35,140 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 17:50:35,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:35,140 INFO L225 Difference]: With dead ends: 138 [2025-04-13 17:50:35,141 INFO L226 Difference]: Without dead ends: 112 [2025-04-13 17:50:35,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:50:35,141 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:35,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-13 17:50:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-04-13 17:50:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.81981981981982) internal successors, (313), 111 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 313 transitions. [2025-04-13 17:50:35,151 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 313 transitions. Word has length 33 [2025-04-13 17:50:35,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:35,151 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 313 transitions. [2025-04-13 17:50:35,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,151 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 313 transitions. [2025-04-13 17:50:35,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 17:50:35,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:35,153 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:35,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:50:35,153 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 17:50:35,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2027861768, now seen corresponding path program 1 times [2025-04-13 17:50:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:35,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905490073] [2025-04-13 17:50:35,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 17:50:35,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 17:50:35,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:35,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:35,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905490073] [2025-04-13 17:50:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905490073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:35,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:35,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402298449] [2025-04-13 17:50:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:35,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:50:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:35,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:50:35,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,258 INFO L87 Difference]: Start difference. First operand 112 states and 313 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) 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 17:50:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:35,342 INFO L93 Difference]: Finished difference Result 178 states and 518 transitions. [2025-04-13 17:50:35,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:50:35,342 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) 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 35 [2025-04-13 17:50:35,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:35,343 INFO L225 Difference]: With dead ends: 178 [2025-04-13 17:50:35,343 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 17:50:35,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,344 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:35,344 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 17:50:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-04-13 17:50:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9051094890510947) internal successors, (398), 137 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 398 transitions. [2025-04-13 17:50:35,355 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 398 transitions. Word has length 35 [2025-04-13 17:50:35,355 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:35,355 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 398 transitions. [2025-04-13 17:50:35,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) 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 17:50:35,356 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 398 transitions. [2025-04-13 17:50:35,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 17:50:35,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:35,356 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:35,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:50:35,356 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 17:50:35,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash 622635012, now seen corresponding path program 1 times [2025-04-13 17:50:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:35,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725344920] [2025-04-13 17:50:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:35,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 17:50:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:50:35,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:50:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:35,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725344920] [2025-04-13 17:50:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725344920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972070505] [2025-04-13 17:50:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:35,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:50:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:35,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:50:35,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,523 INFO L87 Difference]: Start difference. First operand 138 states and 398 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 17:50:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:35,591 INFO L93 Difference]: Finished difference Result 213 states and 640 transitions. [2025-04-13 17:50:35,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:50:35,592 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 36 [2025-04-13 17:50:35,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:35,593 INFO L225 Difference]: With dead ends: 213 [2025-04-13 17:50:35,593 INFO L226 Difference]: Without dead ends: 173 [2025-04-13 17:50:35,593 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,594 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:35,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:50:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-13 17:50:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-04-13 17:50:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.994186046511628) internal successors, (515), 172 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 515 transitions. [2025-04-13 17:50:35,610 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 515 transitions. Word has length 36 [2025-04-13 17:50:35,610 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:35,610 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 515 transitions. [2025-04-13 17:50:35,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 17:50:35,610 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 515 transitions. [2025-04-13 17:50:35,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:50:35,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:35,611 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:50:35,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:50:35,611 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 17:50:35,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 364578544, now seen corresponding path program 1 times [2025-04-13 17:50:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:35,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490746417] [2025-04-13 17:50:35,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:35,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:50:35,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:50:35,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:35,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 17:50:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:35,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490746417] [2025-04-13 17:50:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490746417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:50:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:50:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:50:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043162368] [2025-04-13 17:50:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:50:35,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:50:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:35,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:50:35,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,803 INFO L87 Difference]: Start difference. First operand 173 states and 515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 17:50:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:35,913 INFO L93 Difference]: Finished difference Result 249 states and 769 transitions. [2025-04-13 17:50:35,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:50:35,913 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 37 [2025-04-13 17:50:35,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:35,914 INFO L225 Difference]: With dead ends: 249 [2025-04-13 17:50:35,915 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 17:50:35,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:50:35,915 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:35,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:50:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 17:50:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-04-13 17:50:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.0669856459330145) internal successors, (641), 209 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions. [2025-04-13 17:50:35,948 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 37 [2025-04-13 17:50:35,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:35,948 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 641 transitions. [2025-04-13 17:50:35,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 17:50:35,948 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions. [2025-04-13 17:50:35,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:50:35,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:35,949 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:50:35,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 17:50:35,949 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 17:50:35,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2139181012, now seen corresponding path program 1 times [2025-04-13 17:50:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:35,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138137734] [2025-04-13 17:50:35,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:35,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:50:36,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:50:36,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:36,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 17:50:39,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:39,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138137734] [2025-04-13 17:50:39,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138137734] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:39,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620975035] [2025-04-13 17:50:39,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:50:39,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:39,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:50:39,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 17:50:39,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:50:39,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:50:39,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:39,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:39,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 17:50:39,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:42,545 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:50:42,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 426 treesize of output 866 [2025-04-13 17:50:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:47,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:50,155 INFO L325 Elim1Store]: treesize reduction 32, result has 71.7 percent of original size [2025-04-13 17:50:50,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 210 treesize of output 242 [2025-04-13 17:50:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:50:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620975035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:50,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2025-04-13 17:50:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877017205] [2025-04-13 17:50:50,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:50,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:50:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:50,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:50:50,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:50:50,662 INFO L87 Difference]: Start difference. First operand 210 states and 641 transitions. Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:05,903 INFO L93 Difference]: Finished difference Result 793 states and 2466 transitions. [2025-04-13 17:51:05,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 17:51:05,903 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:05,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:05,907 INFO L225 Difference]: With dead ends: 793 [2025-04-13 17:51:05,907 INFO L226 Difference]: Without dead ends: 722 [2025-04-13 17:51:05,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1931, Invalid=9199, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 17:51:05,910 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 632 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:05,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 0 Invalid, 3802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:51:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-04-13 17:51:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 337. [2025-04-13 17:51:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.1875) internal successors, (1071), 336 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1071 transitions. [2025-04-13 17:51:06,013 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 1071 transitions. Word has length 38 [2025-04-13 17:51:06,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:06,013 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 1071 transitions. [2025-04-13 17:51:06,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:06,014 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 1071 transitions. [2025-04-13 17:51:06,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:06,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:06,014 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:06,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:51:06,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:06,219 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 17:51:06,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1698790430, now seen corresponding path program 2 times [2025-04-13 17:51:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:06,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037800366] [2025-04-13 17:51:06,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:06,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:51:06,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:06,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:06,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:51:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:10,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037800366] [2025-04-13 17:51:10,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037800366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:10,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277817275] [2025-04-13 17:51:10,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:10,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:51:10,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 17:51:10,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:51:10,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:10,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:10,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:10,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:51:10,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:11,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:11,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 306 treesize of output 366 [2025-04-13 17:51:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:11,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:13,156 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 17:51:13,157 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 201 treesize of output 194 [2025-04-13 17:51:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277817275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:13,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 7] total 33 [2025-04-13 17:51:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549229507] [2025-04-13 17:51:13,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:13,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:51:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:13,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:51:13,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:51:13,561 INFO L87 Difference]: Start difference. First operand 337 states and 1071 transitions. Second operand has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:15,593 INFO L93 Difference]: Finished difference Result 580 states and 1803 transitions. [2025-04-13 17:51:15,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:51:15,593 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:15,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:15,596 INFO L225 Difference]: With dead ends: 580 [2025-04-13 17:51:15,596 INFO L226 Difference]: Without dead ends: 556 [2025-04-13 17:51:15,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=2486, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:51:15,597 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:15,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:51:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-04-13 17:51:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 350. [2025-04-13 17:51:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 3.2464183381088825) internal successors, (1133), 349 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1133 transitions. [2025-04-13 17:51:15,703 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 1133 transitions. Word has length 38 [2025-04-13 17:51:15,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:15,703 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 1133 transitions. [2025-04-13 17:51:15,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:15,703 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 1133 transitions. [2025-04-13 17:51:15,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:15,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:15,704 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:15,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 17:51:15,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:15,904 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 17:51:15,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -206305242, now seen corresponding path program 3 times [2025-04-13 17:51:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:15,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501160197] [2025-04-13 17:51:15,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:15,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:15,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:16,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:51:16,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:51:16,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:17,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:17,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501160197] [2025-04-13 17:51:17,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501160197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:17,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941827019] [2025-04-13 17:51:17,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:17,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:17,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:51:17,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 17:51:17,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:17,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:51:17,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:51:17,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:51:17,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:18,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:18,875 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 253 treesize of output 241 [2025-04-13 17:51:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:19,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:20,365 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:20,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 266 treesize of output 470 [2025-04-13 17:51:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941827019] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:21,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2025-04-13 17:51:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414496622] [2025-04-13 17:51:21,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:21,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:51:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:21,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:51:21,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:51:21,267 INFO L87 Difference]: Start difference. First operand 350 states and 1133 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:22,051 INFO L93 Difference]: Finished difference Result 476 states and 1441 transitions. [2025-04-13 17:51:22,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:51:22,052 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:22,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:22,054 INFO L225 Difference]: With dead ends: 476 [2025-04-13 17:51:22,054 INFO L226 Difference]: Without dead ends: 452 [2025-04-13 17:51:22,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:51:22,055 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:22,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:51:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-04-13 17:51:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 349. [2025-04-13 17:51:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.2126436781609193) internal successors, (1118), 348 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1118 transitions. [2025-04-13 17:51:22,169 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1118 transitions. Word has length 38 [2025-04-13 17:51:22,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:22,169 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1118 transitions. [2025-04-13 17:51:22,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:22,170 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1118 transitions. [2025-04-13 17:51:22,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:22,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:22,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:22,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 17:51:22,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 17:51:22,375 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 17:51:22,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 653614030, now seen corresponding path program 4 times [2025-04-13 17:51:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:22,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372393591] [2025-04-13 17:51:22,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:51:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:22,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:51:22,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:22,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:51:22,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:51:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:26,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372393591] [2025-04-13 17:51:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372393591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:26,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522107151] [2025-04-13 17:51:26,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:51:26,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:26,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:26,528 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 17:51:26,529 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 17:51:26,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:51:26,760 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:26,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:51:26,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:26,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:51:26,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:27,797 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:27,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 266 treesize of output 462 [2025-04-13 17:51:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:51:28,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:29,754 INFO L325 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2025-04-13 17:51:29,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 193 [2025-04-13 17:51:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:51:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522107151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:29,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 38 [2025-04-13 17:51:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382604708] [2025-04-13 17:51:29,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:29,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:51:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:29,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:51:29,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:51:29,856 INFO L87 Difference]: Start difference. First operand 349 states and 1118 transitions. Second operand has 39 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:43,347 INFO L93 Difference]: Finished difference Result 1215 states and 3789 transitions. [2025-04-13 17:51:43,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-13 17:51:43,347 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:43,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:43,351 INFO L225 Difference]: With dead ends: 1215 [2025-04-13 17:51:43,352 INFO L226 Difference]: Without dead ends: 1113 [2025-04-13 17:51:43,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5543 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2323, Invalid=14969, Unknown=0, NotChecked=0, Total=17292 [2025-04-13 17:51:43,355 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 445 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4494 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:43,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 0 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4494 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:51:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-04-13 17:51:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 406. [2025-04-13 17:51:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.3777777777777778) internal successors, (1368), 405 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1368 transitions. [2025-04-13 17:51:43,547 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1368 transitions. Word has length 38 [2025-04-13 17:51:43,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:43,547 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1368 transitions. [2025-04-13 17:51:43,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:43,547 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1368 transitions. [2025-04-13 17:51:43,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:43,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:43,548 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:43,555 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 17:51:43,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:43,748 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 17:51:43,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 479009716, now seen corresponding path program 5 times [2025-04-13 17:51:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:43,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836871242] [2025-04-13 17:51:43,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:51:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:43,767 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:43,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:43,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:51:43,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:45,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836871242] [2025-04-13 17:51:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836871242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:45,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277235578] [2025-04-13 17:51:45,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:51:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:45,970 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 17:51:45,971 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 17:51:46,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:46,366 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:46,367 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:51:46,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:46,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 17:51:46,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:47,056 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:47,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 215 treesize of output 251 [2025-04-13 17:51:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:47,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:48,347 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:48,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 239 treesize of output 254 [2025-04-13 17:51:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277235578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:48,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 21 [2025-04-13 17:51:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392521434] [2025-04-13 17:51:48,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:48,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:51:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:48,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:51:48,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:51:48,762 INFO L87 Difference]: Start difference. First operand 406 states and 1368 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:49,717 INFO L93 Difference]: Finished difference Result 620 states and 1948 transitions. [2025-04-13 17:51:49,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:51:49,720 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:49,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:49,723 INFO L225 Difference]: With dead ends: 620 [2025-04-13 17:51:49,723 INFO L226 Difference]: Without dead ends: 596 [2025-04-13 17:51:49,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:51:49,724 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:49,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:51:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-04-13 17:51:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 422. [2025-04-13 17:51:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.370546318289786) internal successors, (1419), 421 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1419 transitions. [2025-04-13 17:51:49,934 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1419 transitions. Word has length 38 [2025-04-13 17:51:49,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:49,934 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1419 transitions. [2025-04-13 17:51:49,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:49,934 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1419 transitions. [2025-04-13 17:51:49,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:49,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:49,935 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:49,944 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 17:51:50,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:50,139 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 17:51:50,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:50,139 INFO L85 PathProgramCache]: Analyzing trace with hash -831511010, now seen corresponding path program 6 times [2025-04-13 17:51:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:50,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165284844] [2025-04-13 17:51:50,139 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:51:50,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:50,156 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:50,253 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:51:50,254 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:51:50,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:52,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165284844] [2025-04-13 17:51:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165284844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:52,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815887100] [2025-04-13 17:51:52,158 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:51:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:52,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:52,160 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 17:51:52,161 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 17:51:52,359 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:51:52,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:51:52,410 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:51:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:52,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 17:51:52,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:53,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:53,337 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 300 treesize of output 416 [2025-04-13 17:51:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:53,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:55,085 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:55,085 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 280 treesize of output 395 [2025-04-13 17:51:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:51:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815887100] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:55,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 17:51:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311569298] [2025-04-13 17:51:55,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:55,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:51:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:51:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:51:55,967 INFO L87 Difference]: Start difference. First operand 422 states and 1419 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:58,878 INFO L93 Difference]: Finished difference Result 818 states and 2603 transitions. [2025-04-13 17:51:58,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:51:58,878 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:51:58,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:58,881 INFO L225 Difference]: With dead ends: 818 [2025-04-13 17:51:58,881 INFO L226 Difference]: Without dead ends: 685 [2025-04-13 17:51:58,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=477, Invalid=2175, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:51:58,882 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:58,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:51:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-04-13 17:51:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 476. [2025-04-13 17:51:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.423157894736842) internal successors, (1626), 475 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1626 transitions. [2025-04-13 17:51:59,132 INFO L79 Accepts]: Start accepts. Automaton has 476 states and 1626 transitions. Word has length 38 [2025-04-13 17:51:59,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:59,132 INFO L485 AbstractCegarLoop]: Abstraction has 476 states and 1626 transitions. [2025-04-13 17:51:59,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:59,132 INFO L278 IsEmpty]: Start isEmpty. Operand 476 states and 1626 transitions. [2025-04-13 17:51:59,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:51:59,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:59,133 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:51:59,140 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 17:51:59,333 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,SelfDestructingSolverStorable26 [2025-04-13 17:51:59,333 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 17:51:59,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1211255696, now seen corresponding path program 7 times [2025-04-13 17:51:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:59,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684705168] [2025-04-13 17:51:59,334 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:51:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:59,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:51:59,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:51:59,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:51:59,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:52:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:02,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684705168] [2025-04-13 17:52:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684705168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:02,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679335356] [2025-04-13 17:52:02,881 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:52:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:02,883 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 17:52:02,884 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 17:52:03,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:52:03,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:52:03,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:52:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:03,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 17:52:03,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:03,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:03,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 341 treesize of output 701 [2025-04-13 17:52:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:52:06,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:07,597 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:07,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 224 treesize of output 297 [2025-04-13 17:52:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:52:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679335356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:08,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9, 8] total 37 [2025-04-13 17:52:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550596415] [2025-04-13 17:52:08,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:08,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:52:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:52:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:52:08,253 INFO L87 Difference]: Start difference. First operand 476 states and 1626 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:15,923 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 17:52:19,931 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 17:52:23,934 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 17:52:27,936 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 17:52:31,939 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 17:52:35,942 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 17:52:39,945 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 17:52:43,948 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 17:52:47,952 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 17:52:51,958 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 17:52:55,961 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 17:52:59,964 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 17:53:03,966 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 17:53:07,971 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 17:53:11,973 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 17:53:15,979 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 17:53:19,982 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 17:53:23,985 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 17:53:27,987 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 17:53:32,836 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 17:53:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:36,364 INFO L93 Difference]: Finished difference Result 1826 states and 5649 transitions. [2025-04-13 17:53:36,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-13 17:53:36,364 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:53:36,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:36,371 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 17:53:36,371 INFO L226 Difference]: Without dead ends: 1631 [2025-04-13 17:53:36,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3638 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1238, Invalid=11644, Unknown=0, NotChecked=0, Total=12882 [2025-04-13 17:53:36,374 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 460 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 117 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:36,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 0 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2748 Invalid, 20 Unknown, 0 Unchecked, 82.0s Time] [2025-04-13 17:53:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-04-13 17:53:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 496. [2025-04-13 17:53:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.4626262626262627) internal successors, (1714), 495 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1714 transitions. [2025-04-13 17:53:36,675 INFO L79 Accepts]: Start accepts. Automaton has 496 states and 1714 transitions. Word has length 38 [2025-04-13 17:53:36,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:36,675 INFO L485 AbstractCegarLoop]: Abstraction has 496 states and 1714 transitions. [2025-04-13 17:53:36,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:36,675 INFO L278 IsEmpty]: Start isEmpty. Operand 496 states and 1714 transitions. [2025-04-13 17:53:36,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:53:36,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:36,676 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:53:36,684 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 17:53:36,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 17:53:36,877 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 17:53:36,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1222694598, now seen corresponding path program 8 times [2025-04-13 17:53:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:36,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781699526] [2025-04-13 17:53:36,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:53:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:36,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:53:37,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:53:37,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:53:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:53:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:43,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781699526] [2025-04-13 17:53:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781699526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:43,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427842607] [2025-04-13 17:53:43,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:53:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:43,347 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 17:53:43,348 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 17:53:43,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:53:43,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:53:43,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:53:43,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:43,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 17:53:43,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:44,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:44,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 229 treesize of output 281 [2025-04-13 17:53:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:53:45,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:46,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:46,324 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 384 treesize of output 619 [2025-04-13 17:53:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:53:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427842607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:47,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11, 8] total 47 [2025-04-13 17:53:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118593235] [2025-04-13 17:53:47,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:47,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 17:53:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:47,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 17:53:47,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:53:47,644 INFO L87 Difference]: Start difference. First operand 496 states and 1714 transitions. Second operand has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:53,525 INFO L93 Difference]: Finished difference Result 806 states and 2621 transitions. [2025-04-13 17:53:53,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:53:53,525 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:53:53,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:53,529 INFO L225 Difference]: With dead ends: 806 [2025-04-13 17:53:53,529 INFO L226 Difference]: Without dead ends: 775 [2025-04-13 17:53:53,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=780, Invalid=8340, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 17:53:53,530 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:53,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3792 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 17:53:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-04-13 17:53:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 496. [2025-04-13 17:53:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 3.4626262626262627) internal successors, (1714), 495 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1714 transitions. [2025-04-13 17:53:53,868 INFO L79 Accepts]: Start accepts. Automaton has 496 states and 1714 transitions. Word has length 38 [2025-04-13 17:53:53,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:53,868 INFO L485 AbstractCegarLoop]: Abstraction has 496 states and 1714 transitions. [2025-04-13 17:53:53,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:53,868 INFO L278 IsEmpty]: Start isEmpty. Operand 496 states and 1714 transitions. [2025-04-13 17:53:53,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:53:53,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:53,869 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:53:53,878 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 17:53:54,070 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,SelfDestructingSolverStorable28 [2025-04-13 17:53:54,070 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 17:53:54,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 176901720, now seen corresponding path program 9 times [2025-04-13 17:53:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:54,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356182732] [2025-04-13 17:53:54,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:53:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:54,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:53:54,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:53:54,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:53:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:53:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:56,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356182732] [2025-04-13 17:53:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356182732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:56,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999860994] [2025-04-13 17:53:56,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:53:56,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:56,267 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 17:53:56,268 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 17:53:56,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:53:56,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:53:56,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:53:56,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:56,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:53:56,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:57,278 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:57,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 341 [2025-04-13 17:53:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:53:57,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:58,734 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 17:53:58,734 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 192 treesize of output 179 [2025-04-13 17:53:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:53:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999860994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:59,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 26 [2025-04-13 17:53:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670440762] [2025-04-13 17:53:59,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:59,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:53:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:59,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:53:59,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:53:59,133 INFO L87 Difference]: Start difference. First operand 496 states and 1714 transitions. Second operand has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:04,698 INFO L93 Difference]: Finished difference Result 1240 states and 4008 transitions. [2025-04-13 17:54:04,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:54:04,698 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:54:04,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:04,703 INFO L225 Difference]: With dead ends: 1240 [2025-04-13 17:54:04,703 INFO L226 Difference]: Without dead ends: 1164 [2025-04-13 17:54:04,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=795, Invalid=4317, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 17:54:04,704 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:04,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 17:54:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-04-13 17:54:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 542. [2025-04-13 17:54:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.4805914972273566) internal successors, (1883), 541 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1883 transitions. [2025-04-13 17:54:05,090 INFO L79 Accepts]: Start accepts. Automaton has 542 states and 1883 transitions. Word has length 38 [2025-04-13 17:54:05,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:05,090 INFO L485 AbstractCegarLoop]: Abstraction has 542 states and 1883 transitions. [2025-04-13 17:54:05,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:05,091 INFO L278 IsEmpty]: Start isEmpty. Operand 542 states and 1883 transitions. [2025-04-13 17:54:05,091 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:54:05,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:05,091 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:54:05,099 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 17:54:05,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:05,292 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 17:54:05,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 815572736, now seen corresponding path program 10 times [2025-04-13 17:54:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:05,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198574079] [2025-04-13 17:54:05,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:54:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:05,310 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:54:05,455 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:54:05,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:54:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:54:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:10,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198574079] [2025-04-13 17:54:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198574079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:10,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792633643] [2025-04-13 17:54:10,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:54:10,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:10,976 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:54:10,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 17:54:11,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:54:11,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:54:11,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:54:11,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:11,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:54:11,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:12,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:12,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 352 treesize of output 536 [2025-04-13 17:54:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:54:13,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:54:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792633643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:14,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 7] total 42 [2025-04-13 17:54:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143548032] [2025-04-13 17:54:14,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:14,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:54:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:14,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:54:14,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1672, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:54:14,828 INFO L87 Difference]: Start difference. First operand 542 states and 1883 transitions. Second operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:36,074 INFO L93 Difference]: Finished difference Result 1910 states and 5916 transitions. [2025-04-13 17:54:36,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-13 17:54:36,074 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:54:36,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:36,081 INFO L225 Difference]: With dead ends: 1910 [2025-04-13 17:54:36,082 INFO L226 Difference]: Without dead ends: 1722 [2025-04-13 17:54:36,083 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4821 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2085, Invalid=14685, Unknown=0, NotChecked=0, Total=16770 [2025-04-13 17:54:36,083 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 611 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:36,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 0 Invalid, 4224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4099 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:54:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-04-13 17:54:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 633. [2025-04-13 17:54:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 3.6787974683544302) internal successors, (2325), 632 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 2325 transitions. [2025-04-13 17:54:36,653 INFO L79 Accepts]: Start accepts. Automaton has 633 states and 2325 transitions. Word has length 38 [2025-04-13 17:54:36,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:36,654 INFO L485 AbstractCegarLoop]: Abstraction has 633 states and 2325 transitions. [2025-04-13 17:54:36,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:36,654 INFO L278 IsEmpty]: Start isEmpty. Operand 633 states and 2325 transitions. [2025-04-13 17:54:36,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:54:36,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:36,655 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:54:36,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 17:54:36,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:36,855 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 17:54:36,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1672897948, now seen corresponding path program 11 times [2025-04-13 17:54:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:36,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080198206] [2025-04-13 17:54:36,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:54:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:36,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:54:36,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:54:36,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:54:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:54:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:40,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080198206] [2025-04-13 17:54:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080198206] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:40,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630899974] [2025-04-13 17:54:40,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:54:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:40,098 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:54:40,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 17:54:40,342 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:54:40,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:54:40,553 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:54:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:40,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 17:54:40,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:42,477 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:42,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 282 treesize of output 466 [2025-04-13 17:54:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:54:43,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:45,126 INFO L325 Elim1Store]: treesize reduction 13, result has 95.7 percent of original size [2025-04-13 17:54:45,127 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 401 treesize of output 592 [2025-04-13 17:54:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:54:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630899974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:46,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 31 [2025-04-13 17:54:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859980651] [2025-04-13 17:54:46,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:46,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:54:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:46,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:54:46,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:54:46,080 INFO L87 Difference]: Start difference. First operand 633 states and 2325 transitions. Second operand has 32 states, 31 states have (on average 2.193548387096774) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:52,677 INFO L93 Difference]: Finished difference Result 1179 states and 4192 transitions. [2025-04-13 17:54:52,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:54:52,677 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.193548387096774) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:54:52,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:52,683 INFO L225 Difference]: With dead ends: 1179 [2025-04-13 17:54:52,683 INFO L226 Difference]: Without dead ends: 1173 [2025-04-13 17:54:52,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:54:52,683 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:52,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 17:54:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-04-13 17:54:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 643. [2025-04-13 17:54:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.691588785046729) internal successors, (2370), 642 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2370 transitions. [2025-04-13 17:54:53,268 INFO L79 Accepts]: Start accepts. Automaton has 643 states and 2370 transitions. Word has length 38 [2025-04-13 17:54:53,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:53,268 INFO L485 AbstractCegarLoop]: Abstraction has 643 states and 2370 transitions. [2025-04-13 17:54:53,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.193548387096774) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:53,268 INFO L278 IsEmpty]: Start isEmpty. Operand 643 states and 2370 transitions. [2025-04-13 17:54:53,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:54:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:53,269 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:54:53,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 17:54:53,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 17:54:53,469 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 17:54:53,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1886032340, now seen corresponding path program 12 times [2025-04-13 17:54:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:53,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866468182] [2025-04-13 17:54:53,470 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:54:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:53,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:54:53,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:54:53,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:54:53,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:54:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:55,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866468182] [2025-04-13 17:54:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866468182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:55,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600624652] [2025-04-13 17:54:55,469 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:54:55,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:55,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:55,471 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:54:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 17:54:55,722 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:54:55,767 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:54:55,767 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:54:55,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:55,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 17:54:55,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:56,521 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:56,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 317 treesize of output 501 [2025-04-13 17:54:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:54:57,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:58,103 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:58,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 217 treesize of output 244 [2025-04-13 17:54:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:54:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600624652] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:58,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-13 17:54:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883110474] [2025-04-13 17:54:58,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:58,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:54:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:58,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:54:58,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:54:58,650 INFO L87 Difference]: Start difference. First operand 643 states and 2370 transitions. Second operand has 26 states, 25 states have (on average 3.04) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:05,598 INFO L93 Difference]: Finished difference Result 1630 states and 5453 transitions. [2025-04-13 17:55:05,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 17:55:05,598 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:55:05,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:05,604 INFO L225 Difference]: With dead ends: 1630 [2025-04-13 17:55:05,604 INFO L226 Difference]: Without dead ends: 1541 [2025-04-13 17:55:05,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1232, Invalid=6250, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 17:55:05,605 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:05,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 17:55:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-04-13 17:55:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 689. [2025-04-13 17:55:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 3.7718023255813953) internal successors, (2595), 688 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 2595 transitions. [2025-04-13 17:55:06,257 INFO L79 Accepts]: Start accepts. Automaton has 689 states and 2595 transitions. Word has length 38 [2025-04-13 17:55:06,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:06,258 INFO L485 AbstractCegarLoop]: Abstraction has 689 states and 2595 transitions. [2025-04-13 17:55:06,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.04) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:06,258 INFO L278 IsEmpty]: Start isEmpty. Operand 689 states and 2595 transitions. [2025-04-13 17:55:06,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:55:06,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:06,259 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:55:06,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 17:55:06,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:06,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 17:55:06,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1551609744, now seen corresponding path program 13 times [2025-04-13 17:55:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:06,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501028306] [2025-04-13 17:55:06,460 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:55:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:06,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:55:06,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:06,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:55:06,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:55:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:11,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501028306] [2025-04-13 17:55:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501028306] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:11,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515422188] [2025-04-13 17:55:11,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:55:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:11,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:55:11,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 17:55:11,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:55:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:11,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:55:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:11,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:55:11,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:12,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:12,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 340 treesize of output 524 [2025-04-13 17:55:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:55:13,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515422188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:14,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8, 7] total 41 [2025-04-13 17:55:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229053775] [2025-04-13 17:55:14,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:14,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:55:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:14,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:55:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1582, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:55:14,980 INFO L87 Difference]: Start difference. First operand 689 states and 2595 transitions. Second operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:25,126 INFO L93 Difference]: Finished difference Result 1439 states and 4908 transitions. [2025-04-13 17:55:25,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 17:55:25,127 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:55:25,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:25,131 INFO L225 Difference]: With dead ends: 1439 [2025-04-13 17:55:25,131 INFO L226 Difference]: Without dead ends: 1327 [2025-04-13 17:55:25,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3083 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=932, Invalid=9988, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 17:55:25,132 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 346 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4664 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:25,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 0 Invalid, 4711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4664 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 17:55:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-04-13 17:55:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 691. [2025-04-13 17:55:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 3.714492753623188) internal successors, (2563), 690 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 2563 transitions. [2025-04-13 17:55:25,849 INFO L79 Accepts]: Start accepts. Automaton has 691 states and 2563 transitions. Word has length 38 [2025-04-13 17:55:25,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:25,849 INFO L485 AbstractCegarLoop]: Abstraction has 691 states and 2563 transitions. [2025-04-13 17:55:25,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:25,849 INFO L278 IsEmpty]: Start isEmpty. Operand 691 states and 2563 transitions. [2025-04-13 17:55:25,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:55:25,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:25,850 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:55:25,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 17:55:26,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:26,051 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 17:55:26,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1348899246, now seen corresponding path program 14 times [2025-04-13 17:55:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:26,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988263471] [2025-04-13 17:55:26,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:55:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:26,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:55:26,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:26,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:55:26,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:55:29,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:29,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988263471] [2025-04-13 17:55:29,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988263471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:29,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460306327] [2025-04-13 17:55:29,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:55:29,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:29,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:29,725 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:55:29,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 17:55:29,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:55:30,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:30,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:55:30,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:30,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:55:30,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:30,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:30,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 277 treesize of output 285 [2025-04-13 17:55:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:31,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:32,523 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:32,524 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 280 treesize of output 404 [2025-04-13 17:55:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460306327] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:33,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 7] total 35 [2025-04-13 17:55:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497735556] [2025-04-13 17:55:33,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:33,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:55:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:33,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:55:33,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:55:33,346 INFO L87 Difference]: Start difference. First operand 691 states and 2563 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:37,718 INFO L93 Difference]: Finished difference Result 1045 states and 3617 transitions. [2025-04-13 17:55:37,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:55:37,718 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:55:37,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:37,722 INFO L225 Difference]: With dead ends: 1045 [2025-04-13 17:55:37,722 INFO L226 Difference]: Without dead ends: 947 [2025-04-13 17:55:37,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=386, Invalid=2920, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:55:37,723 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:37,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:55:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-04-13 17:55:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 732. [2025-04-13 17:55:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.7181942544459643) internal successors, (2718), 731 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2718 transitions. [2025-04-13 17:55:38,534 INFO L79 Accepts]: Start accepts. Automaton has 732 states and 2718 transitions. Word has length 38 [2025-04-13 17:55:38,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:38,534 INFO L485 AbstractCegarLoop]: Abstraction has 732 states and 2718 transitions. [2025-04-13 17:55:38,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 36 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:38,534 INFO L278 IsEmpty]: Start isEmpty. Operand 732 states and 2718 transitions. [2025-04-13 17:55:38,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:55:38,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:38,535 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:55:38,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 17:55:38,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 17:55:38,736 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 17:55:38,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 895256784, now seen corresponding path program 15 times [2025-04-13 17:55:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:38,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827052476] [2025-04-13 17:55:38,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:55:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:38,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:55:38,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:55:38,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:55:38,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:55:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:41,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827052476] [2025-04-13 17:55:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827052476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:41,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237470942] [2025-04-13 17:55:41,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:55:41,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:41,357 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:55:41,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 17:55:41,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:55:41,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:55:41,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:55:41,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:41,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 17:55:41,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:42,304 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:42,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 282 treesize of output 290 [2025-04-13 17:55:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:42,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:43,744 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:43,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 226 treesize of output 259 [2025-04-13 17:55:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237470942] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:44,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 25 [2025-04-13 17:55:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934284343] [2025-04-13 17:55:44,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:44,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:55:44,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:44,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:55:44,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:55:44,254 INFO L87 Difference]: Start difference. First operand 732 states and 2718 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:48,968 INFO L93 Difference]: Finished difference Result 1272 states and 4228 transitions. [2025-04-13 17:55:48,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:55:48,968 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:55:48,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:48,972 INFO L225 Difference]: With dead ends: 1272 [2025-04-13 17:55:48,972 INFO L226 Difference]: Without dead ends: 1187 [2025-04-13 17:55:48,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=507, Invalid=2249, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:55:48,973 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 342 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:48,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 0 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:55:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-04-13 17:55:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 701. [2025-04-13 17:55:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 3.7071428571428573) internal successors, (2595), 700 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 2595 transitions. [2025-04-13 17:55:49,749 INFO L79 Accepts]: Start accepts. Automaton has 701 states and 2595 transitions. Word has length 38 [2025-04-13 17:55:49,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:49,749 INFO L485 AbstractCegarLoop]: Abstraction has 701 states and 2595 transitions. [2025-04-13 17:55:49,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:49,749 INFO L278 IsEmpty]: Start isEmpty. Operand 701 states and 2595 transitions. [2025-04-13 17:55:49,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:55:49,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:49,750 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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 17:55:49,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 17:55:49,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:49,951 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:55:49,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 122507594, now seen corresponding path program 16 times [2025-04-13 17:55:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:49,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803928919] [2025-04-13 17:55:49,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:55:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:49,968 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:55:50,085 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:50,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:55:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:55:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:54,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803928919] [2025-04-13 17:55:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803928919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:54,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113693953] [2025-04-13 17:55:54,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:55:54,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:54,015 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:55:54,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 17:55:54,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:55:54,344 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:55:54,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:55:54,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:54,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 17:55:54,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:55,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:55,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 262 treesize of output 466 [2025-04-13 17:55:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:56,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:56,913 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:56,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 277 treesize of output 286 [2025-04-13 17:55:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:55:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113693953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:57,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 7, 7] total 36 [2025-04-13 17:55:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702656535] [2025-04-13 17:55:57,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:57,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:55:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:57,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:55:57,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:55:57,506 INFO L87 Difference]: Start difference. First operand 701 states and 2595 transitions. Second operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:02,918 INFO L93 Difference]: Finished difference Result 1210 states and 4084 transitions. [2025-04-13 17:56:02,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:56:02,918 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:56:02,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:02,922 INFO L225 Difference]: With dead ends: 1210 [2025-04-13 17:56:02,922 INFO L226 Difference]: Without dead ends: 1153 [2025-04-13 17:56:02,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=661, Invalid=4595, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:56:02,922 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:02,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 17:56:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-04-13 17:56:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 673. [2025-04-13 17:56:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 3.644345238095238) internal successors, (2449), 672 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 2449 transitions. [2025-04-13 17:56:03,673 INFO L79 Accepts]: Start accepts. Automaton has 673 states and 2449 transitions. Word has length 38 [2025-04-13 17:56:03,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:03,674 INFO L485 AbstractCegarLoop]: Abstraction has 673 states and 2449 transitions. [2025-04-13 17:56:03,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:03,674 INFO L278 IsEmpty]: Start isEmpty. Operand 673 states and 2449 transitions. [2025-04-13 17:56:03,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:56:03,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:03,675 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:56:03,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 17:56:03,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:03,875 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:56:03,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash -267858634, now seen corresponding path program 17 times [2025-04-13 17:56:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:03,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295222811] [2025-04-13 17:56:03,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:56:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:03,895 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:56:04,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:04,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:56:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:56:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:05,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295222811] [2025-04-13 17:56:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295222811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:05,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383019586] [2025-04-13 17:56:05,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:56:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:05,917 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:56:05,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 17:56:06,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:56:06,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:06,443 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:56:06,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:56:06,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:06,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:08,191 INFO L325 Elim1Store]: treesize reduction 13, result has 92.3 percent of original size [2025-04-13 17:56:08,192 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 75 treesize of output 198 [2025-04-13 17:56:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383019586] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:08,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 38 [2025-04-13 17:56:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443023516] [2025-04-13 17:56:08,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:08,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 17:56:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 17:56:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:56:08,432 INFO L87 Difference]: Start difference. First operand 673 states and 2449 transitions. Second operand has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:16,055 INFO L93 Difference]: Finished difference Result 1100 states and 3804 transitions. [2025-04-13 17:56:16,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 17:56:16,055 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 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 39 [2025-04-13 17:56:16,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:16,058 INFO L225 Difference]: With dead ends: 1100 [2025-04-13 17:56:16,058 INFO L226 Difference]: Without dead ends: 1057 [2025-04-13 17:56:16,059 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1679, Invalid=8827, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 17:56:16,059 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4142 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:16,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 0 Invalid, 4171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4142 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 17:56:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-04-13 17:56:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 636. [2025-04-13 17:56:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.6818897637795276) internal successors, (2338), 635 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2338 transitions. [2025-04-13 17:56:16,837 INFO L79 Accepts]: Start accepts. Automaton has 636 states and 2338 transitions. Word has length 39 [2025-04-13 17:56:16,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:16,837 INFO L485 AbstractCegarLoop]: Abstraction has 636 states and 2338 transitions. [2025-04-13 17:56:16,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:16,837 INFO L278 IsEmpty]: Start isEmpty. Operand 636 states and 2338 transitions. [2025-04-13 17:56:16,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:56:16,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:16,838 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:56:16,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 17:56:17,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:17,038 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:56:17,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1545154264, now seen corresponding path program 18 times [2025-04-13 17:56:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:17,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817291757] [2025-04-13 17:56:17,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:56:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:17,058 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:56:17,150 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-04-13 17:56:17,151 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:56:17,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:56:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:18,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817291757] [2025-04-13 17:56:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817291757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:18,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156775186] [2025-04-13 17:56:18,310 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:56:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:18,312 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:56:18,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 17:56:18,618 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:56:18,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-04-13 17:56:18,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:56:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:18,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:56:18,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:19,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:56:19,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 183 treesize of output 195 [2025-04-13 17:56:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:19,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:20,898 INFO L325 Elim1Store]: treesize reduction 13, result has 92.3 percent of original size [2025-04-13 17:56:20,898 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 75 treesize of output 198 [2025-04-13 17:56:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156775186] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:21,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 29 [2025-04-13 17:56:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779703327] [2025-04-13 17:56:21,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:21,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:56:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:21,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:56:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:56:21,027 INFO L87 Difference]: Start difference. First operand 636 states and 2338 transitions. Second operand has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:30,284 INFO L93 Difference]: Finished difference Result 1288 states and 4525 transitions. [2025-04-13 17:56:30,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 17:56:30,285 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 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 39 [2025-04-13 17:56:30,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:30,288 INFO L225 Difference]: With dead ends: 1288 [2025-04-13 17:56:30,289 INFO L226 Difference]: Without dead ends: 1227 [2025-04-13 17:56:30,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1404, Invalid=6252, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 17:56:30,289 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:30,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 3445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 17:56:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-04-13 17:56:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 702. [2025-04-13 17:56:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 3.734664764621969) internal successors, (2618), 701 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 2618 transitions. [2025-04-13 17:56:31,200 INFO L79 Accepts]: Start accepts. Automaton has 702 states and 2618 transitions. Word has length 39 [2025-04-13 17:56:31,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:31,200 INFO L485 AbstractCegarLoop]: Abstraction has 702 states and 2618 transitions. [2025-04-13 17:56:31,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:31,200 INFO L278 IsEmpty]: Start isEmpty. Operand 702 states and 2618 transitions. [2025-04-13 17:56:31,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:56:31,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:31,201 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:56:31,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 17:56:31,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 17:56:31,402 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:56:31,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1175926560, now seen corresponding path program 19 times [2025-04-13 17:56:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:31,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764521955] [2025-04-13 17:56:31,402 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:56:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:31,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:56:31,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:31,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:56:31,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:56:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:34,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764521955] [2025-04-13 17:56:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764521955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:34,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239161073] [2025-04-13 17:56:34,999 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:56:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:35,001 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:56:35,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 17:56:35,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:56:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:35,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:56:35,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:35,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:56:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:35,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:56:35,574 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 60 treesize of output 52 [2025-04-13 17:56:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:56:35,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:36,501 INFO L325 Elim1Store]: treesize reduction 5, result has 92.6 percent of original size [2025-04-13 17:56:36,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 86 [2025-04-13 17:56:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:56:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239161073] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:36,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 7, 7] total 35 [2025-04-13 17:56:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714276788] [2025-04-13 17:56:36,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:36,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:56:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:36,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:56:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:56:36,539 INFO L87 Difference]: Start difference. First operand 702 states and 2618 transitions. Second operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:43,207 INFO L93 Difference]: Finished difference Result 1191 states and 4294 transitions. [2025-04-13 17:56:43,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:56:43,207 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:56:43,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:43,211 INFO L225 Difference]: With dead ends: 1191 [2025-04-13 17:56:43,211 INFO L226 Difference]: Without dead ends: 1163 [2025-04-13 17:56:43,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=726, Invalid=4824, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 17:56:43,212 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:43,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 17:56:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-04-13 17:56:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 668. [2025-04-13 17:56:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 3.689655172413793) internal successors, (2461), 667 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 2461 transitions. [2025-04-13 17:56:44,103 INFO L79 Accepts]: Start accepts. Automaton has 668 states and 2461 transitions. Word has length 39 [2025-04-13 17:56:44,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:44,103 INFO L485 AbstractCegarLoop]: Abstraction has 668 states and 2461 transitions. [2025-04-13 17:56:44,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:44,103 INFO L278 IsEmpty]: Start isEmpty. Operand 668 states and 2461 transitions. [2025-04-13 17:56:44,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:56:44,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:44,104 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:56:44,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 17:56:44,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 17:56:44,305 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:56:44,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2077035926, now seen corresponding path program 20 times [2025-04-13 17:56:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:44,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469498069] [2025-04-13 17:56:44,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:56:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:44,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:56:44,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:44,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:56:44,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:56:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:48,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469498069] [2025-04-13 17:56:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469498069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:48,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672936008] [2025-04-13 17:56:48,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:56:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:48,793 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:56:48,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 17:56:49,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:56:49,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:56:49,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:56:49,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:49,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 17:56:49,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:50,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:56:50,561 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 256 treesize of output 376 [2025-04-13 17:56:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:51,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:52,529 INFO L325 Elim1Store]: treesize reduction 17, result has 75.0 percent of original size [2025-04-13 17:56:52,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 73 [2025-04-13 17:56:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:56:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672936008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:52,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 10] total 45 [2025-04-13 17:56:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902063512] [2025-04-13 17:56:52,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:52,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 17:56:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:52,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 17:56:52,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:56:52,585 INFO L87 Difference]: Start difference. First operand 668 states and 2461 transitions. Second operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:57:08,025 INFO L93 Difference]: Finished difference Result 1440 states and 5077 transitions. [2025-04-13 17:57:08,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 17:57:08,026 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 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 39 [2025-04-13 17:57:08,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:57:08,030 INFO L225 Difference]: With dead ends: 1440 [2025-04-13 17:57:08,030 INFO L226 Difference]: Without dead ends: 1432 [2025-04-13 17:57:08,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3016 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1835, Invalid=11737, Unknown=0, NotChecked=0, Total=13572 [2025-04-13 17:57:08,031 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 525 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:57:08,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 0 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 17:57:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-04-13 17:57:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 676. [2025-04-13 17:57:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.7111111111111112) internal successors, (2505), 675 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2505 transitions. [2025-04-13 17:57:08,972 INFO L79 Accepts]: Start accepts. Automaton has 676 states and 2505 transitions. Word has length 39 [2025-04-13 17:57:08,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:57:08,972 INFO L485 AbstractCegarLoop]: Abstraction has 676 states and 2505 transitions. [2025-04-13 17:57:08,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:08,972 INFO L278 IsEmpty]: Start isEmpty. Operand 676 states and 2505 transitions. [2025-04-13 17:57:08,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:57:08,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:57:08,973 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:57:08,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 17:57:09,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:09,174 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:57:09,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:57:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1021473644, now seen corresponding path program 21 times [2025-04-13 17:57:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:57:09,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123641458] [2025-04-13 17:57:09,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:57:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:57:09,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:57:09,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-04-13 17:57:09,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:57:09,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:57:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:57:11,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123641458] [2025-04-13 17:57:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123641458] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:57:11,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199355952] [2025-04-13 17:57:11,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:57:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:57:11,291 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:57:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 17:57:11,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:57:11,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-04-13 17:57:11,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:57:11,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:11,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-13 17:57:11,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:57:13,009 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:57:13,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 289 treesize of output 305 [2025-04-13 17:57:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:57:13,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:57:14,985 INFO L325 Elim1Store]: treesize reduction 44, result has 61.1 percent of original size [2025-04-13 17:57:14,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 97 [2025-04-13 17:57:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:57:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199355952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:57:15,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:57:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 17:57:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543563814] [2025-04-13 17:57:15,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:57:15,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:57:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:57:15,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:57:15,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:57:15,076 INFO L87 Difference]: Start difference. First operand 676 states and 2505 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 35 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:57:34,511 INFO L93 Difference]: Finished difference Result 2069 states and 6452 transitions. [2025-04-13 17:57:34,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-04-13 17:57:34,511 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 35 states have internal predecessors, (73), 0 states have call successors, (0), 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 39 [2025-04-13 17:57:34,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:57:34,516 INFO L225 Difference]: With dead ends: 2069 [2025-04-13 17:57:34,516 INFO L226 Difference]: Without dead ends: 2054 [2025-04-13 17:57:34,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6917 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3332, Invalid=16128, Unknown=0, NotChecked=0, Total=19460 [2025-04-13 17:57:34,517 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 862 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:57:34,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 0 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 17:57:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2025-04-13 17:57:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 676. [2025-04-13 17:57:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.7111111111111112) internal successors, (2505), 675 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2505 transitions. [2025-04-13 17:57:35,524 INFO L79 Accepts]: Start accepts. Automaton has 676 states and 2505 transitions. Word has length 39 [2025-04-13 17:57:35,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:57:35,524 INFO L485 AbstractCegarLoop]: Abstraction has 676 states and 2505 transitions. [2025-04-13 17:57:35,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 35 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:35,525 INFO L278 IsEmpty]: Start isEmpty. Operand 676 states and 2505 transitions. [2025-04-13 17:57:35,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:57:35,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:57:35,526 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:57:35,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 17:57:35,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:35,726 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:57:35,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:57:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 332955088, now seen corresponding path program 22 times [2025-04-13 17:57:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:57:35,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181861713] [2025-04-13 17:57:35,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:57:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:57:35,746 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:57:35,905 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:57:35,906 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:57:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 17:57:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:57:38,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181861713] [2025-04-13 17:57:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181861713] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:57:38,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982820515] [2025-04-13 17:57:38,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:57:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:57:38,176 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:57:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 17:57:38,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:57:38,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:57:38,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:57:38,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:38,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:57:38,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:57:39,305 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:57:39,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 182 treesize of output 214 [2025-04-13 17:57:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:57:39,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:57:40,818 INFO L325 Elim1Store]: treesize reduction 13, result has 92.4 percent of original size [2025-04-13 17:57:40,818 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 75 treesize of output 201 [2025-04-13 17:57:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:57:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982820515] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:57:41,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:57:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 36 [2025-04-13 17:57:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348198357] [2025-04-13 17:57:41,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:57:41,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:57:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:57:41,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:57:41,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:57:41,014 INFO L87 Difference]: Start difference. First operand 676 states and 2505 transitions. Second operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:57:50,297 INFO L93 Difference]: Finished difference Result 1137 states and 4032 transitions. [2025-04-13 17:57:50,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 17:57:50,297 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:57:50,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:57:50,300 INFO L225 Difference]: With dead ends: 1137 [2025-04-13 17:57:50,300 INFO L226 Difference]: Without dead ends: 1087 [2025-04-13 17:57:50,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1395, Invalid=8111, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 17:57:50,301 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:57:50,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 17:57:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-04-13 17:57:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 622. [2025-04-13 17:57:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 3.65378421900161) internal successors, (2269), 621 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 2269 transitions. [2025-04-13 17:57:51,250 INFO L79 Accepts]: Start accepts. Automaton has 622 states and 2269 transitions. Word has length 39 [2025-04-13 17:57:51,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:57:51,251 INFO L485 AbstractCegarLoop]: Abstraction has 622 states and 2269 transitions. [2025-04-13 17:57:51,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:57:51,251 INFO L278 IsEmpty]: Start isEmpty. Operand 622 states and 2269 transitions. [2025-04-13 17:57:51,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:57:51,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:57:51,252 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:57:51,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 17:57:51,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:51,452 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:57:51,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:57:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -842484000, now seen corresponding path program 23 times [2025-04-13 17:57:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:57:51,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800846729] [2025-04-13 17:57:51,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:57:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:57:51,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:57:51,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:57:51,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:57:51,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 17:57:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:57:55,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800846729] [2025-04-13 17:57:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800846729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:57:55,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266263571] [2025-04-13 17:57:55,235 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:57:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:57:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:57:55,237 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:57:55,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 17:57:55,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:57:55,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:57:55,861 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:57:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:57:55,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:57:55,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:57:56,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:57:56,483 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 132 treesize of output 280 [2025-04-13 17:57:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:57:56,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:57:57,210 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:57:57,210 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 194 treesize of output 186 [2025-04-13 17:57:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:57:57,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266263571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:57:57,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:57:57,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8, 7] total 34 [2025-04-13 17:57:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069087809] [2025-04-13 17:57:57,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:57:57,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:57:57,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:57:57,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:57:57,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:57:57,775 INFO L87 Difference]: Start difference. First operand 622 states and 2269 transitions. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:58:02,962 INFO L93 Difference]: Finished difference Result 909 states and 3115 transitions. [2025-04-13 17:58:02,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 17:58:02,962 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 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 39 [2025-04-13 17:58:02,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:58:02,965 INFO L225 Difference]: With dead ends: 909 [2025-04-13 17:58:02,965 INFO L226 Difference]: Without dead ends: 886 [2025-04-13 17:58:02,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=761, Invalid=4641, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 17:58:02,965 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:02,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:58:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-04-13 17:58:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 570. [2025-04-13 17:58:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.6045694200351495) internal successors, (2051), 569 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 2051 transitions. [2025-04-13 17:58:03,839 INFO L79 Accepts]: Start accepts. Automaton has 570 states and 2051 transitions. Word has length 39 [2025-04-13 17:58:03,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:58:03,839 INFO L485 AbstractCegarLoop]: Abstraction has 570 states and 2051 transitions. [2025-04-13 17:58:03,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:03,839 INFO L278 IsEmpty]: Start isEmpty. Operand 570 states and 2051 transitions. [2025-04-13 17:58:03,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:58:03,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:58:03,840 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:58:03,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 17:58:04,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 17:58:04,041 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:58:04,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:58:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 376049432, now seen corresponding path program 24 times [2025-04-13 17:58:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:58:04,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16730562] [2025-04-13 17:58:04,041 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:58:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:58:04,060 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:58:04,158 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-04-13 17:58:04,159 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:58:04,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:58:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:58:06,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16730562] [2025-04-13 17:58:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16730562] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:58:06,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900174827] [2025-04-13 17:58:06,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:58:06,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:58:06,596 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:58:06,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 17:58:06,959 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:58:07,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-04-13 17:58:07,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:58:07,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:07,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:58:07,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:58:07,244 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:07,244 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 183 treesize of output 167 [2025-04-13 17:58:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:07,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:58:08,380 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:08,380 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 97 treesize of output 233 [2025-04-13 17:58:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900174827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:58:08,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:58:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 26 [2025-04-13 17:58:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145786958] [2025-04-13 17:58:08,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:58:08,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:58:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:58:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:58:08,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:58:08,577 INFO L87 Difference]: Start difference. First operand 570 states and 2051 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:58:13,572 INFO L93 Difference]: Finished difference Result 923 states and 3102 transitions. [2025-04-13 17:58:13,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:58:13,573 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:58:13,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:58:13,575 INFO L225 Difference]: With dead ends: 923 [2025-04-13 17:58:13,575 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 17:58:13,575 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=3030, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:58:13,576 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:13,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:58:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 17:58:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 634. [2025-04-13 17:58:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.6350710900473935) internal successors, (2301), 633 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2301 transitions. [2025-04-13 17:58:14,587 INFO L79 Accepts]: Start accepts. Automaton has 634 states and 2301 transitions. Word has length 39 [2025-04-13 17:58:14,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:58:14,587 INFO L485 AbstractCegarLoop]: Abstraction has 634 states and 2301 transitions. [2025-04-13 17:58:14,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 27 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:14,587 INFO L278 IsEmpty]: Start isEmpty. Operand 634 states and 2301 transitions. [2025-04-13 17:58:14,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:58:14,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:58:14,588 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:58:14,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 17:58:14,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 17:58:14,789 INFO L403 AbstractCegarLoop]: === Iteration 46 === 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 17:58:14,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:58:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash -536010288, now seen corresponding path program 25 times [2025-04-13 17:58:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:58:14,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10181947] [2025-04-13 17:58:14,789 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:58:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:58:14,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:58:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:58:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:58:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:58:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:58:17,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10181947] [2025-04-13 17:58:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10181947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:58:17,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360055531] [2025-04-13 17:58:17,544 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:58:17,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:17,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:58:17,546 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:58:17,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 17:58:17,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:58:17,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:58:17,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:58:17,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:17,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:58:17,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:58:18,172 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:18,173 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 60 treesize of output 52 [2025-04-13 17:58:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:18,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:58:19,251 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:19,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 125 treesize of output 319 [2025-04-13 17:58:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360055531] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:58:19,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:58:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 36 [2025-04-13 17:58:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56382179] [2025-04-13 17:58:19,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:58:19,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:58:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:58:19,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:58:19,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:58:19,557 INFO L87 Difference]: Start difference. First operand 634 states and 2301 transitions. Second operand has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:58:25,050 INFO L93 Difference]: Finished difference Result 970 states and 3281 transitions. [2025-04-13 17:58:25,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:58:25,051 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 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 39 [2025-04-13 17:58:25,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:58:25,053 INFO L225 Difference]: With dead ends: 970 [2025-04-13 17:58:25,053 INFO L226 Difference]: Without dead ends: 897 [2025-04-13 17:58:25,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=610, Invalid=4082, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:58:25,054 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:25,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 17:58:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-04-13 17:58:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 620. [2025-04-13 17:58:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 3.625201938610662) internal successors, (2244), 619 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 2244 transitions. [2025-04-13 17:58:26,065 INFO L79 Accepts]: Start accepts. Automaton has 620 states and 2244 transitions. Word has length 39 [2025-04-13 17:58:26,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:58:26,065 INFO L485 AbstractCegarLoop]: Abstraction has 620 states and 2244 transitions. [2025-04-13 17:58:26,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:26,065 INFO L278 IsEmpty]: Start isEmpty. Operand 620 states and 2244 transitions. [2025-04-13 17:58:26,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:58:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:58:26,066 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:58:26,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 17:58:26,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 17:58:26,267 INFO L403 AbstractCegarLoop]: === Iteration 47 === 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 17:58:26,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:58:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1462986056, now seen corresponding path program 26 times [2025-04-13 17:58:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:58:26,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802621602] [2025-04-13 17:58:26,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:58:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:58:26,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:58:26,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:58:26,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:58:26,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:58:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:58:31,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802621602] [2025-04-13 17:58:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802621602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:58:31,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815027249] [2025-04-13 17:58:31,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:58:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:58:31,461 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:58:31,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 17:58:31,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:58:31,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:58:31,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:58:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:31,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 17:58:31,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:58:32,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:32,272 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 183 treesize of output 167 [2025-04-13 17:58:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:32,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:58:33,554 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:33,555 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 112 treesize of output 242 [2025-04-13 17:58:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815027249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:58:33,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:58:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 7] total 42 [2025-04-13 17:58:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166438574] [2025-04-13 17:58:33,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:58:33,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:58:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:58:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:58:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:58:33,694 INFO L87 Difference]: Start difference. First operand 620 states and 2244 transitions. Second operand has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:58:42,291 INFO L93 Difference]: Finished difference Result 1132 states and 3940 transitions. [2025-04-13 17:58:42,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 17:58:42,291 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 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 39 [2025-04-13 17:58:42,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:58:42,294 INFO L225 Difference]: With dead ends: 1132 [2025-04-13 17:58:42,294 INFO L226 Difference]: Without dead ends: 1092 [2025-04-13 17:58:42,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=837, Invalid=6645, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 17:58:42,295 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:42,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 17:58:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-04-13 17:58:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 548. [2025-04-13 17:58:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 3.590493601462523) internal successors, (1964), 547 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1964 transitions. [2025-04-13 17:58:43,204 INFO L79 Accepts]: Start accepts. Automaton has 548 states and 1964 transitions. Word has length 39 [2025-04-13 17:58:43,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:58:43,205 INFO L485 AbstractCegarLoop]: Abstraction has 548 states and 1964 transitions. [2025-04-13 17:58:43,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:43,205 INFO L278 IsEmpty]: Start isEmpty. Operand 548 states and 1964 transitions. [2025-04-13 17:58:43,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:58:43,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:58:43,206 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:58:43,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 17:58:43,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:43,406 INFO L403 AbstractCegarLoop]: === Iteration 48 === 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 17:58:43,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:58:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 117457878, now seen corresponding path program 27 times [2025-04-13 17:58:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:58:43,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200793269] [2025-04-13 17:58:43,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:58:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:58:43,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:58:43,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-04-13 17:58:43,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:58:43,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:58:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:58:44,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200793269] [2025-04-13 17:58:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200793269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:58:44,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866078074] [2025-04-13 17:58:44,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:58:44,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:58:44,912 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:58:44,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 17:58:45,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:58:45,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-04-13 17:58:45,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:58:45,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:45,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 17:58:45,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:58:46,757 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:46,758 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 275 treesize of output 543 [2025-04-13 17:58:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:58:47,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:58:49,493 INFO L325 Elim1Store]: treesize reduction 5, result has 97.0 percent of original size [2025-04-13 17:58:49,494 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 62 treesize of output 198 [2025-04-13 17:58:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:58:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866078074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:58:56,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:58:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 29 [2025-04-13 17:58:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4720149] [2025-04-13 17:58:56,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:58:56,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:58:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:58:56,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:58:56,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:58:56,222 INFO L87 Difference]: Start difference. First operand 548 states and 1964 transitions. Second operand has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:59:10,780 INFO L93 Difference]: Finished difference Result 1180 states and 4047 transitions. [2025-04-13 17:59:10,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 17:59:10,781 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 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 39 [2025-04-13 17:59:10,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:59:10,784 INFO L225 Difference]: With dead ends: 1180 [2025-04-13 17:59:10,784 INFO L226 Difference]: Without dead ends: 1088 [2025-04-13 17:59:10,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1753, Invalid=7367, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 17:59:10,786 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:59:10,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-04-13 17:59:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-04-13 17:59:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 550. [2025-04-13 17:59:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.6484517304189437) internal successors, (2003), 549 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 2003 transitions. [2025-04-13 17:59:11,808 INFO L79 Accepts]: Start accepts. Automaton has 550 states and 2003 transitions. Word has length 39 [2025-04-13 17:59:11,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:59:11,808 INFO L485 AbstractCegarLoop]: Abstraction has 550 states and 2003 transitions. [2025-04-13 17:59:11,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:11,809 INFO L278 IsEmpty]: Start isEmpty. Operand 550 states and 2003 transitions. [2025-04-13 17:59:11,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:59:11,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:59:11,809 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:59:11,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 17:59:12,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 17:59:12,010 INFO L403 AbstractCegarLoop]: === Iteration 49 === 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 17:59:12,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:59:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1414921210, now seen corresponding path program 28 times [2025-04-13 17:59:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:59:12,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226776318] [2025-04-13 17:59:12,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:59:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:59:12,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:59:12,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:12,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:59:12,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:59:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:59:16,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226776318] [2025-04-13 17:59:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226776318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:59:16,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767868616] [2025-04-13 17:59:16,231 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:59:16,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:59:16,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:59:16,233 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:59:16,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 17:59:16,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:59:16,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:16,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:59:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 17:59:16,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:59:17,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:17,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 233 [2025-04-13 17:59:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:17,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:59:18,634 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 17:59:18,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 177 [2025-04-13 17:59:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767868616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:59:18,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:59:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 42 [2025-04-13 17:59:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332037322] [2025-04-13 17:59:18,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:59:18,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:59:18,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:59:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:59:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:59:18,951 INFO L87 Difference]: Start difference. First operand 550 states and 2003 transitions. Second operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:59:30,538 INFO L93 Difference]: Finished difference Result 2373 states and 8093 transitions. [2025-04-13 17:59:30,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:59:30,539 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:59:30,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:59:30,544 INFO L225 Difference]: With dead ends: 2373 [2025-04-13 17:59:30,544 INFO L226 Difference]: Without dead ends: 2321 [2025-04-13 17:59:30,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=729, Invalid=5751, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 17:59:30,545 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 415 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:59:30,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 0 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 17:59:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-04-13 17:59:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 558. [2025-04-13 17:59:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.63016157989228) internal successors, (2022), 557 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 2022 transitions. [2025-04-13 17:59:31,571 INFO L79 Accepts]: Start accepts. Automaton has 558 states and 2022 transitions. Word has length 39 [2025-04-13 17:59:31,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:59:31,571 INFO L485 AbstractCegarLoop]: Abstraction has 558 states and 2022 transitions. [2025-04-13 17:59:31,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:31,571 INFO L278 IsEmpty]: Start isEmpty. Operand 558 states and 2022 transitions. [2025-04-13 17:59:31,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:59:31,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:59:31,572 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:59:31,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 17:59:31,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 17:59:31,773 INFO L403 AbstractCegarLoop]: === Iteration 50 === 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 17:59:31,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:59:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -787649348, now seen corresponding path program 29 times [2025-04-13 17:59:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:59:31,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569616622] [2025-04-13 17:59:31,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:59:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:59:31,793 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:59:31,905 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:31,905 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:59:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:59:33,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:59:33,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569616622] [2025-04-13 17:59:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569616622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:59:33,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560907543] [2025-04-13 17:59:33,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:59:33,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:59:33,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:59:33,084 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:59:33,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 17:59:33,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:59:33,700 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:33,700 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:59:33,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:33,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 17:59:33,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:59:34,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:34,289 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 147 treesize of output 287 [2025-04-13 17:59:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:34,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:59:34,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:34,918 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 194 treesize of output 186 [2025-04-13 17:59:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:59:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560907543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:59:35,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:59:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 21 [2025-04-13 17:59:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076573397] [2025-04-13 17:59:35,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:59:35,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:59:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:59:35,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:59:35,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:59:35,313 INFO L87 Difference]: Start difference. First operand 558 states and 2022 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:59:38,618 INFO L93 Difference]: Finished difference Result 753 states and 2583 transitions. [2025-04-13 17:59:38,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:59:38,619 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 39 [2025-04-13 17:59:38,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:59:38,621 INFO L225 Difference]: With dead ends: 753 [2025-04-13 17:59:38,621 INFO L226 Difference]: Without dead ends: 722 [2025-04-13 17:59:38,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:59:38,621 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:59:38,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:59:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-04-13 17:59:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 580. [2025-04-13 17:59:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 3.621761658031088) internal successors, (2097), 579 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 2097 transitions. [2025-04-13 17:59:39,681 INFO L79 Accepts]: Start accepts. Automaton has 580 states and 2097 transitions. Word has length 39 [2025-04-13 17:59:39,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:59:39,681 INFO L485 AbstractCegarLoop]: Abstraction has 580 states and 2097 transitions. [2025-04-13 17:59:39,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:39,681 INFO L278 IsEmpty]: Start isEmpty. Operand 580 states and 2097 transitions. [2025-04-13 17:59:39,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:59:39,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:59:39,682 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:59:39,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 17:59:39,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 17:59:39,883 INFO L403 AbstractCegarLoop]: === Iteration 51 === 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 17:59:39,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:59:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1805984036, now seen corresponding path program 30 times [2025-04-13 17:59:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:59:39,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128435408] [2025-04-13 17:59:39,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:59:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:59:39,904 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:59:40,049 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:40,049 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:59:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:59:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:59:42,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128435408] [2025-04-13 17:59:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128435408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:59:42,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073445201] [2025-04-13 17:59:42,759 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:59:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:59:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:59:42,760 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:59:42,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 17:59:43,176 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-04-13 17:59:43,260 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:43,261 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:59:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:43,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 17:59:43,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:59:44,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:44,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 131 treesize of output 151 [2025-04-13 17:59:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:44,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:59:45,360 INFO L325 Elim1Store]: treesize reduction 13, result has 88.5 percent of original size [2025-04-13 17:59:45,360 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 212 treesize of output 263 [2025-04-13 17:59:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073445201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:59:45,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:59:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 10] total 39 [2025-04-13 17:59:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152488488] [2025-04-13 17:59:45,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:59:45,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:59:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:59:45,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:59:45,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:59:45,753 INFO L87 Difference]: Start difference. First operand 580 states and 2097 transitions. Second operand has 40 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:59:55,372 INFO L93 Difference]: Finished difference Result 1109 states and 3751 transitions. [2025-04-13 17:59:55,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 17:59:55,372 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 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 39 [2025-04-13 17:59:55,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:59:55,375 INFO L225 Difference]: With dead ends: 1109 [2025-04-13 17:59:55,375 INFO L226 Difference]: Without dead ends: 993 [2025-04-13 17:59:55,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2957 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1493, Invalid=9849, Unknown=0, NotChecked=0, Total=11342 [2025-04-13 17:59:55,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:59:55,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 17:59:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-04-13 17:59:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 600. [2025-04-13 17:59:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 3.624373956594324) internal successors, (2171), 599 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 2171 transitions. [2025-04-13 17:59:56,485 INFO L79 Accepts]: Start accepts. Automaton has 600 states and 2171 transitions. Word has length 39 [2025-04-13 17:59:56,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:59:56,485 INFO L485 AbstractCegarLoop]: Abstraction has 600 states and 2171 transitions. [2025-04-13 17:59:56,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:59:56,486 INFO L278 IsEmpty]: Start isEmpty. Operand 600 states and 2171 transitions. [2025-04-13 17:59:56,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:59:56,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:59:56,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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 17:59:56,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 17:59:56,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:59:56,687 INFO L403 AbstractCegarLoop]: === Iteration 52 === 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 17:59:56,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:59:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1844665260, now seen corresponding path program 31 times [2025-04-13 17:59:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:59:56,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77173811] [2025-04-13 17:59:56,687 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:59:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:59:56,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:59:56,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:56,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:59:56,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:59:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:59:58,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77173811] [2025-04-13 17:59:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77173811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:59:58,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312636599] [2025-04-13 17:59:58,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:59:58,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:59:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:59:58,048 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:59:58,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 17:59:58,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:59:58,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:59:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:59:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:59:58,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:59:58,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:59:58,751 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:58,751 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 183 treesize of output 167 [2025-04-13 17:59:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:59:59,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:59:59,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:59:59,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 105 [2025-04-13 17:59:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:59:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312636599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:59:59,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:59:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 17:59:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240706591] [2025-04-13 17:59:59,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:59:59,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:59:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:59:59,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:59:59,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:59:59,821 INFO L87 Difference]: Start difference. First operand 600 states and 2171 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:00:03,005 INFO L93 Difference]: Finished difference Result 768 states and 2700 transitions. [2025-04-13 18:00:03,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:00:03,006 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 18:00:03,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:00:03,008 INFO L225 Difference]: With dead ends: 768 [2025-04-13 18:00:03,008 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 18:00:03,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:00:03,009 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:03,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:00:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 18:00:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 630. [2025-04-13 18:00:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 3.659777424483307) internal successors, (2302), 629 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have 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:00:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 2302 transitions. [2025-04-13 18:00:04,242 INFO L79 Accepts]: Start accepts. Automaton has 630 states and 2302 transitions. Word has length 39 [2025-04-13 18:00:04,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:00:04,242 INFO L485 AbstractCegarLoop]: Abstraction has 630 states and 2302 transitions. [2025-04-13 18:00:04,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:00:04,242 INFO L278 IsEmpty]: Start isEmpty. Operand 630 states and 2302 transitions. [2025-04-13 18:00:04,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 18:00:04,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:00:04,244 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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:00:04,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:00:04,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-13 18:00:04,444 INFO L403 AbstractCegarLoop]: === Iteration 53 === 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:00:04,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:00:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 143331348, now seen corresponding path program 32 times [2025-04-13 18:00:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:00:04,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521975107] [2025-04-13 18:00:04,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:00:04,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 18:00:04,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 18:00:04,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:00:09,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:00:09,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521975107] [2025-04-13 18:00:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521975107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:00:09,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539598553] [2025-04-13 18:00:09,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:00:09,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:09,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:00:09,148 INFO L229 MonitoredProcess]: Starting monitored process 35 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:00:09,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:00:09,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 18:00:09,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 18:00:09,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:00:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:00:09,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 18:00:09,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:00:10,035 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:00:10,035 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 183 treesize of output 167 [2025-04-13 18:00:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 18:00:10,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:00:11,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:00:11,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 135 treesize of output 323 [2025-04-13 18:00:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 18:00:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539598553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:00:11,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:00:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 7] total 41 [2025-04-13 18:00:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517066708] [2025-04-13 18:00:11,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:00:11,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:00:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:00:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:00:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:00:11,765 INFO L87 Difference]: Start difference. First operand 630 states and 2302 transitions. Second operand has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 42 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:00:26,561 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 101 [2025-04-13 18:00:26,561 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 18:00:26,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 18:00:26,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1357, Invalid=9149, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 18:00:26,563 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 403 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4048 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:00:26,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 0 Invalid, 4134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4048 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 18:00:26,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:00:26,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:00:26,764 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:910) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:122) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:211) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1056) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:958) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:179) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:477) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2025-04-13 18:00:26,769 INFO L158 Benchmark]: Toolchain (without parser) took 602882.34ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 100.9MB in the beginning and 486.9MB in the end (delta: -386.0MB). Peak memory consumption was 660.2MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,769 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:00:26,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 82.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,769 INFO L158 Benchmark]: Boogie Preprocessor took 67.22ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,770 INFO L158 Benchmark]: RCFGBuilder took 1523.69ms. Allocated memory was 142.6MB in the beginning and 356.5MB in the end (delta: 213.9MB). Free memory was 73.8MB in the beginning and 303.3MB in the end (delta: -229.4MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,770 INFO L158 Benchmark]: TraceAbstraction took 600944.98ms. Allocated memory was 356.5MB in the beginning and 1.2GB in the end (delta: 834.7MB). Free memory was 303.3MB in the beginning and 486.9MB in the end (delta: -183.7MB). Peak memory consumption was 648.4MB. Max. memory is 8.0GB. [2025-04-13 18:00:26,770 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.13ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.18ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 82.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.22ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 73.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1523.69ms. Allocated memory was 142.6MB in the beginning and 356.5MB in the end (delta: 213.9MB). Free memory was 73.8MB in the beginning and 303.3MB in the end (delta: -229.4MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. * TraceAbstraction took 600944.98ms. Allocated memory was 356.5MB in the beginning and 1.2GB in the end (delta: 834.7MB). Free memory was 303.3MB in the beginning and 486.9MB in the end (delta: -183.7MB). Peak memory consumption was 648.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...