/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-chromosome-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:46:44,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:46:44,795 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:46:44,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:46:44,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:46:44,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:46:44,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:46:44,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:46:44,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:46:44,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:46:44,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:46:44,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:46:44,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:46:44,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:46:44,820 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:46:44,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:46:44,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:46:44,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:46:44,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:46:44,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:46:44,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:46:44,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:46:44,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:46:44,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:46:44,823 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:46:45,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:46:45,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:46:45,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:46:45,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:46:45,020 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:46:45,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 17:46:46,278 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c129a952/46e24d8d6e7645c2ad2364363098b32d/FLAG9b51352b1 [2025-04-13 17:46:46,466 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:46:46,467 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 17:46:46,472 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c129a952/46e24d8d6e7645c2ad2364363098b32d/FLAG9b51352b1 [2025-04-13 17:46:47,328 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c129a952/46e24d8d6e7645c2ad2364363098b32d [2025-04-13 17:46:47,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:46:47,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:46:47,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:46:47,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:46:47,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:46:47,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,336 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:46:47, skipping insertion in model container [2025-04-13 17:46:47,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:46:47,498 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-chromosome-subst.wvr.c[3136,3149] [2025-04-13 17:46:47,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:46:47,513 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:46:47,549 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-chromosome-subst.wvr.c[3136,3149] [2025-04-13 17:46:47,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:46:47,565 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:46:47,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47 WrapperNode [2025-04-13 17:46:47,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:46:47,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:46:47,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:46:47,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:46:47,570 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:46:47" (1/1) ... [2025-04-13 17:46:47,576 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:46:47" (1/1) ... [2025-04-13 17:46:47,600 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 253 [2025-04-13 17:46:47,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:46:47,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:46:47,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:46:47,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:46:47,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,632 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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:46:47,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:46:47,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:46:47,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:46:47,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:46:47,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (1/1) ... [2025-04-13 17:46:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:46:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:47,685 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:46:47,686 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:46:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:46:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:46:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:46:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:46:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:46:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 17:46:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 17:46:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:46:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:46:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:46:47,704 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:46:47,787 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:46:47,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:46:48,116 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:46:48,117 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:46:48,117 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:46:48,441 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:46:48,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:46:48 BoogieIcfgContainer [2025-04-13 17:46:48,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:46:48,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:46:48,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:46:48,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:46:48,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:46:47" (1/3) ... [2025-04-13 17:46:48,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf020b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:46:48, skipping insertion in model container [2025-04-13 17:46:48,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:47" (2/3) ... [2025-04-13 17:46:48,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf020b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:46:48, skipping insertion in model container [2025-04-13 17:46:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:46:48" (3/3) ... [2025-04-13 17:46:48,450 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-04-13 17:46:48,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:46:48,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 17:46:48,462 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:46:48,510 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 17:46:48,530 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 17:46:48,548 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:46:48,568 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:46:48,576 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;@5ce19fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:46:48,577 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:46:48,579 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:46:48,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:46:48,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:48,583 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:46:48,583 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:46:48,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1108492510, now seen corresponding path program 1 times [2025-04-13 17:46:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:48,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104992245] [2025-04-13 17:46:48,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:48,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:46:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:46:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:48,927 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:46:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:48,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104992245] [2025-04-13 17:46:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104992245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:46:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011126237] [2025-04-13 17:46:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:48,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:46:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:48,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:46:48,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:46:48,949 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 3.1041666666666665) internal successors, (298), 96 states have internal predecessors, (298), 0 states have call successors, (0), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:49,059 INFO L93 Difference]: Finished difference Result 195 states and 599 transitions. [2025-04-13 17:46:49,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:46:49,061 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:46:49,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:49,067 INFO L225 Difference]: With dead ends: 195 [2025-04-13 17:46:49,068 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 17:46:49,071 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:46:49,074 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:49,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 17:46:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-13 17:46:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 3.04040404040404) internal successors, (301), 99 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have 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:46:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 301 transitions. [2025-04-13 17:46:49,112 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 301 transitions. Word has length 20 [2025-04-13 17:46:49,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:49,113 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 301 transitions. [2025-04-13 17:46:49,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:49,114 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 301 transitions. [2025-04-13 17:46:49,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:46:49,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:49,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:49,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:46:49,116 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:46:49,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2009017684, now seen corresponding path program 1 times [2025-04-13 17:46:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:49,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75064901] [2025-04-13 17:46:49,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:49,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:46:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:46:49,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:49,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:46:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:49,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75064901] [2025-04-13 17:46:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75064901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:46:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698387498] [2025-04-13 17:46:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:49,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:46:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:49,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:46:49,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:46:49,341 INFO L87 Difference]: Start difference. First operand 100 states and 301 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:46:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:49,418 INFO L93 Difference]: Finished difference Result 166 states and 506 transitions. [2025-04-13 17:46:49,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:46:49,419 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:46:49,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:49,420 INFO L225 Difference]: With dead ends: 166 [2025-04-13 17:46:49,420 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 17:46:49,420 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:46:49,421 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:49,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 17:46:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-13 17:46:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.088) internal successors, (386), 125 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:46:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 386 transitions. [2025-04-13 17:46:49,438 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 386 transitions. Word has length 23 [2025-04-13 17:46:49,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:49,439 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 386 transitions. [2025-04-13 17:46:49,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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:46:49,439 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 386 transitions. [2025-04-13 17:46:49,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:46:49,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:49,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:49,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:46:49,440 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:46:49,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -989866903, now seen corresponding path program 1 times [2025-04-13 17:46:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:49,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307286553] [2025-04-13 17:46:49,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:46:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:46:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:46:49,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:49,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307286553] [2025-04-13 17:46:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307286553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:49,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793109814] [2025-04-13 17:46:49,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:49,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:49,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:49,587 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:46:49,596 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:46:49,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:46:49,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:46:49,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:49,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:49,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:46:49,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:46:49,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:46:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793109814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:49,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 17:46:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76622380] [2025-04-13 17:46:49,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:49,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:46:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:49,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:46:49,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:46:49,773 INFO L87 Difference]: Start difference. First operand 126 states and 386 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:49,864 INFO L93 Difference]: Finished difference Result 258 states and 786 transitions. [2025-04-13 17:46:49,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:46:49,864 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:46:49,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:49,865 INFO L225 Difference]: With dead ends: 258 [2025-04-13 17:46:49,865 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 17:46:49,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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:46:49,866 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:49,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 17:46:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-13 17:46:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9477611940298507) internal successors, (395), 134 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have 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:46:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 395 transitions. [2025-04-13 17:46:49,881 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 395 transitions. Word has length 24 [2025-04-13 17:46:49,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:49,881 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 395 transitions. [2025-04-13 17:46:49,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:49,881 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 395 transitions. [2025-04-13 17:46:49,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:46:49,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:49,883 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, 1, 1, 1, 1] [2025-04-13 17:46:49,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:46:50,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:50,084 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:46:50,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash 986799775, now seen corresponding path program 2 times [2025-04-13 17:46:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:50,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596099081] [2025-04-13 17:46:50,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:50,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 17:46:50,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 17:46:50,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:46:50,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 17:46:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:50,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596099081] [2025-04-13 17:46:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596099081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812964363] [2025-04-13 17:46:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:50,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:46:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:46:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:46:50,447 INFO L87 Difference]: Start difference. First operand 135 states and 395 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:46:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:50,605 INFO L93 Difference]: Finished difference Result 250 states and 767 transitions. [2025-04-13 17:46:50,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:46:50,605 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 33 [2025-04-13 17:46:50,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:50,607 INFO L225 Difference]: With dead ends: 250 [2025-04-13 17:46:50,607 INFO L226 Difference]: Without dead ends: 238 [2025-04-13 17:46:50,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:46:50,608 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:50,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-04-13 17:46:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2025-04-13 17:46:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.0558375634517767) internal successors, (602), 197 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:46:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 602 transitions. [2025-04-13 17:46:50,631 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 602 transitions. Word has length 33 [2025-04-13 17:46:50,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:50,634 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 602 transitions. [2025-04-13 17:46:50,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:46:50,634 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 602 transitions. [2025-04-13 17:46:50,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:46:50,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:50,635 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, 1, 1, 1, 1] [2025-04-13 17:46:50,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:46:50,635 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:46:50,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 348663805, now seen corresponding path program 3 times [2025-04-13 17:46:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:50,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843482014] [2025-04-13 17:46:50,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:50,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-04-13 17:46:50,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 17:46:50,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:46:50,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 17:46:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:50,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843482014] [2025-04-13 17:46:50,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843482014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:50,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898000363] [2025-04-13 17:46:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:50,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:46:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:50,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:46:50,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:46:50,961 INFO L87 Difference]: Start difference. First operand 198 states and 602 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:46:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:51,136 INFO L93 Difference]: Finished difference Result 296 states and 924 transitions. [2025-04-13 17:46:51,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:46:51,138 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 33 [2025-04-13 17:46:51,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:51,140 INFO L225 Difference]: With dead ends: 296 [2025-04-13 17:46:51,140 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 17:46:51,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:46:51,141 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:51,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 17:46:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 216. [2025-04-13 17:46:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.088372093023256) internal successors, (664), 215 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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:46:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 664 transitions. [2025-04-13 17:46:51,170 INFO L79 Accepts]: Start accepts. Automaton has 216 states and 664 transitions. Word has length 33 [2025-04-13 17:46:51,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:51,171 INFO L485 AbstractCegarLoop]: Abstraction has 216 states and 664 transitions. [2025-04-13 17:46:51,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:46:51,171 INFO L278 IsEmpty]: Start isEmpty. Operand 216 states and 664 transitions. [2025-04-13 17:46:51,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 17:46:51,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:51,173 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, 1, 1, 1, 1, 1] [2025-04-13 17:46:51,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:46:51,173 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:46:51,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 526043980, now seen corresponding path program 1 times [2025-04-13 17:46:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:51,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525394956] [2025-04-13 17:46:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 17:46:51,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:46:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:46:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:51,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525394956] [2025-04-13 17:46:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525394956] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:51,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044636761] [2025-04-13 17:46:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:51,372 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:46:51,373 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:46:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 17:46:51,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 17:46:51,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:51,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:51,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:46:51,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:46:51,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 17:46:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044636761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:51,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 17:46:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560283657] [2025-04-13 17:46:51,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:51,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:46:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:51,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:46:51,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:46:51,635 INFO L87 Difference]: Start difference. First operand 216 states and 664 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:51,755 INFO L93 Difference]: Finished difference Result 429 states and 1327 transitions. [2025-04-13 17:46:51,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:46:51,755 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 17:46:51,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:51,757 INFO L225 Difference]: With dead ends: 429 [2025-04-13 17:46:51,757 INFO L226 Difference]: Without dead ends: 219 [2025-04-13 17:46:51,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:46:51,759 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:51,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-13 17:46:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-04-13 17:46:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 3.0596330275229358) internal successors, (667), 218 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:46:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 667 transitions. [2025-04-13 17:46:51,806 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 667 transitions. Word has length 34 [2025-04-13 17:46:51,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:51,806 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 667 transitions. [2025-04-13 17:46:51,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:51,806 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 667 transitions. [2025-04-13 17:46:51,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:51,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:51,807 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:46:51,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:46:52,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 17:46:52,011 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:46:52,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -414587582, now seen corresponding path program 2 times [2025-04-13 17:46:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:52,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889413326] [2025-04-13 17:46:52,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:52,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 17:46:52,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:52,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:52,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:46:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:52,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889413326] [2025-04-13 17:46:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889413326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757770905] [2025-04-13 17:46:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:52,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:52,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:52,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:46:52,263 INFO L87 Difference]: Start difference. First operand 219 states and 667 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:52,405 INFO L93 Difference]: Finished difference Result 291 states and 871 transitions. [2025-04-13 17:46:52,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:52,406 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:52,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:52,408 INFO L225 Difference]: With dead ends: 291 [2025-04-13 17:46:52,408 INFO L226 Difference]: Without dead ends: 241 [2025-04-13 17:46:52,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:46:52,408 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:52,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-13 17:46:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2025-04-13 17:46:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 3.05) internal successors, (610), 200 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have 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:46:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 610 transitions. [2025-04-13 17:46:52,425 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 610 transitions. Word has length 37 [2025-04-13 17:46:52,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:52,425 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 610 transitions. [2025-04-13 17:46:52,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:52,426 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 610 transitions. [2025-04-13 17:46:52,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 17:46:52,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:52,427 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:46:52,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:46:52,427 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:46:52,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash -653960441, now seen corresponding path program 1 times [2025-04-13 17:46:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:52,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496032999] [2025-04-13 17:46:52,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:52,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:46:52,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:52,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:52,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:46:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:52,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496032999] [2025-04-13 17:46:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496032999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:52,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353313180] [2025-04-13 17:46:52,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:46:52,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:52,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:52,702 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:46:52,703 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:46:52,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 17:46:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 17:46:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:52,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:46:52,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:46:53,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:46:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353313180] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:53,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 14 [2025-04-13 17:46:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595823577] [2025-04-13 17:46:53,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:53,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:46:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:46:53,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:46:53,135 INFO L87 Difference]: Start difference. First operand 201 states and 610 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:53,923 INFO L93 Difference]: Finished difference Result 562 states and 1818 transitions. [2025-04-13 17:46:53,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:46:53,923 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 17:46:53,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:53,926 INFO L225 Difference]: With dead ends: 562 [2025-04-13 17:46:53,926 INFO L226 Difference]: Without dead ends: 426 [2025-04-13 17:46:53,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:46:53,927 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:53,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:46:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-04-13 17:46:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 252. [2025-04-13 17:46:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.1553784860557768) internal successors, (792), 251 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have 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:46:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 792 transitions. [2025-04-13 17:46:53,946 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 792 transitions. Word has length 37 [2025-04-13 17:46:53,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:53,946 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 792 transitions. [2025-04-13 17:46:53,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:53,946 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 792 transitions. [2025-04-13 17:46:53,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:53,947 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:53,947 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] [2025-04-13 17:46:53,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:54,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:54,147 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:46:54,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2090946694, now seen corresponding path program 2 times [2025-04-13 17:46:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:54,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506980101] [2025-04-13 17:46:54,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:54,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:46:54,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:46:54,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:54,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:54,376 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:46:54,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:54,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506980101] [2025-04-13 17:46:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506980101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:54,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340500517] [2025-04-13 17:46:54,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:54,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:54,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:54,378 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:46:54,379 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:46:54,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:46:54,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:46:54,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:54,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:54,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 17:46:54,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:54,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:46:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340500517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:54,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:46:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-13 17:46:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237245744] [2025-04-13 17:46:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:54,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:54,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:54,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:46:54,578 INFO L87 Difference]: Start difference. First operand 252 states and 792 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:54,760 INFO L93 Difference]: Finished difference Result 371 states and 1152 transitions. [2025-04-13 17:46:54,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:54,761 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:54,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:54,763 INFO L225 Difference]: With dead ends: 371 [2025-04-13 17:46:54,763 INFO L226 Difference]: Without dead ends: 335 [2025-04-13 17:46:54,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:46:54,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:54,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-04-13 17:46:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 263. [2025-04-13 17:46:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2099236641221376) internal successors, (841), 262 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have 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:46:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 841 transitions. [2025-04-13 17:46:54,784 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 841 transitions. Word has length 38 [2025-04-13 17:46:54,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:54,784 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 841 transitions. [2025-04-13 17:46:54,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:54,784 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 841 transitions. [2025-04-13 17:46:54,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:54,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:54,785 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] [2025-04-13 17:46:54,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:54,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:54,989 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:46:54,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2060470501, now seen corresponding path program 3 times [2025-04-13 17:46:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:54,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206956723] [2025-04-13 17:46:54,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:55,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:55,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:46:55,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:55,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:55,173 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:46:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:55,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206956723] [2025-04-13 17:46:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206956723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:55,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657608940] [2025-04-13 17:46:55,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:55,175 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:46:55,177 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:46:55,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:55,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:46:55,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:55,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:55,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 17:46:55,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:55,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657608940] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:46:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-04-13 17:46:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853501605] [2025-04-13 17:46:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:55,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:55,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:55,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:46:55,426 INFO L87 Difference]: Start difference. First operand 263 states and 841 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:55,606 INFO L93 Difference]: Finished difference Result 409 states and 1275 transitions. [2025-04-13 17:46:55,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:55,606 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:55,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:55,609 INFO L225 Difference]: With dead ends: 409 [2025-04-13 17:46:55,609 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 17:46:55,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:46:55,610 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:55,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 17:46:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 274. [2025-04-13 17:46:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.26007326007326) internal successors, (890), 273 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have 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:46:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 890 transitions. [2025-04-13 17:46:55,652 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 890 transitions. Word has length 38 [2025-04-13 17:46:55,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:55,652 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 890 transitions. [2025-04-13 17:46:55,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:55,652 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 890 transitions. [2025-04-13 17:46:55,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:55,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:55,653 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] [2025-04-13 17:46:55,659 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:46:55,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 17:46:55,854 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:46:55,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2120993085, now seen corresponding path program 4 times [2025-04-13 17:46:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:55,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696127593] [2025-04-13 17:46:55,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:55,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:46:55,893 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:46:55,894 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:46:55,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:56,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696127593] [2025-04-13 17:46:56,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696127593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:56,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695455532] [2025-04-13 17:46:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:56,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:56,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:56,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:46:56,083 INFO L87 Difference]: Start difference. First operand 274 states and 890 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:56,267 INFO L93 Difference]: Finished difference Result 383 states and 1193 transitions. [2025-04-13 17:46:56,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:56,268 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:56,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:56,270 INFO L225 Difference]: With dead ends: 383 [2025-04-13 17:46:56,270 INFO L226 Difference]: Without dead ends: 345 [2025-04-13 17:46:56,270 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:46:56,270 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:56,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-04-13 17:46:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 274. [2025-04-13 17:46:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.21978021978022) internal successors, (879), 273 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have 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:46:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 879 transitions. [2025-04-13 17:46:56,296 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 879 transitions. Word has length 38 [2025-04-13 17:46:56,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:56,297 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 879 transitions. [2025-04-13 17:46:56,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:56,298 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 879 transitions. [2025-04-13 17:46:56,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:56,301 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] [2025-04-13 17:46:56,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:46:56,301 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:46:56,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2146357954, now seen corresponding path program 3 times [2025-04-13 17:46:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:56,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79587386] [2025-04-13 17:46:56,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:56,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:56,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:46:56,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:56,472 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:46:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:56,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79587386] [2025-04-13 17:46:56,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79587386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:56,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050976156] [2025-04-13 17:46:56,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:56,474 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:46:56,476 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:46:56,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:56,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-13 17:46:56,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:56,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:56,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 17:46:56,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:56,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050976156] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:46:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-04-13 17:46:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132542530] [2025-04-13 17:46:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:56,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:46:56,718 INFO L87 Difference]: Start difference. First operand 274 states and 879 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:56,883 INFO L93 Difference]: Finished difference Result 357 states and 1144 transitions. [2025-04-13 17:46:56,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:56,883 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:56,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:56,885 INFO L225 Difference]: With dead ends: 357 [2025-04-13 17:46:56,885 INFO L226 Difference]: Without dead ends: 332 [2025-04-13 17:46:56,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:46:56,886 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:56,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-13 17:46:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 274. [2025-04-13 17:46:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.21978021978022) internal successors, (879), 273 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have 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:46:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 879 transitions. [2025-04-13 17:46:56,916 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 879 transitions. Word has length 38 [2025-04-13 17:46:56,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:56,916 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 879 transitions. [2025-04-13 17:46:56,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:56,916 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 879 transitions. [2025-04-13 17:46:56,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:56,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:56,917 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] [2025-04-13 17:46:56,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:57,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:57,118 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:46:57,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1121589008, now seen corresponding path program 4 times [2025-04-13 17:46:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:57,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924648667] [2025-04-13 17:46:57,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:57,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 17:46:57,138 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:46:57,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:46:57,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:57,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924648667] [2025-04-13 17:46:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924648667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:57,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:57,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678913441] [2025-04-13 17:46:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:57,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:57,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:57,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:46:57,322 INFO L87 Difference]: Start difference. First operand 274 states and 879 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:57,471 INFO L93 Difference]: Finished difference Result 369 states and 1148 transitions. [2025-04-13 17:46:57,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:57,471 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:57,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:57,473 INFO L225 Difference]: With dead ends: 369 [2025-04-13 17:46:57,473 INFO L226 Difference]: Without dead ends: 322 [2025-04-13 17:46:57,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:46:57,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:57,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-13 17:46:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2025-04-13 17:46:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2099236641221376) internal successors, (841), 262 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have 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:46:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 841 transitions. [2025-04-13 17:46:57,501 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 841 transitions. Word has length 38 [2025-04-13 17:46:57,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:57,502 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 841 transitions. [2025-04-13 17:46:57,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:57,502 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 841 transitions. [2025-04-13 17:46:57,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:57,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:57,502 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] [2025-04-13 17:46:57,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:46:57,503 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:46:57,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash -121415765, now seen corresponding path program 5 times [2025-04-13 17:46:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:57,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290779568] [2025-04-13 17:46:57,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:57,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:57,544 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:46:57,544 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:57,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:57,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290779568] [2025-04-13 17:46:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290779568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:57,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837000726] [2025-04-13 17:46:57,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:57,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:57,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:57,797 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:46:57,798 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:46:57,876 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:58,052 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:46:58,053 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:58,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:46:58,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:58,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837000726] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:58,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:58,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-04-13 17:46:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685485876] [2025-04-13 17:46:58,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:58,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:46:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:58,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:46:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:46:58,202 INFO L87 Difference]: Start difference. First operand 263 states and 841 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:58,485 INFO L93 Difference]: Finished difference Result 484 states and 1592 transitions. [2025-04-13 17:46:58,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:46:58,486 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:58,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:58,489 INFO L225 Difference]: With dead ends: 484 [2025-04-13 17:46:58,489 INFO L226 Difference]: Without dead ends: 458 [2025-04-13 17:46:58,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:46:58,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:58,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-04-13 17:46:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 263. [2025-04-13 17:46:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.2099236641221376) internal successors, (841), 262 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have 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:46:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 841 transitions. [2025-04-13 17:46:58,549 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 841 transitions. Word has length 38 [2025-04-13 17:46:58,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:58,549 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 841 transitions. [2025-04-13 17:46:58,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:58,551 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 841 transitions. [2025-04-13 17:46:58,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:58,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:58,552 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] [2025-04-13 17:46:58,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 17:46:58,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:58,753 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:46:58,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -262119832, now seen corresponding path program 5 times [2025-04-13 17:46:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:58,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575455718] [2025-04-13 17:46:58,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:58,766 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:58,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:46:58,788 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:58,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575455718] [2025-04-13 17:46:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575455718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:46:58,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:46:58,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:46:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487734633] [2025-04-13 17:46:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:58,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:58,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:58,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:46:58,950 INFO L87 Difference]: Start difference. First operand 263 states and 841 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:59,142 INFO L93 Difference]: Finished difference Result 359 states and 1112 transitions. [2025-04-13 17:46:59,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:59,142 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:59,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:59,144 INFO L225 Difference]: With dead ends: 359 [2025-04-13 17:46:59,144 INFO L226 Difference]: Without dead ends: 323 [2025-04-13 17:46:59,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:46:59,145 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:59,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-04-13 17:46:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2025-04-13 17:46:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.2288732394366195) internal successors, (917), 284 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have 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:46:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 917 transitions. [2025-04-13 17:46:59,183 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 917 transitions. Word has length 38 [2025-04-13 17:46:59,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:59,184 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 917 transitions. [2025-04-13 17:46:59,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:59,184 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 917 transitions. [2025-04-13 17:46:59,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:59,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:59,184 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] [2025-04-13 17:46:59,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:46:59,185 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:46:59,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -231643639, now seen corresponding path program 6 times [2025-04-13 17:46:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:59,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248244732] [2025-04-13 17:46:59,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:59,195 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:59,215 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:46:59,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:46:59,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:59,339 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:46:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:59,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248244732] [2025-04-13 17:46:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248244732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:59,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506246663] [2025-04-13 17:46:59,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:59,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:59,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:59,341 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:46:59,343 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:46:59,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:46:59,471 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:46:59,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:46:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:59,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 17:46:59,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:59,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:46:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506246663] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:46:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-04-13 17:46:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853629970] [2025-04-13 17:46:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:46:59,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:46:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:46:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:46:59,585 INFO L87 Difference]: Start difference. First operand 285 states and 917 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:59,768 INFO L93 Difference]: Finished difference Result 415 states and 1316 transitions. [2025-04-13 17:46:59,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:46:59,769 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:46:59,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:59,772 INFO L225 Difference]: With dead ends: 415 [2025-04-13 17:46:59,772 INFO L226 Difference]: Without dead ends: 389 [2025-04-13 17:46:59,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:46:59,773 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:59,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:46:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-04-13 17:46:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 285. [2025-04-13 17:46:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.2288732394366195) internal successors, (917), 284 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have 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:46:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 917 transitions. [2025-04-13 17:46:59,815 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 917 transitions. Word has length 38 [2025-04-13 17:46:59,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:59,815 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 917 transitions. [2025-04-13 17:46:59,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:59,815 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 917 transitions. [2025-04-13 17:46:59,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:46:59,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:59,816 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] [2025-04-13 17:46:59,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 17:47:00,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 17:47:00,016 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:47:00,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -345147349, now seen corresponding path program 7 times [2025-04-13 17:47:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:00,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592510368] [2025-04-13 17:47:00,017 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:47:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:00,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 17:47:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 17:47:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:00,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592510368] [2025-04-13 17:47:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592510368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:47:00,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:47:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:47:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957594025] [2025-04-13 17:47:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:47:00,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:47:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:00,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:47:00,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:47:00,215 INFO L87 Difference]: Start difference. First operand 285 states and 917 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:00,396 INFO L93 Difference]: Finished difference Result 349 states and 1066 transitions. [2025-04-13 17:47:00,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:47:00,396 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:47:00,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:00,398 INFO L225 Difference]: With dead ends: 349 [2025-04-13 17:47:00,398 INFO L226 Difference]: Without dead ends: 311 [2025-04-13 17:47:00,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:47:00,399 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:00,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:47:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-13 17:47:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 285. [2025-04-13 17:47:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.1901408450704225) internal successors, (906), 284 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have 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:47:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 906 transitions. [2025-04-13 17:47:00,440 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 906 transitions. Word has length 38 [2025-04-13 17:47:00,440 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:00,440 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 906 transitions. [2025-04-13 17:47:00,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:00,440 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 906 transitions. [2025-04-13 17:47:00,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 17:47:00,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:00,441 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] [2025-04-13 17:47:00,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:47:00,441 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:47:00,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -317531092, now seen corresponding path program 6 times [2025-04-13 17:47:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:00,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951516878] [2025-04-13 17:47:00,441 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:00,453 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:47:00,485 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:47:00,485 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:47:00,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:00,594 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:47:00,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:00,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951516878] [2025-04-13 17:47:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951516878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:00,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869462155] [2025-04-13 17:47:00,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:00,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:00,596 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:47:00,597 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:47:00,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-13 17:47:00,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-13 17:47:00,728 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:47:00,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:00,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 17:47:00,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:00,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869462155] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 17:47:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-04-13 17:47:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877928796] [2025-04-13 17:47:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:47:00,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:47:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:00,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:47:00,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:47:00,850 INFO L87 Difference]: Start difference. First operand 285 states and 906 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:01,010 INFO L93 Difference]: Finished difference Result 311 states and 966 transitions. [2025-04-13 17:47:01,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:47:01,010 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 17:47:01,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:01,012 INFO L225 Difference]: With dead ends: 311 [2025-04-13 17:47:01,012 INFO L226 Difference]: Without dead ends: 286 [2025-04-13 17:47:01,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:47:01,013 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:01,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:47:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-04-13 17:47:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 252. [2025-04-13 17:47:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.1115537848605577) internal successors, (781), 251 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have 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:47:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 781 transitions. [2025-04-13 17:47:01,049 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 781 transitions. Word has length 38 [2025-04-13 17:47:01,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:01,049 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 781 transitions. [2025-04-13 17:47:01,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:01,049 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 781 transitions. [2025-04-13 17:47:01,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:47:01,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:01,050 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:47:01,057 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:47:01,250 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,SelfDestructingSolverStorable17 [2025-04-13 17:47:01,250 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:47:01,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1757244527, now seen corresponding path program 1 times [2025-04-13 17:47:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:01,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310592035] [2025-04-13 17:47:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:47:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:01,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:47:01,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:47:01,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:01,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 17:47:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:01,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310592035] [2025-04-13 17:47:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310592035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:01,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854607585] [2025-04-13 17:47:01,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:47:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:01,412 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:47:01,414 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:47:01,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 17:47:01,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:47:01,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:01,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:01,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:47:01,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:01,748 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 17:47:01,748 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 38 treesize of output 32 [2025-04-13 17:47:01,793 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:47:01,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:14,648 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:47:14,649 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 187 [2025-04-13 17:47:15,393 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:47:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854607585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:15,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2025-04-13 17:47:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464399217] [2025-04-13 17:47:15,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:15,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:47:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:15,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:47:15,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=399, Unknown=3, NotChecked=0, Total=462 [2025-04-13 17:47:15,395 INFO L87 Difference]: Start difference. First operand 252 states and 781 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:19,590 INFO L93 Difference]: Finished difference Result 807 states and 2517 transitions. [2025-04-13 17:47:19,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 17:47:19,590 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:47:19,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:19,593 INFO L225 Difference]: With dead ends: 807 [2025-04-13 17:47:19,593 INFO L226 Difference]: Without dead ends: 536 [2025-04-13 17:47:19,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1118, Invalid=5521, Unknown=3, NotChecked=0, Total=6642 [2025-04-13 17:47:19,595 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 437 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:19,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 0 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 17:47:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-04-13 17:47:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 369. [2025-04-13 17:47:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.203804347826087) internal successors, (1179), 368 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have 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:47:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1179 transitions. [2025-04-13 17:47:19,664 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 1179 transitions. Word has length 39 [2025-04-13 17:47:19,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:19,664 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 1179 transitions. [2025-04-13 17:47:19,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:19,664 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 1179 transitions. [2025-04-13 17:47:19,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:47:19,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:19,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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:47:19,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 17:47:19,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:19,866 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:47:19,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 386746972, now seen corresponding path program 2 times [2025-04-13 17:47:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:19,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 17:47:19,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:19,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:47:19,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:47:19,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:19,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 17:47:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:20,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 17:47:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51335991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:20,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126713269] [2025-04-13 17:47:20,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:20,055 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:47:20,056 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:47:20,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:47:20,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:47:20,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:20,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:20,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:47:20,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:20,659 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 17:47:20,659 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 38 treesize of output 22 [2025-04-13 17:47:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:47:20,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:21,670 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:47:21,671 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 114 treesize of output 254 [2025-04-13 17:47:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 17:47:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126713269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:21,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 10] total 28 [2025-04-13 17:47:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416217409] [2025-04-13 17:47:21,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:21,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:47:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:47:21,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:47:21,888 INFO L87 Difference]: Start difference. First operand 369 states and 1179 transitions. Second operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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:47:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:24,696 INFO L93 Difference]: Finished difference Result 654 states and 2120 transitions. [2025-04-13 17:47:24,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:47:24,697 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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 40 [2025-04-13 17:47:24,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:24,700 INFO L225 Difference]: With dead ends: 654 [2025-04-13 17:47:24,700 INFO L226 Difference]: Without dead ends: 515 [2025-04-13 17:47:24,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=663, Invalid=4029, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:47:24,701 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 412 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:24,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 0 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:47:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-04-13 17:47:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 460. [2025-04-13 17:47:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 3.24400871459695) internal successors, (1489), 459 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have 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:47:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1489 transitions. [2025-04-13 17:47:24,811 INFO L79 Accepts]: Start accepts. Automaton has 460 states and 1489 transitions. Word has length 40 [2025-04-13 17:47:24,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:24,811 INFO L485 AbstractCegarLoop]: Abstraction has 460 states and 1489 transitions. [2025-04-13 17:47:24,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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:47:24,811 INFO L278 IsEmpty]: Start isEmpty. Operand 460 states and 1489 transitions. [2025-04-13 17:47:24,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:47:24,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:24,812 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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:47:24,819 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:47:25,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:25,015 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:47:25,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash -449756373, now seen corresponding path program 3 times [2025-04-13 17:47:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:25,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66645724] [2025-04-13 17:47:25,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:25,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-13 17:47:25,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 41 statements. [2025-04-13 17:47:25,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:47:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:25,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66645724] [2025-04-13 17:47:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66645724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:25,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424538172] [2025-04-13 17:47:25,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:25,265 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:47:25,266 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:47:25,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-13 17:47:25,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 41 statements. [2025-04-13 17:47:25,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:47:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:25,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:47:25,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:25,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424538172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:25,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-04-13 17:47:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631630596] [2025-04-13 17:47:25,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:25,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 17:47:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:25,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 17:47:25,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:47:25,681 INFO L87 Difference]: Start difference. First operand 460 states and 1489 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:26,182 INFO L93 Difference]: Finished difference Result 658 states and 2143 transitions. [2025-04-13 17:47:26,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:47:26,182 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 17:47:26,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:26,185 INFO L225 Difference]: With dead ends: 658 [2025-04-13 17:47:26,185 INFO L226 Difference]: Without dead ends: 554 [2025-04-13 17:47:26,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:47:26,186 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:26,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:47:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-04-13 17:47:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 530. [2025-04-13 17:47:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.264650283553875) internal successors, (1727), 529 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have 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:47:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1727 transitions. [2025-04-13 17:47:26,308 INFO L79 Accepts]: Start accepts. Automaton has 530 states and 1727 transitions. Word has length 41 [2025-04-13 17:47:26,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:26,308 INFO L485 AbstractCegarLoop]: Abstraction has 530 states and 1727 transitions. [2025-04-13 17:47:26,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:26,308 INFO L278 IsEmpty]: Start isEmpty. Operand 530 states and 1727 transitions. [2025-04-13 17:47:26,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:47:26,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:26,309 INFO L218 NwaCegarLoop]: trace histogram [5, 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:47:26,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 17:47:26,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 17:47:26,510 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:47:26,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1106192768, now seen corresponding path program 4 times [2025-04-13 17:47:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:26,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694788143] [2025-04-13 17:47:26,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:26,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:47:26,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:47:26,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:47:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:47:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:28,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694788143] [2025-04-13 17:47:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694788143] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:28,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660105719] [2025-04-13 17:47:28,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:28,107 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:47:28,107 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:47:28,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:47:28,261 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:47:28,262 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:47:28,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:28,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:47:28,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:28,435 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 17:47:28,436 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 38 treesize of output 38 [2025-04-13 17:47:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:47:28,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:49,676 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:47:49,677 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 187 [2025-04-13 17:47:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:47:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660105719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:51,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2025-04-13 17:47:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327501458] [2025-04-13 17:47:51,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:51,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:47:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:51,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:47:51,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=886, Unknown=5, NotChecked=0, Total=992 [2025-04-13 17:47:51,231 INFO L87 Difference]: Start difference. First operand 530 states and 1727 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:47:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:54,292 INFO L93 Difference]: Finished difference Result 875 states and 2769 transitions. [2025-04-13 17:47:54,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:47:54,293 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 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 42 [2025-04-13 17:47:54,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:54,297 INFO L225 Difference]: With dead ends: 875 [2025-04-13 17:47:54,297 INFO L226 Difference]: Without dead ends: 776 [2025-04-13 17:47:54,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=405, Invalid=2560, Unknown=5, NotChecked=0, Total=2970 [2025-04-13 17:47:54,299 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:54,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:47:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-04-13 17:47:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 574. [2025-04-13 17:47:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.3752181500872602) internal successors, (1934), 573 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have 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:47:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1934 transitions. [2025-04-13 17:47:54,511 INFO L79 Accepts]: Start accepts. Automaton has 574 states and 1934 transitions. Word has length 42 [2025-04-13 17:47:54,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:54,511 INFO L485 AbstractCegarLoop]: Abstraction has 574 states and 1934 transitions. [2025-04-13 17:47:54,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:47:54,511 INFO L278 IsEmpty]: Start isEmpty. Operand 574 states and 1934 transitions. [2025-04-13 17:47:54,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:47:54,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:54,513 INFO L218 NwaCegarLoop]: trace histogram [5, 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:47:54,519 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:47:54,716 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,SelfDestructingSolverStorable21 [2025-04-13 17:47:54,717 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:47:54,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1470430822, now seen corresponding path program 5 times [2025-04-13 17:47:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:54,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000447664] [2025-04-13 17:47:54,717 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:54,731 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:47:54,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:47:54,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:47:54,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 17:47:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:56,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000447664] [2025-04-13 17:47:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000447664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:56,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487610141] [2025-04-13 17:47:56,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:56,077 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:47:56,079 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:47:56,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:47:56,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:47:56,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:47:56,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:56,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 17:47:56,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:56,758 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 17:47:56,758 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 38 treesize of output 38 [2025-04-13 17:47:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:47:56,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:05,820 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 17:49:05,821 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 32 treesize of output 48 [2025-04-13 17:49:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 17:49:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487610141] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:05,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 36 [2025-04-13 17:49:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501576601] [2025-04-13 17:49:05,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:05,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:49:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:05,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:49:05,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1166, Unknown=17, NotChecked=0, Total=1332 [2025-04-13 17:49:05,848 INFO L87 Difference]: Start difference. First operand 574 states and 1934 transitions. Second operand has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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:49:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:07,797 INFO L93 Difference]: Finished difference Result 703 states and 2344 transitions. [2025-04-13 17:49:07,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:49:07,798 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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 42 [2025-04-13 17:49:07,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:07,801 INFO L225 Difference]: With dead ends: 703 [2025-04-13 17:49:07,801 INFO L226 Difference]: Without dead ends: 676 [2025-04-13 17:49:07,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 69.5s TimeCoverageRelationStatistics Valid=429, Invalid=2524, Unknown=17, NotChecked=0, Total=2970 [2025-04-13 17:49:07,802 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 428 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:07,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 0 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:49:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-04-13 17:49:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 574. [2025-04-13 17:49:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.3752181500872602) internal successors, (1934), 573 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have 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:49:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1934 transitions. [2025-04-13 17:49:07,978 INFO L79 Accepts]: Start accepts. Automaton has 574 states and 1934 transitions. Word has length 42 [2025-04-13 17:49:07,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:07,978 INFO L485 AbstractCegarLoop]: Abstraction has 574 states and 1934 transitions. [2025-04-13 17:49:07,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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:49:07,978 INFO L278 IsEmpty]: Start isEmpty. Operand 574 states and 1934 transitions. [2025-04-13 17:49:07,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:49:07,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:07,979 INFO L218 NwaCegarLoop]: trace histogram [5, 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:49:07,987 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:49:08,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:08,183 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:49:08,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1142758700, now seen corresponding path program 6 times [2025-04-13 17:49:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:08,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048125304] [2025-04-13 17:49:08,183 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:08,193 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:49:08,240 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:08,240 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:08,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:09,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048125304] [2025-04-13 17:49:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048125304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:09,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420331724] [2025-04-13 17:49:09,358 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:09,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:09,359 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:49:09,361 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:49:09,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:49:09,553 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:09,553 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:09,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 17:49:09,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:09,796 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 17:49:09,796 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 38 treesize of output 30 [2025-04-13 17:49:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:09,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:10,622 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:49:10,623 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 114 treesize of output 254 [2025-04-13 17:49:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420331724] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:11,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 17:49:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234615128] [2025-04-13 17:49:11,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:11,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:49:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:11,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:49:11,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:49:11,350 INFO L87 Difference]: Start difference. First operand 574 states and 1934 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:13,135 INFO L93 Difference]: Finished difference Result 828 states and 2778 transitions. [2025-04-13 17:49:13,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:49:13,135 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 17:49:13,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:13,139 INFO L225 Difference]: With dead ends: 828 [2025-04-13 17:49:13,139 INFO L226 Difference]: Without dead ends: 757 [2025-04-13 17:49:13,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=1846, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:49:13,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:13,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:49:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-04-13 17:49:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 618. [2025-04-13 17:49:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 3.3987034035656403) internal successors, (2097), 617 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:49:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2097 transitions. [2025-04-13 17:49:13,335 INFO L79 Accepts]: Start accepts. Automaton has 618 states and 2097 transitions. Word has length 42 [2025-04-13 17:49:13,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:13,335 INFO L485 AbstractCegarLoop]: Abstraction has 618 states and 2097 transitions. [2025-04-13 17:49:13,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:13,335 INFO L278 IsEmpty]: Start isEmpty. Operand 618 states and 2097 transitions. [2025-04-13 17:49:13,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:49:13,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:13,337 INFO L218 NwaCegarLoop]: trace histogram [5, 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:49:13,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 17:49:13,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:13,541 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:49:13,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2020661902, now seen corresponding path program 7 times [2025-04-13 17:49:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:13,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232212411] [2025-04-13 17:49:13,541 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:13,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 17:49:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:13,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:13,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-13 17:49:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:14,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232212411] [2025-04-13 17:49:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232212411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:14,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846920735] [2025-04-13 17:49:14,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:14,979 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:49:14,981 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:49:15,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 17:49:15,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:15,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:49:15,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:15,338 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 17:49:15,338 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 50 treesize of output 36 [2025-04-13 17:49:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:15,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:52,433 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:49:52,433 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 187 [2025-04-13 17:49:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846920735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:53,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 35 [2025-04-13 17:49:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184017330] [2025-04-13 17:49:53,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:53,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:49:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:53,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:49:53,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1102, Unknown=8, NotChecked=0, Total=1260 [2025-04-13 17:49:53,569 INFO L87 Difference]: Start difference. First operand 618 states and 2097 transitions. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 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:49:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:55,566 INFO L93 Difference]: Finished difference Result 814 states and 2735 transitions. [2025-04-13 17:49:55,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:49:55,566 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 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 42 [2025-04-13 17:49:55,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:55,570 INFO L225 Difference]: With dead ends: 814 [2025-04-13 17:49:55,570 INFO L226 Difference]: Without dead ends: 741 [2025-04-13 17:49:55,570 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=370, Invalid=2592, Unknown=8, NotChecked=0, Total=2970 [2025-04-13 17:49:55,571 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:55,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:49:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-04-13 17:49:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 651. [2025-04-13 17:49:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 3.4184615384615387) internal successors, (2222), 650 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have 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:49:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 2222 transitions. [2025-04-13 17:49:55,780 INFO L79 Accepts]: Start accepts. Automaton has 651 states and 2222 transitions. Word has length 42 [2025-04-13 17:49:55,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:55,780 INFO L485 AbstractCegarLoop]: Abstraction has 651 states and 2222 transitions. [2025-04-13 17:49:55,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 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:49:55,780 INFO L278 IsEmpty]: Start isEmpty. Operand 651 states and 2222 transitions. [2025-04-13 17:49:55,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:49:55,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:55,781 INFO L218 NwaCegarLoop]: trace histogram [5, 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:49:55,788 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:49:55,982 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,SelfDestructingSolverStorable24 [2025-04-13 17:49:55,982 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:49:55,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1965250642, now seen corresponding path program 8 times [2025-04-13 17:49:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:55,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989872292] [2025-04-13 17:49:55,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:55,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:49:56,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:56,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:56,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989872292] [2025-04-13 17:49:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989872292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:56,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011722176] [2025-04-13 17:49:56,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:56,881 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:49:56,897 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:49:57,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:49:57,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:49:57,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:57,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:57,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:49:57,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:57,366 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 17:49:57,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2025-04-13 17:49:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:57,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:58,404 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:49:58,405 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 114 treesize of output 254 [2025-04-13 17:49:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:49:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011722176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:58,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 17:49:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225046304] [2025-04-13 17:49:58,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:58,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:49:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:58,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:49:58,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:49:58,587 INFO L87 Difference]: Start difference. First operand 651 states and 2222 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:00,283 INFO L93 Difference]: Finished difference Result 758 states and 2556 transitions. [2025-04-13 17:50:00,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:50:00,283 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 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 42 [2025-04-13 17:50:00,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:00,286 INFO L225 Difference]: With dead ends: 758 [2025-04-13 17:50:00,286 INFO L226 Difference]: Without dead ends: 707 [2025-04-13 17:50:00,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:50:00,287 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:00,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:50:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-04-13 17:50:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 662. [2025-04-13 17:50:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.435703479576399) internal successors, (2271), 661 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have 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:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2271 transitions. [2025-04-13 17:50:00,508 INFO L79 Accepts]: Start accepts. Automaton has 662 states and 2271 transitions. Word has length 42 [2025-04-13 17:50:00,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:00,508 INFO L485 AbstractCegarLoop]: Abstraction has 662 states and 2271 transitions. [2025-04-13 17:50:00,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:00,508 INFO L278 IsEmpty]: Start isEmpty. Operand 662 states and 2271 transitions. [2025-04-13 17:50:00,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:50:00,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:00,509 INFO L218 NwaCegarLoop]: trace histogram [5, 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:00,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 17:50:00,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 17:50:00,710 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:50:00,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash -611372948, now seen corresponding path program 9 times [2025-04-13 17:50:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:00,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649217665] [2025-04-13 17:50:00,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:00,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:00,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 17:50:00,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:01,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649217665] [2025-04-13 17:50:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649217665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:01,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97200698] [2025-04-13 17:50:01,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:01,582 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:50:01,583 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:50:01,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:01,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 42 statements. [2025-04-13 17:50:01,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:01,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:01,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:50:01,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:02,055 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 17:50:02,055 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 38 treesize of output 30 [2025-04-13 17:50:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:02,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:03,072 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:50:03,072 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 114 treesize of output 254 [2025-04-13 17:50:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97200698] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:03,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2025-04-13 17:50:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120664969] [2025-04-13 17:50:03,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:03,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:50:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:03,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:50:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:50:03,635 INFO L87 Difference]: Start difference. First operand 662 states and 2271 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 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:50:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:05,341 INFO L93 Difference]: Finished difference Result 804 states and 2724 transitions. [2025-04-13 17:50:05,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:50:05,341 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 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 42 [2025-04-13 17:50:05,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:05,345 INFO L225 Difference]: With dead ends: 804 [2025-04-13 17:50:05,345 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 17:50:05,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=1931, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:50:05,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:05,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:50:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 17:50:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 673. [2025-04-13 17:50:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 3.4523809523809526) internal successors, (2320), 672 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have 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:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 2320 transitions. [2025-04-13 17:50:05,581 INFO L79 Accepts]: Start accepts. Automaton has 673 states and 2320 transitions. Word has length 42 [2025-04-13 17:50:05,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:05,581 INFO L485 AbstractCegarLoop]: Abstraction has 673 states and 2320 transitions. [2025-04-13 17:50:05,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 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:50:05,581 INFO L278 IsEmpty]: Start isEmpty. Operand 673 states and 2320 transitions. [2025-04-13 17:50:05,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:50:05,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:05,586 INFO L218 NwaCegarLoop]: trace histogram [5, 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:05,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 17:50:05,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 17:50:05,786 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:50:05,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash -928312780, now seen corresponding path program 10 times [2025-04-13 17:50:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:05,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927964302] [2025-04-13 17:50:05,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:05,796 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:50:05,834 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:05,834 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:05,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:06,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927964302] [2025-04-13 17:50:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927964302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:06,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106707485] [2025-04-13 17:50:06,854 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:06,856 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:50:06,856 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:50:06,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:50:07,007 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:07,007 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:07,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:07,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:50:07,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:07,355 INFO L325 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-04-13 17:50:07,356 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 38 treesize of output 32 [2025-04-13 17:50:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:50:07,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:16,438 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:50:16,438 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 187 [2025-04-13 17:50:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 17:50:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106707485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:17,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 34 [2025-04-13 17:50:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080707335] [2025-04-13 17:50:17,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:17,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:50:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:17,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:50:17,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1065, Unknown=2, NotChecked=0, Total=1190 [2025-04-13 17:50:17,750 INFO L87 Difference]: Start difference. First operand 673 states and 2320 transitions. Second operand has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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:50:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:21,210 INFO L93 Difference]: Finished difference Result 1505 states and 5134 transitions. [2025-04-13 17:50:21,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:50:21,210 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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 42 [2025-04-13 17:50:21,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:21,216 INFO L225 Difference]: With dead ends: 1505 [2025-04-13 17:50:21,216 INFO L226 Difference]: Without dead ends: 1356 [2025-04-13 17:50:21,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=524, Invalid=3380, Unknown=2, NotChecked=0, Total=3906 [2025-04-13 17:50:21,218 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:21,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:50:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-04-13 17:50:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 747. [2025-04-13 17:50:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.4343163538873993) internal successors, (2562), 746 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have 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:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2562 transitions. [2025-04-13 17:50:21,489 INFO L79 Accepts]: Start accepts. Automaton has 747 states and 2562 transitions. Word has length 42 [2025-04-13 17:50:21,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:21,490 INFO L485 AbstractCegarLoop]: Abstraction has 747 states and 2562 transitions. [2025-04-13 17:50:21,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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:50:21,490 INFO L278 IsEmpty]: Start isEmpty. Operand 747 states and 2562 transitions. [2025-04-13 17:50:21,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:50:21,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:21,491 INFO L218 NwaCegarLoop]: trace histogram [5, 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:21,498 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:50:21,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:21,691 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:50:21,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash -189151412, now seen corresponding path program 11 times [2025-04-13 17:50:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:21,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545664403] [2025-04-13 17:50:21,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:21,701 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:21,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:21,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:21,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:50:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:23,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545664403] [2025-04-13 17:50:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545664403] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:23,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702308042] [2025-04-13 17:50:23,295 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:23,296 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:50:23,297 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:50:23,417 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:23,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:23,714 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:23,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:50:23,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:24,130 INFO L325 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2025-04-13 17:50:24,131 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 50 treesize of output 36 [2025-04-13 17:50:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:50:24,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:25,196 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:50:25,196 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 114 treesize of output 254 [2025-04-13 17:50:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 17:50:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702308042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:25,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:25,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 10] total 44 [2025-04-13 17:50:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123539533] [2025-04-13 17:50:25,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:25,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 17:50:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:25,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 17:50:25,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:50:25,891 INFO L87 Difference]: Start difference. First operand 747 states and 2562 transitions. Second operand has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:36,636 INFO L93 Difference]: Finished difference Result 3078 states and 10633 transitions. [2025-04-13 17:50:36,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 17:50:36,637 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 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 42 [2025-04-13 17:50:36,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:36,652 INFO L225 Difference]: With dead ends: 3078 [2025-04-13 17:50:36,652 INFO L226 Difference]: Without dead ends: 2928 [2025-04-13 17:50:36,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4229 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1790, Invalid=11550, Unknown=0, NotChecked=0, Total=13340 [2025-04-13 17:50:36,656 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 571 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5387 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 5387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:36,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 0 Invalid, 5474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 5387 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:50:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-04-13 17:50:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1034. [2025-04-13 17:50:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.569215876089061) internal successors, (3687), 1033 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states have 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:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3687 transitions. [2025-04-13 17:50:37,125 INFO L79 Accepts]: Start accepts. Automaton has 1034 states and 3687 transitions. Word has length 42 [2025-04-13 17:50:37,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:37,125 INFO L485 AbstractCegarLoop]: Abstraction has 1034 states and 3687 transitions. [2025-04-13 17:50:37,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:37,126 INFO L278 IsEmpty]: Start isEmpty. Operand 1034 states and 3687 transitions. [2025-04-13 17:50:37,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:50:37,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:37,127 INFO L218 NwaCegarLoop]: trace histogram [5, 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:37,136 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:50:37,327 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,SelfDestructingSolverStorable28 [2025-04-13 17:50:37,328 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:50:37,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -244562672, now seen corresponding path program 12 times [2025-04-13 17:50:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:37,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748497061] [2025-04-13 17:50:37,328 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:37,338 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:37,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 17:50:37,356 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:50:37,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:38,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748497061] [2025-04-13 17:50:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748497061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:38,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688229808] [2025-04-13 17:50:38,038 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:38,040 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:50:38,041 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:50:38,162 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:50:38,196 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 42 statements. [2025-04-13 17:50:38,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:50:38,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:38,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:50:38,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:38,575 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 17:50:38,576 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 38 treesize of output 30 [2025-04-13 17:50:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:38,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:39,702 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:50:39,702 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 114 treesize of output 254 [2025-04-13 17:50:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688229808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:40,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2025-04-13 17:50:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791119086] [2025-04-13 17:50:40,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:40,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:50:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:40,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:50:40,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:50:40,459 INFO L87 Difference]: Start difference. First operand 1034 states and 3687 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 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:50:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:42,679 INFO L93 Difference]: Finished difference Result 1325 states and 4665 transitions. [2025-04-13 17:50:42,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:50:42,679 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 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 42 [2025-04-13 17:50:42,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:42,684 INFO L225 Difference]: With dead ends: 1325 [2025-04-13 17:50:42,684 INFO L226 Difference]: Without dead ends: 1276 [2025-04-13 17:50:42,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:50:42,685 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:42,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:50:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-04-13 17:50:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1033. [2025-04-13 17:50:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 3.568798449612403) internal successors, (3683), 1032 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have 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:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 3683 transitions. [2025-04-13 17:50:43,148 INFO L79 Accepts]: Start accepts. Automaton has 1033 states and 3683 transitions. Word has length 42 [2025-04-13 17:50:43,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:43,148 INFO L485 AbstractCegarLoop]: Abstraction has 1033 states and 3683 transitions. [2025-04-13 17:50:43,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 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:50:43,149 INFO L278 IsEmpty]: Start isEmpty. Operand 1033 states and 3683 transitions. [2025-04-13 17:50:43,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:50:43,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:43,150 INFO L218 NwaCegarLoop]: trace histogram [5, 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:43,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 17:50:43,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:43,351 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:50:43,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1473781034, now seen corresponding path program 13 times [2025-04-13 17:50:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:43,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434155725] [2025-04-13 17:50:43,351 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:43,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 17:50:43,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:43,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:43,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-13 17:50:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:44,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434155725] [2025-04-13 17:50:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434155725] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:44,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830657665] [2025-04-13 17:50:44,640 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:44,642 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:50:44,644 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:50:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 17:50:44,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:50:44,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:44,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:44,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:50:44,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:45,007 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-13 17:50:45,007 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 38 treesize of output 38 [2025-04-13 17:50:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:50:45,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:14,193 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:51:14,194 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 187 [2025-04-13 17:51:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:51:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830657665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:15,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 36 [2025-04-13 17:51:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521489768] [2025-04-13 17:51:15,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:15,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:51:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:15,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:51:15,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1171, Unknown=7, NotChecked=0, Total=1332 [2025-04-13 17:51:15,130 INFO L87 Difference]: Start difference. First operand 1033 states and 3683 transitions. Second operand has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:19,396 INFO L93 Difference]: Finished difference Result 1536 states and 5318 transitions. [2025-04-13 17:51:19,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:51:19,397 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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 42 [2025-04-13 17:51:19,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:19,401 INFO L225 Difference]: With dead ends: 1536 [2025-04-13 17:51:19,401 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 17:51:19,402 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=482, Invalid=3417, Unknown=7, NotChecked=0, Total=3906 [2025-04-13 17:51:19,402 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:19,402 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 17:51:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 17:51:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1091. [2025-04-13 17:51:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1090 states have (on average 3.6027522935779817) internal successors, (3927), 1090 states have internal predecessors, (3927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 3927 transitions. [2025-04-13 17:51:19,921 INFO L79 Accepts]: Start accepts. Automaton has 1091 states and 3927 transitions. Word has length 42 [2025-04-13 17:51:19,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:19,921 INFO L485 AbstractCegarLoop]: Abstraction has 1091 states and 3927 transitions. [2025-04-13 17:51:19,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 37 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:19,921 INFO L278 IsEmpty]: Start isEmpty. Operand 1091 states and 3927 transitions. [2025-04-13 17:51:19,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:51:19,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:19,923 INFO L218 NwaCegarLoop]: trace histogram [5, 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:51:19,930 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:51:20,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:20,123 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:51:20,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1957533600, now seen corresponding path program 14 times [2025-04-13 17:51:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:20,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50541669] [2025-04-13 17:51:20,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:20,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:51:20,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:51:20,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:51:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:21,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50541669] [2025-04-13 17:51:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50541669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:21,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872630860] [2025-04-13 17:51:21,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:21,859 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:51:21,859 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:51:21,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:51:22,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:51:22,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:22,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:22,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:51:22,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:22,589 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 17:51:22,589 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 38 treesize of output 30 [2025-04-13 17:51:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:51:22,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:23,666 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:51:23,666 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 114 treesize of output 254 [2025-04-13 17:51:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:51:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872630860] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:23,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 10] total 46 [2025-04-13 17:51:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576361226] [2025-04-13 17:51:23,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:23,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 17:51:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 17:51:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1971, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:51:23,957 INFO L87 Difference]: Start difference. First operand 1091 states and 3927 transitions. Second operand has 47 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:28,752 INFO L93 Difference]: Finished difference Result 1879 states and 6534 transitions. [2025-04-13 17:51:28,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:51:28,752 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 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 42 [2025-04-13 17:51:28,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:28,758 INFO L225 Difference]: With dead ends: 1879 [2025-04-13 17:51:28,758 INFO L226 Difference]: Without dead ends: 1769 [2025-04-13 17:51:28,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=634, Invalid=5066, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:51:28,759 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2975 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:28,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 0 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2975 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 17:51:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-04-13 17:51:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1166. [2025-04-13 17:51:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 3.5759656652360516) internal successors, (4166), 1165 states have internal predecessors, (4166), 0 states have call successors, (0), 0 states have 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:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 4166 transitions. [2025-04-13 17:51:29,342 INFO L79 Accepts]: Start accepts. Automaton has 1166 states and 4166 transitions. Word has length 42 [2025-04-13 17:51:29,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:29,342 INFO L485 AbstractCegarLoop]: Abstraction has 1166 states and 4166 transitions. [2025-04-13 17:51:29,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 47 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:29,342 INFO L278 IsEmpty]: Start isEmpty. Operand 1166 states and 4166 transitions. [2025-04-13 17:51:29,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:51:29,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:29,344 INFO L218 NwaCegarLoop]: trace histogram [5, 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:51:29,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 17:51:29,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:29,544 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:51:29,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -153548680, now seen corresponding path program 15 times [2025-04-13 17:51:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:29,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323069290] [2025-04-13 17:51:29,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:29,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:51:29,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 17:51:29,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:51:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:51:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:30,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323069290] [2025-04-13 17:51:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323069290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:30,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768094384] [2025-04-13 17:51:30,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:30,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:30,307 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:51:30,307 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:51:30,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-04-13 17:51:30,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 42 statements. [2025-04-13 17:51:30,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:51:30,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:30,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:51:30,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:30,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:30,909 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 72 treesize of output 80 [2025-04-13 17:51:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:51:31,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:31,982 INFO L325 Elim1Store]: treesize reduction 28, result has 88.8 percent of original size [2025-04-13 17:51:31,982 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 114 treesize of output 254 [2025-04-13 17:51:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-04-13 17:51:32,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768094384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:32,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 33 [2025-04-13 17:51:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040477760] [2025-04-13 17:51:32,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:32,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:51:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:32,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:51:32,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:51:32,602 INFO L87 Difference]: Start difference. First operand 1166 states and 4166 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 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:51:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:38,116 INFO L93 Difference]: Finished difference Result 1697 states and 5885 transitions. [2025-04-13 17:51:38,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:51:38,116 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 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 42 [2025-04-13 17:51:38,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:38,121 INFO L225 Difference]: With dead ends: 1697 [2025-04-13 17:51:38,121 INFO L226 Difference]: Without dead ends: 1654 [2025-04-13 17:51:38,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=680, Invalid=3742, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:51:38,122 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:38,122 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 17:51:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-04-13 17:51:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1220. [2025-04-13 17:51:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 3.579163248564397) internal successors, (4363), 1219 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have 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:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 4363 transitions. [2025-04-13 17:51:38,767 INFO L79 Accepts]: Start accepts. Automaton has 1220 states and 4363 transitions. Word has length 42 [2025-04-13 17:51:38,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:38,767 INFO L485 AbstractCegarLoop]: Abstraction has 1220 states and 4363 transitions. [2025-04-13 17:51:38,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 34 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:51:38,768 INFO L278 IsEmpty]: Start isEmpty. Operand 1220 states and 4363 transitions. [2025-04-13 17:51:38,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 17:51:38,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:38,769 INFO L218 NwaCegarLoop]: trace histogram [5, 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:51:38,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 17:51:38,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:38,970 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:51:38,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1035970282, now seen corresponding path program 16 times [2025-04-13 17:51:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:38,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649263467] [2025-04-13 17:51:38,970 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:51:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:38,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:51:39,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:51:39,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:51:39,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-13 17:51:39,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:39,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649263467] [2025-04-13 17:51:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649263467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:39,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667407391] [2025-04-13 17:51:39,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:51:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:39,980 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:51:39,980 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:51:40,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 17:51:40,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 17:51:40,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:51:40,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:40,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 17:51:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:40,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:40,418 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 72 treesize of output 104 [2025-04-13 17:51:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 17:51:40,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:49,570 INFO L325 Elim1Store]: treesize reduction 28, result has 84.8 percent of original size [2025-04-13 17:51:49,570 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 187 [2025-04-13 17:51:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-04-13 17:51:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667407391] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:50,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:50,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 33 [2025-04-13 17:51:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411108842] [2025-04-13 17:51:50,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:50,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:51:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:50,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:51:50,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=999, Unknown=2, NotChecked=0, Total=1122 [2025-04-13 17:51:50,621 INFO L87 Difference]: Start difference. First operand 1220 states and 4363 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:59,040 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:52:27,489 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:52:31,503 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 [0, 1] [2025-04-13 17:52:35,520 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:52:40,121 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:52:44,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:52:48,241 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 [0, 1] [2025-04-13 17:52:52,257 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 [0, 1] [2025-04-13 17:52:56,338 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:53:00,352 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 [0, 1] [2025-04-13 17:53:04,365 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 [0, 1] [2025-04-13 17:53:08,381 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:53:12,396 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 [0, 1] [2025-04-13 17:53:16,410 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 [0, 1] [2025-04-13 17:53:20,420 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 [0, 1] [2025-04-13 17:53:24,436 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:53:29,695 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 [0, 1] [2025-04-13 17:53:33,705 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 [0, 1] [2025-04-13 17:53:37,992 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 [0, 1] [2025-04-13 17:54:10,477 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 [0, 1] [2025-04-13 17:54:14,489 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 [0, 1] [2025-04-13 17:54:18,520 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:54:22,535 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 [0, 1] [2025-04-13 17:54:26,917 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 [0, 1] [2025-04-13 17:54:30,932 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 [0, 1] [2025-04-13 17:54:34,949 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:54:38,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:54:42,990 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:54:47,003 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 [0, 1] [2025-04-13 17:54:51,175 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 [0, 1] [2025-04-13 17:54:55,194 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:54:59,220 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:55:03,238 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:55:07,252 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 [0, 1] [2025-04-13 17:55:11,263 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 [0, 1] [2025-04-13 17:55:23,425 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:55:27,656 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:55:39,897 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:55:43,910 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:55:47,931 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:55:51,944 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:55:56,127 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:56:00,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:56:04,171 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 [0, 1] [2025-04-13 17:56:08,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:12,204 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:56:16,218 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:56:20,234 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:24,257 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:28,270 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:56:32,281 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:56:36,304 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:40,318 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:56:44,341 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:56:48,363 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:52,773 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 [0, 1] [2025-04-13 17:56:56,854 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:57:00,864 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 [0, 1] [2025-04-13 17:57:04,878 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 [0, 1] [2025-04-13 17:57:08,911 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:57:12,924 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 [0, 1] [2025-04-13 17:57:16,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 [0, 1] [2025-04-13 17:57:20,948 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 [0, 1] [2025-04-13 17:57:24,959 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 [0, 1] [2025-04-13 17:57:28,972 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 [0, 1] [2025-04-13 17:57:32,990 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:57:37,000 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 [0, 1] [2025-04-13 17:57:41,008 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 [0, 1] [2025-04-13 17:57:45,051 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 [0, 1] [2025-04-13 17:57:49,065 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 [0, 1] [2025-04-13 17:57:53,076 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 [0, 1] [2025-04-13 17:57:57,085 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 [0, 1] [2025-04-13 17:58:01,097 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 [0, 1] [2025-04-13 17:58:25,368 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:58:29,385 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:58:41,556 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:58:45,571 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:49,584 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:58:53,597 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:58:57,617 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:01,627 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:59:05,696 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 17:59:09,813 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:59:13,828 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:59:17,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:21,867 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:25,885 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:29,898 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:59:33,912 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:59:37,933 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:41,952 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:45,963 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:59:49,979 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:59:53,995 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:59:58,012 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 18:00:02,029 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:06,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:10,084 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:14,097 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:18,114 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:22,125 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:26,147 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:30,169 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 18:00:34,189 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 18:00:38,203 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:42,221 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:46,237 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:50,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:54,268 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:00:58,806 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:01:02,953 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:01:06,968 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 [0, 1] Received shutdown request... [2025-04-13 18:01:07,046 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:01:07,047 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:01:08,054 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 18:01:08,250 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 18:01:08,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 18:01:08,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=828, Invalid=4847, Unknown=25, NotChecked=0, Total=5700 [2025-04-13 18:01:08,414 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 68 mSolverCounterUnsat, 112 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 453.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 112 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 454.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:01:08,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 0 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1845 Invalid, 112 Unknown, 0 Unchecked, 454.6s Time] [2025-04-13 18:01:08,415 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:01:08,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:01:08,416 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 18:01:08,417 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:01:08,417 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:01:08,417 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:01:08,419 INFO L422 BasicCegarLoop]: Path program histogram: [16, 7, 6, 3, 1, 1] [2025-04-13 18:01:08,421 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:01:08,421 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:01:08,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:01:08 BasicIcfg [2025-04-13 18:01:08,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:01:08,423 INFO L158 Benchmark]: Toolchain (without parser) took 861091.97ms. Allocated memory was 167.8MB in the beginning and 872.4MB in the end (delta: 704.6MB). Free memory was 118.7MB in the beginning and 417.8MB in the end (delta: -299.1MB). Peak memory consumption was 402.9MB. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 163.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.23ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 102.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.63ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: Boogie Preprocessor took 51.01ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: RCFGBuilder took 787.76ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.4MB in the end (delta: 11.8MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2025-04-13 18:01:08,423 INFO L158 Benchmark]: TraceAbstraction took 859978.18ms. Allocated memory was 167.8MB in the beginning and 872.4MB in the end (delta: 704.6MB). Free memory was 85.4MB in the beginning and 417.8MB in the end (delta: -332.4MB). Peak memory consumption was 369.7MB. Max. memory is 8.0GB. [2025-04-13 18:01:08,424 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.27ms. Allocated memory is still 163.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.23ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 102.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.63ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 51.01ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 787.76ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.4MB in the end (delta: 11.8MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. * TraceAbstraction took 859978.18ms. Allocated memory was 167.8MB in the beginning and 872.4MB in the end (delta: 704.6MB). Free memory was 85.4MB in the beginning and 417.8MB in the end (delta: -332.4MB). Peak memory consumption was 369.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 45 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 859.9s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 612.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 112 mSolverCounterUnknown, 6017 SdHoareTripleChecker+Valid, 475.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6017 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 471.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 774 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34360 IncrementalHoareTripleChecker+Invalid, 35247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 774 mSolverCounterUnsat, 0 mSDtfsCounter, 34360 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2772 GetRequests, 1648 SyntacticMatches, 1 SemanticMatches, 1123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17824 ImplicationChecksByTransitivity, 313.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1220occurred in iteration=33, InterpolantAutomatonStates: 609, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 6102 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 231.7s InterpolantComputationTime, 2276 NumberOfCodeBlocks, 2138 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 3144 ConstructedInterpolants, 210 QuantifiedInterpolants, 50892 SizeOfPredicates, 355 NumberOfNonLiveVariables, 10941 ConjunctsInSsa, 745 ConjunctsInUnsatCore, 83 InterpolantComputations, 14 PerfectInterpolantSequences, 3732/4249 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown !ENTRY org.eclipse.osgi 4 0 2025-04-13 18:01:08.434 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c129a952/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:289) at java.base/java.io.FileOutputStream.(FileOutputStream.java:230) at java.base/java.io.FileOutputStream.(FileOutputStream.java:179) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1424) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1230) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2492) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2481) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:189) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:143) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:109) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:439) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:271) at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103) at java.base/java.lang.reflect.Method.invoke(Method.java:580) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:668) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:605) at org.eclipse.equinox.launcher.Main.run(Main.java:1481) at org.eclipse.equinox.launcher.Main.main(Main.java:1454)