/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:08:40,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:08:40,842 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 23:08:40,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:08:40,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:08:40,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:08:40,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:08:40,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:08:40,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:08:40,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:08:40,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:08:40,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:08:40,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:08:40,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:08:40,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:08:40,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:40,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:40,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:08:40,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:08:40,862 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:08:41,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:08:41,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:08:41,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:08:41,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:08:41,099 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:08:41,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-13 23:08:42,413 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a98e998e/cde50193a49549a6aebc280e78febd67/FLAG329e50acc [2025-04-13 23:08:42,630 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:08:42,630 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2025-04-13 23:08:42,638 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a98e998e/cde50193a49549a6aebc280e78febd67/FLAG329e50acc [2025-04-13 23:08:43,413 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a98e998e/cde50193a49549a6aebc280e78febd67 [2025-04-13 23:08:43,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:08:43,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:08:43,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:08:43,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:08:43,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:08:43,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae90114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43, skipping insertion in model container [2025-04-13 23:08:43,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:08:43,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-13 23:08:43,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:08:43,612 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:08:43,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-04-13 23:08:43,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:08:43,651 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:08:43,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43 WrapperNode [2025-04-13 23:08:43,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:08:43,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:08:43,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:08:43,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:08:43,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,673 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-04-13 23:08:43,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:08:43,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:08:43,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:08:43,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:08:43,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:08:43,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:08:43,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:08:43,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:08:43,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:08:43,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (1/1) ... [2025-04-13 23:08:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:08:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:43,719 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 23:08:43,721 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 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:08:43,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:08:43,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:08:43,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:08:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:08:43,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:08:43,736 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:08:43,789 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:08:43,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:08:43,918 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:08:43,919 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:08:43,919 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:08:44,021 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:08:44,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:08:44 BoogieIcfgContainer [2025-04-13 23:08:44,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:08:44,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:08:44,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:08:44,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:08:44,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:08:43" (1/3) ... [2025-04-13 23:08:44,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baaa049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:08:44, skipping insertion in model container [2025-04-13 23:08:44,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:08:43" (2/3) ... [2025-04-13 23:08:44,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baaa049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:08:44, skipping insertion in model container [2025-04-13 23:08:44,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:08:44" (3/3) ... [2025-04-13 23:08:44,031 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-04-13 23:08:44,041 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:08:44,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 29 locations, 28 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:08:44,042 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:08:44,082 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:08:44,100 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 31 transitions, 83 flow [2025-04-13 23:08:44,156 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 404 states, 403 states have (on average 3.305210918114144) internal successors, (1332), 403 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,176 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:08:44,183 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;@671191af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:08:44,183 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:08:44,185 INFO L278 IsEmpty]: Start isEmpty. Operand has 404 states, 403 states have (on average 3.305210918114144) internal successors, (1332), 403 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:08:44,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:44,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:44,195 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 23:08:44,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash 336194417, now seen corresponding path program 1 times [2025-04-13 23:08:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:44,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259413996] [2025-04-13 23:08:44,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:44,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:08:44,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:08:44,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:44,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:44,583 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 23:08:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:44,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259413996] [2025-04-13 23:08:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259413996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:08:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284889357] [2025-04-13 23:08:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:44,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:08:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:44,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:08:44,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:44,610 INFO L87 Difference]: Start difference. First operand has 404 states, 403 states have (on average 3.305210918114144) internal successors, (1332), 403 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:44,721 INFO L93 Difference]: Finished difference Result 670 states and 2212 transitions. [2025-04-13 23:08:44,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:08:44,723 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-13 23:08:44,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:44,738 INFO L225 Difference]: With dead ends: 670 [2025-04-13 23:08:44,738 INFO L226 Difference]: Without dead ends: 664 [2025-04-13 23:08:44,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:08:44,741 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:44,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-04-13 23:08:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 531. [2025-04-13 23:08:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 3.30188679245283) internal successors, (1750), 530 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1750 transitions. [2025-04-13 23:08:44,826 INFO L79 Accepts]: Start accepts. Automaton has 531 states and 1750 transitions. Word has length 19 [2025-04-13 23:08:44,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:44,827 INFO L485 AbstractCegarLoop]: Abstraction has 531 states and 1750 transitions. [2025-04-13 23:08:44,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,827 INFO L278 IsEmpty]: Start isEmpty. Operand 531 states and 1750 transitions. [2025-04-13 23:08:44,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:08:44,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:44,833 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] [2025-04-13 23:08:44,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:08:44,834 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 23:08:44,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 397671913, now seen corresponding path program 1 times [2025-04-13 23:08:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:44,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572063300] [2025-04-13 23:08:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:44,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:08:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:08:44,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:45,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572063300] [2025-04-13 23:08:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572063300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:08:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000375819] [2025-04-13 23:08:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:45,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:45,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:45,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:45,079 INFO L87 Difference]: Start difference. First operand 531 states and 1750 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:45,277 INFO L93 Difference]: Finished difference Result 842 states and 2662 transitions. [2025-04-13 23:08:45,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:08:45,277 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:08:45,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:45,283 INFO L225 Difference]: With dead ends: 842 [2025-04-13 23:08:45,284 INFO L226 Difference]: Without dead ends: 731 [2025-04-13 23:08:45,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:45,286 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:45,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 30 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-04-13 23:08:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 651. [2025-04-13 23:08:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 3.206153846153846) internal successors, (2084), 650 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 2084 transitions. [2025-04-13 23:08:45,327 INFO L79 Accepts]: Start accepts. Automaton has 651 states and 2084 transitions. Word has length 21 [2025-04-13 23:08:45,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:45,327 INFO L485 AbstractCegarLoop]: Abstraction has 651 states and 2084 transitions. [2025-04-13 23:08:45,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:45,327 INFO L278 IsEmpty]: Start isEmpty. Operand 651 states and 2084 transitions. [2025-04-13 23:08:45,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:08:45,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:45,329 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] [2025-04-13 23:08:45,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:08:45,329 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 23:08:45,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1276780325, now seen corresponding path program 2 times [2025-04-13 23:08:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:45,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116304585] [2025-04-13 23:08:45,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:45,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:08:45,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:08:45,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:45,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116304585] [2025-04-13 23:08:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116304585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:45,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875200866] [2025-04-13 23:08:45,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:45,554 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 23:08:45,555 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 23:08:45,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:08:45,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:08:45,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:45,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:45,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:08:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:45,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875200866] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:45,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:08:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 10 [2025-04-13 23:08:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166789887] [2025-04-13 23:08:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:45,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:45,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:45,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:08:45,828 INFO L87 Difference]: Start difference. First operand 651 states and 2084 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:46,072 INFO L93 Difference]: Finished difference Result 1129 states and 3504 transitions. [2025-04-13 23:08:46,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:46,073 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:08:46,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:46,080 INFO L225 Difference]: With dead ends: 1129 [2025-04-13 23:08:46,080 INFO L226 Difference]: Without dead ends: 1070 [2025-04-13 23:08:46,081 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:08:46,082 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:46,082 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-04-13 23:08:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 711. [2025-04-13 23:08:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 3.2704225352112677) internal successors, (2322), 710 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2322 transitions. [2025-04-13 23:08:46,147 INFO L79 Accepts]: Start accepts. Automaton has 711 states and 2322 transitions. Word has length 21 [2025-04-13 23:08:46,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:46,147 INFO L485 AbstractCegarLoop]: Abstraction has 711 states and 2322 transitions. [2025-04-13 23:08:46,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,148 INFO L278 IsEmpty]: Start isEmpty. Operand 711 states and 2322 transitions. [2025-04-13 23:08:46,149 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:08:46,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:46,150 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] [2025-04-13 23:08:46,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:46,354 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 23:08:46,354 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 23:08:46,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash 524478255, now seen corresponding path program 3 times [2025-04-13 23:08:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:46,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467989639] [2025-04-13 23:08:46,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:46,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:08:46,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:08:46,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:46,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:46,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467989639] [2025-04-13 23:08:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467989639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:46,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038334793] [2025-04-13 23:08:46,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:46,512 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 23:08:46,514 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 23:08:46,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:08:46,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:08:46,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:46,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:46,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:08:46,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:46,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038334793] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:08:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-04-13 23:08:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034487303] [2025-04-13 23:08:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:46,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:08:46,703 INFO L87 Difference]: Start difference. First operand 711 states and 2322 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:46,920 INFO L93 Difference]: Finished difference Result 1017 states and 3284 transitions. [2025-04-13 23:08:46,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:46,921 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:08:46,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:46,926 INFO L225 Difference]: With dead ends: 1017 [2025-04-13 23:08:46,926 INFO L226 Difference]: Without dead ends: 958 [2025-04-13 23:08:46,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:08:46,927 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:46,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 39 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-04-13 23:08:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 747. [2025-04-13 23:08:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.2815013404825737) internal successors, (2448), 746 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2448 transitions. [2025-04-13 23:08:46,969 INFO L79 Accepts]: Start accepts. Automaton has 747 states and 2448 transitions. Word has length 21 [2025-04-13 23:08:46,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:46,969 INFO L485 AbstractCegarLoop]: Abstraction has 747 states and 2448 transitions. [2025-04-13 23:08:46,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:46,970 INFO L278 IsEmpty]: Start isEmpty. Operand 747 states and 2448 transitions. [2025-04-13 23:08:46,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:46,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:46,972 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] [2025-04-13 23:08:46,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:47,172 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,SelfDestructingSolverStorable3 [2025-04-13 23:08:47,172 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 23:08:47,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 603205861, now seen corresponding path program 1 times [2025-04-13 23:08:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:47,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391647984] [2025-04-13 23:08:47,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:47,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:08:47,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:47,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:47,302 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 23:08:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:47,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391647984] [2025-04-13 23:08:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391647984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762599033] [2025-04-13 23:08:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:47,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:08:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:08:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:47,303 INFO L87 Difference]: Start difference. First operand 747 states and 2448 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:47,496 INFO L93 Difference]: Finished difference Result 993 states and 3248 transitions. [2025-04-13 23:08:47,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:08:47,496 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:47,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:47,502 INFO L225 Difference]: With dead ends: 993 [2025-04-13 23:08:47,502 INFO L226 Difference]: Without dead ends: 900 [2025-04-13 23:08:47,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:08:47,505 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:47,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 42 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-04-13 23:08:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 811. [2025-04-13 23:08:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.3012345679012345) internal successors, (2674), 810 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2674 transitions. [2025-04-13 23:08:47,560 INFO L79 Accepts]: Start accepts. Automaton has 811 states and 2674 transitions. Word has length 22 [2025-04-13 23:08:47,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:47,560 INFO L485 AbstractCegarLoop]: Abstraction has 811 states and 2674 transitions. [2025-04-13 23:08:47,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,561 INFO L278 IsEmpty]: Start isEmpty. Operand 811 states and 2674 transitions. [2025-04-13 23:08:47,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:47,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:47,563 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] [2025-04-13 23:08:47,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:08:47,564 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 23:08:47,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash 881191153, now seen corresponding path program 1 times [2025-04-13 23:08:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:47,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214517546] [2025-04-13 23:08:47,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:47,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:08:47,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:47,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:47,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:47,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214517546] [2025-04-13 23:08:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214517546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662607785] [2025-04-13 23:08:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:47,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:47,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:47,734 INFO L87 Difference]: Start difference. First operand 811 states and 2674 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:47,911 INFO L93 Difference]: Finished difference Result 1254 states and 3964 transitions. [2025-04-13 23:08:47,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:47,912 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:47,912 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:47,919 INFO L225 Difference]: With dead ends: 1254 [2025-04-13 23:08:47,919 INFO L226 Difference]: Without dead ends: 1089 [2025-04-13 23:08:47,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 23:08:47,920 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:47,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 39 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-04-13 23:08:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 929. [2025-04-13 23:08:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 3.324353448275862) internal successors, (3085), 928 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 3085 transitions. [2025-04-13 23:08:47,977 INFO L79 Accepts]: Start accepts. Automaton has 929 states and 3085 transitions. Word has length 22 [2025-04-13 23:08:47,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:47,977 INFO L485 AbstractCegarLoop]: Abstraction has 929 states and 3085 transitions. [2025-04-13 23:08:47,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:47,977 INFO L278 IsEmpty]: Start isEmpty. Operand 929 states and 3085 transitions. [2025-04-13 23:08:47,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:47,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:47,979 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] [2025-04-13 23:08:47,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:08:47,979 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 23:08:47,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 689307263, now seen corresponding path program 2 times [2025-04-13 23:08:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:47,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989997140] [2025-04-13 23:08:47,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:47,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:47,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:47,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:48,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989997140] [2025-04-13 23:08:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989997140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:48,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50064532] [2025-04-13 23:08:48,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:48,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:48,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:48,155 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 23:08:48,156 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 23:08:48,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:48,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:48,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:48,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:48,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:08:48,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:48,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50064532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:48,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 12 [2025-04-13 23:08:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461958457] [2025-04-13 23:08:48,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:48,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:08:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:48,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:08:48,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:08:48,809 INFO L87 Difference]: Start difference. First operand 929 states and 3085 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:49,454 INFO L93 Difference]: Finished difference Result 2272 states and 7126 transitions. [2025-04-13 23:08:49,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:08:49,455 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:49,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:49,465 INFO L225 Difference]: With dead ends: 2272 [2025-04-13 23:08:49,465 INFO L226 Difference]: Without dead ends: 2049 [2025-04-13 23:08:49,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:08:49,469 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 208 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:49,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 121 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-04-13 23:08:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1035. [2025-04-13 23:08:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 3.353965183752418) internal successors, (3468), 1034 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 3468 transitions. [2025-04-13 23:08:49,568 INFO L79 Accepts]: Start accepts. Automaton has 1035 states and 3468 transitions. Word has length 22 [2025-04-13 23:08:49,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:49,568 INFO L485 AbstractCegarLoop]: Abstraction has 1035 states and 3468 transitions. [2025-04-13 23:08:49,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,569 INFO L278 IsEmpty]: Start isEmpty. Operand 1035 states and 3468 transitions. [2025-04-13 23:08:49,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:49,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:49,572 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] [2025-04-13 23:08:49,578 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 23:08:49,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:49,773 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 23:08:49,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -414444603, now seen corresponding path program 3 times [2025-04-13 23:08:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:49,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210077661] [2025-04-13 23:08:49,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:49,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:49,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:49,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:08:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:49,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210077661] [2025-04-13 23:08:49,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210077661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:49,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:49,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:08:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198480989] [2025-04-13 23:08:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:49,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:49,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:49,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:49,920 INFO L87 Difference]: Start difference. First operand 1035 states and 3468 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:50,191 INFO L93 Difference]: Finished difference Result 1514 states and 4718 transitions. [2025-04-13 23:08:50,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:50,191 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:50,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:50,201 INFO L225 Difference]: With dead ends: 1514 [2025-04-13 23:08:50,201 INFO L226 Difference]: Without dead ends: 1367 [2025-04-13 23:08:50,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:08:50,204 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:50,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 31 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-04-13 23:08:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1029. [2025-04-13 23:08:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 3.3492217898832686) internal successors, (3443), 1028 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 3443 transitions. [2025-04-13 23:08:50,287 INFO L79 Accepts]: Start accepts. Automaton has 1029 states and 3443 transitions. Word has length 22 [2025-04-13 23:08:50,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:50,287 INFO L485 AbstractCegarLoop]: Abstraction has 1029 states and 3443 transitions. [2025-04-13 23:08:50,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,287 INFO L278 IsEmpty]: Start isEmpty. Operand 1029 states and 3443 transitions. [2025-04-13 23:08:50,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:50,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:50,289 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] [2025-04-13 23:08:50,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:08:50,289 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 23:08:50,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1773189137, now seen corresponding path program 4 times [2025-04-13 23:08:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:50,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480739907] [2025-04-13 23:08:50,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:50,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:50,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:50,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:50,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:50,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480739907] [2025-04-13 23:08:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480739907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:08:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160109715] [2025-04-13 23:08:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:50,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:50,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:50,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:50,384 INFO L87 Difference]: Start difference. First operand 1029 states and 3443 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:50,598 INFO L93 Difference]: Finished difference Result 1203 states and 3890 transitions. [2025-04-13 23:08:50,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:50,598 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:50,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:50,604 INFO L225 Difference]: With dead ends: 1203 [2025-04-13 23:08:50,604 INFO L226 Difference]: Without dead ends: 1099 [2025-04-13 23:08:50,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:50,605 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:50,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 25 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-04-13 23:08:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1001. [2025-04-13 23:08:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 3.359) internal successors, (3359), 1000 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 3359 transitions. [2025-04-13 23:08:50,672 INFO L79 Accepts]: Start accepts. Automaton has 1001 states and 3359 transitions. Word has length 22 [2025-04-13 23:08:50,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:50,672 INFO L485 AbstractCegarLoop]: Abstraction has 1001 states and 3359 transitions. [2025-04-13 23:08:50,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:50,673 INFO L278 IsEmpty]: Start isEmpty. Operand 1001 states and 3359 transitions. [2025-04-13 23:08:50,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:50,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:50,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:50,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:08:50,676 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 23:08:50,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1203960815, now seen corresponding path program 5 times [2025-04-13 23:08:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:50,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680631977] [2025-04-13 23:08:50,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:50,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:50,685 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:50,685 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:50,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680631977] [2025-04-13 23:08:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680631977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:50,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7866760] [2025-04-13 23:08:50,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:50,863 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 23:08:50,864 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 23:08:50,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:50,901 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:50,901 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:50,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:08:50,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:51,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7866760] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:51,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 14 [2025-04-13 23:08:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016248285] [2025-04-13 23:08:51,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:51,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:51,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:51,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:51,229 INFO L87 Difference]: Start difference. First operand 1001 states and 3359 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:52,305 INFO L93 Difference]: Finished difference Result 2810 states and 9296 transitions. [2025-04-13 23:08:52,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:08:52,306 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:52,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:52,319 INFO L225 Difference]: With dead ends: 2810 [2025-04-13 23:08:52,320 INFO L226 Difference]: Without dead ends: 2537 [2025-04-13 23:08:52,321 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:08:52,321 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 156 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:52,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 164 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:08:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-04-13 23:08:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 1293. [2025-04-13 23:08:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 3.486068111455108) internal successors, (4504), 1292 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 4504 transitions. [2025-04-13 23:08:52,466 INFO L79 Accepts]: Start accepts. Automaton has 1293 states and 4504 transitions. Word has length 22 [2025-04-13 23:08:52,466 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:52,466 INFO L485 AbstractCegarLoop]: Abstraction has 1293 states and 4504 transitions. [2025-04-13 23:08:52,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:52,466 INFO L278 IsEmpty]: Start isEmpty. Operand 1293 states and 4504 transitions. [2025-04-13 23:08:52,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:08:52,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:52,469 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] [2025-04-13 23:08:52,474 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 23:08:52,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:52,669 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 23:08:52,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash 260770991, now seen corresponding path program 6 times [2025-04-13 23:08:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:52,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285493964] [2025-04-13 23:08:52,670 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:52,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:08:52,679 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:08:52,680 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:52,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:52,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285493964] [2025-04-13 23:08:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285493964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:52,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:08:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185994590] [2025-04-13 23:08:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:52,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:08:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:52,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:08:52,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:08:52,759 INFO L87 Difference]: Start difference. First operand 1293 states and 4504 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:53,026 INFO L93 Difference]: Finished difference Result 1373 states and 4727 transitions. [2025-04-13 23:08:53,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:08:53,026 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:08:53,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:53,034 INFO L225 Difference]: With dead ends: 1373 [2025-04-13 23:08:53,034 INFO L226 Difference]: Without dead ends: 1317 [2025-04-13 23:08:53,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:08:53,035 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:53,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:08:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-04-13 23:08:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1255. [2025-04-13 23:08:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 3.5207336523126) internal successors, (4415), 1254 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 4415 transitions. [2025-04-13 23:08:53,168 INFO L79 Accepts]: Start accepts. Automaton has 1255 states and 4415 transitions. Word has length 22 [2025-04-13 23:08:53,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:53,168 INFO L485 AbstractCegarLoop]: Abstraction has 1255 states and 4415 transitions. [2025-04-13 23:08:53,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:53,168 INFO L278 IsEmpty]: Start isEmpty. Operand 1255 states and 4415 transitions. [2025-04-13 23:08:53,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:08:53,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:53,171 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 23:08:53,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:08:53,171 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 23:08:53,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1867789075, now seen corresponding path program 1 times [2025-04-13 23:08:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:53,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021279675] [2025-04-13 23:08:53,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:53,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:08:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:53,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:53,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021279675] [2025-04-13 23:08:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021279675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:53,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283781829] [2025-04-13 23:08:53,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:53,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:53,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:53,352 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 23:08:53,354 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 23:08:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:08:53,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:53,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:53,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:53,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:08:53,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:53,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283781829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:53,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-13 23:08:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047386214] [2025-04-13 23:08:53,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:53,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:53,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:53,897 INFO L87 Difference]: Start difference. First operand 1255 states and 4415 transitions. Second operand has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:54,792 INFO L93 Difference]: Finished difference Result 2798 states and 9442 transitions. [2025-04-13 23:08:54,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:08:54,792 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 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 23:08:54,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:54,810 INFO L225 Difference]: With dead ends: 2798 [2025-04-13 23:08:54,810 INFO L226 Difference]: Without dead ends: 2772 [2025-04-13 23:08:54,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:08:54,811 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 189 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:54,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 120 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2025-04-13 23:08:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 1591. [2025-04-13 23:08:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1590 states have (on average 3.5358490566037735) internal successors, (5622), 1590 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 5622 transitions. [2025-04-13 23:08:55,002 INFO L79 Accepts]: Start accepts. Automaton has 1591 states and 5622 transitions. Word has length 24 [2025-04-13 23:08:55,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:55,002 INFO L485 AbstractCegarLoop]: Abstraction has 1591 states and 5622 transitions. [2025-04-13 23:08:55,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:55,003 INFO L278 IsEmpty]: Start isEmpty. Operand 1591 states and 5622 transitions. [2025-04-13 23:08:55,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:08:55,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:55,006 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 23:08:55,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:08:55,207 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,SelfDestructingSolverStorable11 [2025-04-13 23:08:55,207 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 23:08:55,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1123550637, now seen corresponding path program 2 times [2025-04-13 23:08:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:55,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981344923] [2025-04-13 23:08:55,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:55,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:08:55,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:55,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:55,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:55,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981344923] [2025-04-13 23:08:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981344923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:55,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012089133] [2025-04-13 23:08:55,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:55,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:55,368 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 23:08:55,369 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 23:08:55,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:08:55,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:55,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:55,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:08:55,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:55,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012089133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:55,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:55,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-13 23:08:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303727843] [2025-04-13 23:08:55,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:55,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:08:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:55,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:08:55,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:08:55,928 INFO L87 Difference]: Start difference. First operand 1591 states and 5622 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:56,560 INFO L93 Difference]: Finished difference Result 2049 states and 7032 transitions. [2025-04-13 23:08:56,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:08:56,561 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 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 23:08:56,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:56,568 INFO L225 Difference]: With dead ends: 2049 [2025-04-13 23:08:56,568 INFO L226 Difference]: Without dead ends: 2020 [2025-04-13 23:08:56,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:08:56,569 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:56,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 149 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2025-04-13 23:08:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1665. [2025-04-13 23:08:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 3.527644230769231) internal successors, (5870), 1664 states have internal predecessors, (5870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 5870 transitions. [2025-04-13 23:08:56,778 INFO L79 Accepts]: Start accepts. Automaton has 1665 states and 5870 transitions. Word has length 24 [2025-04-13 23:08:56,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:56,779 INFO L485 AbstractCegarLoop]: Abstraction has 1665 states and 5870 transitions. [2025-04-13 23:08:56,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:56,779 INFO L278 IsEmpty]: Start isEmpty. Operand 1665 states and 5870 transitions. [2025-04-13 23:08:56,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:08:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:56,782 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 23:08:56,788 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 23:08:56,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:56,986 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 23:08:56,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -367474609, now seen corresponding path program 1 times [2025-04-13 23:08:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:56,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754713275] [2025-04-13 23:08:56,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:56,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:08:56,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:56,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:56,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:57,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754713275] [2025-04-13 23:08:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754713275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:57,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753798418] [2025-04-13 23:08:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:08:57,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:57,074 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 23:08:57,075 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 23:08:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:08:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:08:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:57,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:08:57,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:57,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753798418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:57,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 17 [2025-04-13 23:08:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586260019] [2025-04-13 23:08:57,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:57,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:08:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:57,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:08:57,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:08:57,355 INFO L87 Difference]: Start difference. First operand 1665 states and 5870 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:00,533 INFO L93 Difference]: Finished difference Result 5075 states and 17080 transitions. [2025-04-13 23:09:00,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 23:09:00,533 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 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 23:09:00,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:00,547 INFO L225 Difference]: With dead ends: 5075 [2025-04-13 23:09:00,547 INFO L226 Difference]: Without dead ends: 4893 [2025-04-13 23:09:00,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3252 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1460, Invalid=7096, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:09:00,550 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 575 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:00,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 274 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:09:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-04-13 23:09:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 2260. [2025-04-13 23:09:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2259 states have (on average 3.66489597166888) internal successors, (8279), 2259 states have internal predecessors, (8279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 8279 transitions. [2025-04-13 23:09:00,924 INFO L79 Accepts]: Start accepts. Automaton has 2260 states and 8279 transitions. Word has length 24 [2025-04-13 23:09:00,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:00,924 INFO L485 AbstractCegarLoop]: Abstraction has 2260 states and 8279 transitions. [2025-04-13 23:09:00,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:00,925 INFO L278 IsEmpty]: Start isEmpty. Operand 2260 states and 8279 transitions. [2025-04-13 23:09:00,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:09:00,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:00,928 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 23:09:00,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:01,128 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 23:09:01,129 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 23:09:01,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -936702931, now seen corresponding path program 2 times [2025-04-13 23:09:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:01,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840333277] [2025-04-13 23:09:01,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:01,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:09:01,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:09:01,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:01,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840333277] [2025-04-13 23:09:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840333277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:01,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350449801] [2025-04-13 23:09:01,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:01,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:01,236 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 23:09:01,250 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 23:09:01,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:09:01,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:09:01,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:01,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:09:01,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:01,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350449801] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:01,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:01,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2025-04-13 23:09:01,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792909618] [2025-04-13 23:09:01,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:01,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 23:09:01,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:01,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 23:09:01,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:09:01,585 INFO L87 Difference]: Start difference. First operand 2260 states and 8279 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:10,094 INFO L93 Difference]: Finished difference Result 11183 states and 40615 transitions. [2025-04-13 23:09:10,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-04-13 23:09:10,094 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:09:10,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:10,129 INFO L225 Difference]: With dead ends: 11183 [2025-04-13 23:09:10,129 INFO L226 Difference]: Without dead ends: 10761 [2025-04-13 23:09:10,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9668 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3507, Invalid=19445, Unknown=0, NotChecked=0, Total=22952 [2025-04-13 23:09:10,138 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 789 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:10,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 391 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:09:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2025-04-13 23:09:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 3820. [2025-04-13 23:09:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3820 states, 3819 states have (on average 3.8449855983241688) internal successors, (14684), 3819 states have internal predecessors, (14684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 14684 transitions. [2025-04-13 23:09:11,298 INFO L79 Accepts]: Start accepts. Automaton has 3820 states and 14684 transitions. Word has length 24 [2025-04-13 23:09:11,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:11,299 INFO L485 AbstractCegarLoop]: Abstraction has 3820 states and 14684 transitions. [2025-04-13 23:09:11,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:11,299 INFO L278 IsEmpty]: Start isEmpty. Operand 3820 states and 14684 transitions. [2025-04-13 23:09:11,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:09:11,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:11,307 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 23:09:11,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:09:11,511 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,SelfDestructingSolverStorable14 [2025-04-13 23:09:11,512 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 23:09:11,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1729977067, now seen corresponding path program 3 times [2025-04-13 23:09:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:11,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254244700] [2025-04-13 23:09:11,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:11,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:09:11,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:09:11,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:11,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:11,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254244700] [2025-04-13 23:09:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254244700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:11,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165785539] [2025-04-13 23:09:11,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:11,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:11,665 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 23:09:11,666 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 23:09:11,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:09:11,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:09:11,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:11,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:09:11,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:11,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165785539] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:12,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2025-04-13 23:09:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428251626] [2025-04-13 23:09:12,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:12,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:09:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:12,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:09:12,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:09:12,146 INFO L87 Difference]: Start difference. First operand 3820 states and 14684 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:16,371 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:28,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:32,846 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:37,037 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:41,258 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:45,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:49,637 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:09:53,912 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:05,972 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:10,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:14,195 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:22,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:30,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:34,370 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:38,402 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:42,422 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:50,462 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:54,532 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:10:58,543 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:02,825 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:07,202 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:11,261 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:15,276 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:27,396 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:31,415 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:35,427 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:39,441 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:43,449 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:47,559 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:51,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:11:55,793 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:07,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:11,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:15,928 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:19,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:23,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:27,996 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:32,020 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:36,028 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:40,036 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:44,045 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:12:48,131 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:00,229 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:04,238 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:08,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:12,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:16,495 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:20,562 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:24,683 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:28,703 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:32,713 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:36,720 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:40,734 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:42,134 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:46,179 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:50,187 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:54,201 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:13:58,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:02,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:06,250 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:10,312 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:14,319 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:18,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:22,580 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:26,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:30,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:34,838 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:38,844 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:42,906 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:46,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:50,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:54,943 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:14:59,004 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:03,032 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:07,312 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:11,341 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:19,577 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:23,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:27,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:31,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:36,094 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:40,104 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:44,473 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:48,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:53,009 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:15:57,015 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:01,060 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:05,237 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:09,261 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:13,328 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:17,367 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:21,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:29,741 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:33,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:37,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:41,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:16:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:41,984 INFO L93 Difference]: Finished difference Result 10647 states and 39534 transitions. [2025-04-13 23:16:41,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 23:16:41,984 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 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 23:16:41,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:42,014 INFO L225 Difference]: With dead ends: 10647 [2025-04-13 23:16:42,014 INFO L226 Difference]: Without dead ends: 10325 [2025-04-13 23:16:42,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=1465, Invalid=5004, Unknown=11, NotChecked=0, Total=6480 [2025-04-13 23:16:42,018 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 539 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 87 mSolverCounterUnsat, 95 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 382.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 95 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 383.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:42,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 274 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1647 Invalid, 95 Unknown, 0 Unchecked, 383.9s Time] [2025-04-13 23:16:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10325 states. [2025-04-13 23:16:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10325 to 4943. [2025-04-13 23:16:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4942 states have (on average 3.8749494131930393) internal successors, (19150), 4942 states have internal predecessors, (19150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 19150 transitions. [2025-04-13 23:16:43,168 INFO L79 Accepts]: Start accepts. Automaton has 4943 states and 19150 transitions. Word has length 24 [2025-04-13 23:16:43,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:43,168 INFO L485 AbstractCegarLoop]: Abstraction has 4943 states and 19150 transitions. [2025-04-13 23:16:43,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:43,169 INFO L278 IsEmpty]: Start isEmpty. Operand 4943 states and 19150 transitions. [2025-04-13 23:16:43,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:16:43,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:43,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:43,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 23:16:43,377 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,SelfDestructingSolverStorable15 [2025-04-13 23:16:43,377 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 23:16:43,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1612836713, now seen corresponding path program 3 times [2025-04-13 23:16:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:43,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136524313] [2025-04-13 23:16:43,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:43,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:43,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:43,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:43,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:43,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136524313] [2025-04-13 23:16:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136524313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:43,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45012529] [2025-04-13 23:16:43,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:43,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:43,585 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 23:16:43,587 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 23:16:43,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:43,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:43,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:43,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:43,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:16:43,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:43,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45012529] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:16:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 8] total 21 [2025-04-13 23:16:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799662523] [2025-04-13 23:16:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:44,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:16:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:44,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:16:44,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:16:44,467 INFO L87 Difference]: Start difference. First operand 4943 states and 19150 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:47,296 INFO L93 Difference]: Finished difference Result 6890 states and 25315 transitions. [2025-04-13 23:16:47,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:16:47,297 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:16:47,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:47,315 INFO L225 Difference]: With dead ends: 6890 [2025-04-13 23:16:47,315 INFO L226 Difference]: Without dead ends: 6795 [2025-04-13 23:16:47,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:16:47,318 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 239 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:47,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 92 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:16:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2025-04-13 23:16:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 4977. [2025-04-13 23:16:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4977 states, 4976 states have (on average 3.875) internal successors, (19282), 4976 states have internal predecessors, (19282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 19282 transitions. [2025-04-13 23:16:48,625 INFO L79 Accepts]: Start accepts. Automaton has 4977 states and 19282 transitions. Word has length 26 [2025-04-13 23:16:48,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:48,625 INFO L485 AbstractCegarLoop]: Abstraction has 4977 states and 19282 transitions. [2025-04-13 23:16:48,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:48,625 INFO L278 IsEmpty]: Start isEmpty. Operand 4977 states and 19282 transitions. [2025-04-13 23:16:48,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:16:48,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:48,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:48,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:16:48,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:16:48,835 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 23:16:48,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:48,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1814520853, now seen corresponding path program 4 times [2025-04-13 23:16:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:48,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582838094] [2025-04-13 23:16:48,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:48,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:48,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:16:48,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:48,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:49,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582838094] [2025-04-13 23:16:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582838094] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:49,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218416967] [2025-04-13 23:16:49,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:49,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:49,047 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 23:16:49,048 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 23:16:49,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:16:49,085 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:49,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:49,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:49,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:16:49,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:49,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218416967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:49,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2025-04-13 23:16:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883521627] [2025-04-13 23:16:49,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:49,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:16:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:49,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:16:49,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:16:49,524 INFO L87 Difference]: Start difference. First operand 4977 states and 19282 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:53,199 INFO L93 Difference]: Finished difference Result 8162 states and 30307 transitions. [2025-04-13 23:16:53,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:16:53,199 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:16:53,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:53,222 INFO L225 Difference]: With dead ends: 8162 [2025-04-13 23:16:53,222 INFO L226 Difference]: Without dead ends: 7641 [2025-04-13 23:16:53,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:16:53,225 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 359 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:53,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 238 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:16:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2025-04-13 23:16:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 5685. [2025-04-13 23:16:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5685 states, 5684 states have (on average 3.840429275158339) internal successors, (21829), 5684 states have internal predecessors, (21829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5685 states to 5685 states and 21829 transitions. [2025-04-13 23:16:54,722 INFO L79 Accepts]: Start accepts. Automaton has 5685 states and 21829 transitions. Word has length 26 [2025-04-13 23:16:54,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:54,723 INFO L485 AbstractCegarLoop]: Abstraction has 5685 states and 21829 transitions. [2025-04-13 23:16:54,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:54,723 INFO L278 IsEmpty]: Start isEmpty. Operand 5685 states and 21829 transitions. [2025-04-13 23:16:54,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:16:54,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:54,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:54,740 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 23:16:54,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 23:16:54,935 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 23:16:54,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1978809937, now seen corresponding path program 5 times [2025-04-13 23:16:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:54,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615857041] [2025-04-13 23:16:54,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:16:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:54,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:54,942 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:54,942 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:16:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:55,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615857041] [2025-04-13 23:16:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615857041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:55,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014681660] [2025-04-13 23:16:55,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:16:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:55,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:55,183 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 23:16:55,185 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 23:16:55,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 23:16:55,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:16:55,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:16:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:55,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:16:55,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:55,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014681660] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:16:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 8] total 18 [2025-04-13 23:16:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901778261] [2025-04-13 23:16:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:55,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:16:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:55,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:16:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:16:55,784 INFO L87 Difference]: Start difference. First operand 5685 states and 21829 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:58,793 INFO L93 Difference]: Finished difference Result 7404 states and 27262 transitions. [2025-04-13 23:16:58,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:16:58,793 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:16:58,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:58,811 INFO L225 Difference]: With dead ends: 7404 [2025-04-13 23:16:58,811 INFO L226 Difference]: Without dead ends: 7309 [2025-04-13 23:16:58,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:16:58,813 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:58,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 132 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:16:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2025-04-13 23:17:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 5809. [2025-04-13 23:17:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5809 states, 5808 states have (on average 3.833849862258953) internal successors, (22267), 5808 states have internal predecessors, (22267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 22267 transitions. [2025-04-13 23:17:00,306 INFO L79 Accepts]: Start accepts. Automaton has 5809 states and 22267 transitions. Word has length 26 [2025-04-13 23:17:00,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:00,306 INFO L485 AbstractCegarLoop]: Abstraction has 5809 states and 22267 transitions. [2025-04-13 23:17:00,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:00,306 INFO L278 IsEmpty]: Start isEmpty. Operand 5809 states and 22267 transitions. [2025-04-13 23:17:00,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:00,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:00,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:00,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:17:00,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:00,521 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 23:17:00,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1096451701, now seen corresponding path program 6 times [2025-04-13 23:17:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:00,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569425345] [2025-04-13 23:17:00,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:00,524 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:00,533 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:00,533 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:17:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:00,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569425345] [2025-04-13 23:17:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569425345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:00,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648926592] [2025-04-13 23:17:00,738 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:00,740 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 23:17:00,741 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 23:17:00,766 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:00,779 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:00,779 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:17:00,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:00,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:17:00,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:01,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648926592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:01,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:01,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-04-13 23:17:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144977158] [2025-04-13 23:17:01,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:01,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:17:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:01,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:17:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:17:01,548 INFO L87 Difference]: Start difference. First operand 5809 states and 22267 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:13,185 INFO L93 Difference]: Finished difference Result 15588 states and 56161 transitions. [2025-04-13 23:17:13,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 23:17:13,185 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:17:13,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:13,232 INFO L225 Difference]: With dead ends: 15588 [2025-04-13 23:17:13,232 INFO L226 Difference]: Without dead ends: 15138 [2025-04-13 23:17:13,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3250 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2061, Invalid=7641, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:17:13,239 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 744 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:13,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 552 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 23:17:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-04-13 23:17:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 6600. [2025-04-13 23:17:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6600 states, 6599 states have (on average 3.846643430822852) internal successors, (25384), 6599 states have internal predecessors, (25384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 25384 transitions. [2025-04-13 23:17:15,230 INFO L79 Accepts]: Start accepts. Automaton has 6600 states and 25384 transitions. Word has length 26 [2025-04-13 23:17:15,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:15,230 INFO L485 AbstractCegarLoop]: Abstraction has 6600 states and 25384 transitions. [2025-04-13 23:17:15,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:15,230 INFO L278 IsEmpty]: Start isEmpty. Operand 6600 states and 25384 transitions. [2025-04-13 23:17:15,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:15,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:15,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:15,247 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 23:17:15,442 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,SelfDestructingSolverStorable19 [2025-04-13 23:17:15,442 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 23:17:15,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash -255999731, now seen corresponding path program 4 times [2025-04-13 23:17:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:15,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270918680] [2025-04-13 23:17:15,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:15,445 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:15,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:15,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:15,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:15,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270918680] [2025-04-13 23:17:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270918680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:15,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117092985] [2025-04-13 23:17:15,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:15,695 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 23:17:15,718 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 23:17:15,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:15,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:15,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:15,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:15,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 23:17:15,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:16,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:16,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117092985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:16,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:16,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-13 23:17:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845989673] [2025-04-13 23:17:16,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:16,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:17:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:16,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:17:16,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:17:16,604 INFO L87 Difference]: Start difference. First operand 6600 states and 25384 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:23,872 INFO L93 Difference]: Finished difference Result 8672 states and 32210 transitions. [2025-04-13 23:17:23,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:17:23,872 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:17:23,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:23,894 INFO L225 Difference]: With dead ends: 8672 [2025-04-13 23:17:23,894 INFO L226 Difference]: Without dead ends: 8649 [2025-04-13 23:17:23,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=546, Invalid=2106, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 23:17:23,897 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 229 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:23,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 462 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:17:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8649 states. [2025-04-13 23:17:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8649 to 6643. [2025-04-13 23:17:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6642 states have (on average 3.845528455284553) internal successors, (25542), 6642 states have internal predecessors, (25542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 25542 transitions. [2025-04-13 23:17:25,848 INFO L79 Accepts]: Start accepts. Automaton has 6643 states and 25542 transitions. Word has length 26 [2025-04-13 23:17:25,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:25,849 INFO L485 AbstractCegarLoop]: Abstraction has 6643 states and 25542 transitions. [2025-04-13 23:17:25,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:25,849 INFO L278 IsEmpty]: Start isEmpty. Operand 6643 states and 25542 transitions. [2025-04-13 23:17:25,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:25,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:25,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:25,866 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 23:17:26,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:26,060 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 23:17:26,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 956932109, now seen corresponding path program 5 times [2025-04-13 23:17:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:26,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895250784] [2025-04-13 23:17:26,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:26,063 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:26,067 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:26,067 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:26,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:26,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895250784] [2025-04-13 23:17:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895250784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:26,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982575335] [2025-04-13 23:17:26,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:26,220 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 23:17:26,221 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 23:17:26,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:26,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:26,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:26,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:17:26,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:26,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982575335] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:26,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 21 [2025-04-13 23:17:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841561682] [2025-04-13 23:17:26,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:26,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:17:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:26,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:17:26,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:17:26,867 INFO L87 Difference]: Start difference. First operand 6643 states and 25542 transitions. Second operand has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 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 23:17:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:31,901 INFO L93 Difference]: Finished difference Result 9330 states and 34290 transitions. [2025-04-13 23:17:31,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:17:31,902 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 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 26 [2025-04-13 23:17:31,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:31,925 INFO L225 Difference]: With dead ends: 9330 [2025-04-13 23:17:31,925 INFO L226 Difference]: Without dead ends: 9297 [2025-04-13 23:17:31,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:17:31,928 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 252 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:31,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 294 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:17:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9297 states. [2025-04-13 23:17:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9297 to 6824. [2025-04-13 23:17:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 6823 states have (on average 3.848893448629635) internal successors, (26261), 6823 states have internal predecessors, (26261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 26261 transitions. [2025-04-13 23:17:34,003 INFO L79 Accepts]: Start accepts. Automaton has 6824 states and 26261 transitions. Word has length 26 [2025-04-13 23:17:34,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:34,003 INFO L485 AbstractCegarLoop]: Abstraction has 6824 states and 26261 transitions. [2025-04-13 23:17:34,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 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 23:17:34,003 INFO L278 IsEmpty]: Start isEmpty. Operand 6824 states and 26261 transitions. [2025-04-13 23:17:34,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:34,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:34,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:34,020 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 23:17:34,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:34,215 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 23:17:34,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1668332109, now seen corresponding path program 6 times [2025-04-13 23:17:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:34,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420523932] [2025-04-13 23:17:34,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:34,218 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:34,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:34,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:17:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:34,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420523932] [2025-04-13 23:17:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420523932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:34,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033969582] [2025-04-13 23:17:34,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:34,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:34,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:34,398 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 23:17:34,399 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 23:17:34,425 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:34,440 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:34,441 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:17:34,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:34,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:17:34,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:34,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033969582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:35,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2025-04-13 23:17:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514205502] [2025-04-13 23:17:35,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:35,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:17:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:35,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:17:35,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:17:35,349 INFO L87 Difference]: Start difference. First operand 6824 states and 26261 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 23:17:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:44,339 INFO L93 Difference]: Finished difference Result 9878 states and 36593 transitions. [2025-04-13 23:17:44,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 23:17:44,340 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 26 [2025-04-13 23:17:44,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:44,367 INFO L225 Difference]: With dead ends: 9878 [2025-04-13 23:17:44,367 INFO L226 Difference]: Without dead ends: 9844 [2025-04-13 23:17:44,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=957, Invalid=3599, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 23:17:44,370 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 329 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:44,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 674 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 23:17:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9844 states. [2025-04-13 23:17:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9844 to 7014. [2025-04-13 23:17:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 7013 states have (on average 3.846428062170255) internal successors, (26975), 7013 states have internal predecessors, (26975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 26975 transitions. [2025-04-13 23:17:46,642 INFO L79 Accepts]: Start accepts. Automaton has 7014 states and 26975 transitions. Word has length 26 [2025-04-13 23:17:46,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:46,643 INFO L485 AbstractCegarLoop]: Abstraction has 7014 states and 26975 transitions. [2025-04-13 23:17:46,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 23:17:46,643 INFO L278 IsEmpty]: Start isEmpty. Operand 7014 states and 26975 transitions. [2025-04-13 23:17:46,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:46,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:46,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:46,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:46,854 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,SelfDestructingSolverStorable22 [2025-04-13 23:17:46,855 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 23:17:46,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1952379963, now seen corresponding path program 7 times [2025-04-13 23:17:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:46,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560898392] [2025-04-13 23:17:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:17:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:17:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:46,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:46,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:47,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560898392] [2025-04-13 23:17:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560898392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:47,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008376251] [2025-04-13 23:17:47,005 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:17:47,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:47,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:47,007 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 23:17:47,007 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 23:17:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:17:47,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:47,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:47,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:47,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:17:47,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:47,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008376251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:47,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 17 [2025-04-13 23:17:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621805519] [2025-04-13 23:17:47,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:47,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:17:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:47,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:17:47,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:17:47,555 INFO L87 Difference]: Start difference. First operand 7014 states and 26975 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:53,521 INFO L93 Difference]: Finished difference Result 9100 states and 33896 transitions. [2025-04-13 23:17:53,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:17:53,522 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 23:17:53,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:53,545 INFO L225 Difference]: With dead ends: 9100 [2025-04-13 23:17:53,545 INFO L226 Difference]: Without dead ends: 9080 [2025-04-13 23:17:53,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:17:53,547 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 180 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:53,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 224 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:17:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9080 states. [2025-04-13 23:17:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9080 to 7160. [2025-04-13 23:17:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7160 states, 7159 states have (on average 3.853191786562369) internal successors, (27585), 7159 states have internal predecessors, (27585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 27585 transitions. [2025-04-13 23:17:55,902 INFO L79 Accepts]: Start accepts. Automaton has 7160 states and 27585 transitions. Word has length 26 [2025-04-13 23:17:55,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:55,903 INFO L485 AbstractCegarLoop]: Abstraction has 7160 states and 27585 transitions. [2025-04-13 23:17:55,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:55,903 INFO L278 IsEmpty]: Start isEmpty. Operand 7160 states and 27585 transitions. [2025-04-13 23:17:55,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:55,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:55,924 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 23:17:56,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:56,118 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 23:17:56,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash 467290637, now seen corresponding path program 8 times [2025-04-13 23:17:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:56,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7131744] [2025-04-13 23:17:56,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:56,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:56,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:56,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:56,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:56,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7131744] [2025-04-13 23:17:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7131744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:56,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789839945] [2025-04-13 23:17:56,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:56,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:56,327 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 23:17:56,328 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 23:17:56,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 23:17:56,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:56,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:56,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:56,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:17:56,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:56,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789839945] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:57,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2025-04-13 23:17:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958112375] [2025-04-13 23:17:57,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:57,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:17:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:57,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:17:57,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:17:57,209 INFO L87 Difference]: Start difference. First operand 7160 states and 27585 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 23:18:01,809 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:12,049 INFO L93 Difference]: Finished difference Result 10364 states and 38175 transitions. [2025-04-13 23:18:12,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:18:12,049 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 26 [2025-04-13 23:18:12,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:12,079 INFO L225 Difference]: With dead ends: 10364 [2025-04-13 23:18:12,079 INFO L226 Difference]: Without dead ends: 10330 [2025-04-13 23:18:12,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2381 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1169, Invalid=5803, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:18:12,083 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 422 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:12,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 523 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1992 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-04-13 23:18:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10330 states. [2025-04-13 23:18:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10330 to 7186. [2025-04-13 23:18:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7185 states have (on average 3.8533054975643704) internal successors, (27686), 7185 states have internal predecessors, (27686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 27686 transitions. [2025-04-13 23:18:14,731 INFO L79 Accepts]: Start accepts. Automaton has 7186 states and 27686 transitions. Word has length 26 [2025-04-13 23:18:14,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:14,731 INFO L485 AbstractCegarLoop]: Abstraction has 7186 states and 27686 transitions. [2025-04-13 23:18:14,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 23:18:14,731 INFO L278 IsEmpty]: Start isEmpty. Operand 7186 states and 27686 transitions. [2025-04-13 23:18:14,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:18:14,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:14,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:14,749 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 23:18:14,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:14,943 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 23:18:14,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1099993239, now seen corresponding path program 7 times [2025-04-13 23:18:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:14,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131459013] [2025-04-13 23:18:14,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:18:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:18:14,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:14,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:14,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:15,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131459013] [2025-04-13 23:18:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131459013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:15,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783813498] [2025-04-13 23:18:15,175 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:18:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:15,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:15,178 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 23:18:15,179 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 23:18:15,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:18:15,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:15,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:15,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:18:15,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:15,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783813498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:15,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 23:18:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222968906] [2025-04-13 23:18:15,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:15,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:18:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:15,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:18:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:18:15,879 INFO L87 Difference]: Start difference. First operand 7186 states and 27686 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 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 23:18:21,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:26,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:35,513 INFO L93 Difference]: Finished difference Result 15998 states and 59852 transitions. [2025-04-13 23:18:35,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 23:18:35,514 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 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 27 [2025-04-13 23:18:35,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:35,571 INFO L225 Difference]: With dead ends: 15998 [2025-04-13 23:18:35,571 INFO L226 Difference]: Without dead ends: 15676 [2025-04-13 23:18:35,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=963, Invalid=3327, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:18:35,577 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 927 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 117 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:35,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 441 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1921 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2025-04-13 23:18:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2025-04-13 23:18:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 8820. [2025-04-13 23:18:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8820 states, 8819 states have (on average 3.8786710511395848) internal successors, (34206), 8819 states have internal predecessors, (34206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8820 states to 8820 states and 34206 transitions. [2025-04-13 23:18:39,216 INFO L79 Accepts]: Start accepts. Automaton has 8820 states and 34206 transitions. Word has length 27 [2025-04-13 23:18:39,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:39,217 INFO L485 AbstractCegarLoop]: Abstraction has 8820 states and 34206 transitions. [2025-04-13 23:18:39,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 22 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 23:18:39,217 INFO L278 IsEmpty]: Start isEmpty. Operand 8820 states and 34206 transitions. [2025-04-13 23:18:39,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:18:39,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:39,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:39,236 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 23:18:39,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:39,431 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 23:18:39,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2109329367, now seen corresponding path program 1 times [2025-04-13 23:18:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:39,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418567373] [2025-04-13 23:18:39,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:18:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:39,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:18:39,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:18:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:39,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418567373] [2025-04-13 23:18:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418567373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:39,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642564883] [2025-04-13 23:18:39,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:18:39,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:39,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:39,537 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 23:18:39,540 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 23:18:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:18:39,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:18:39,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:39,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:39,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:18:39,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:18:39,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:18:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642564883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:39,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-04-13 23:18:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866307011] [2025-04-13 23:18:39,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:39,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:18:39,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:39,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:18:39,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:18:39,853 INFO L87 Difference]: Start difference. First operand 8820 states and 34206 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:44,402 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:48,574 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:52,866 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:18:57,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:19:01,584 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:19:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:15,808 INFO L93 Difference]: Finished difference Result 24335 states and 91271 transitions. [2025-04-13 23:19:15,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:19:15,809 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:19:15,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:15,889 INFO L225 Difference]: With dead ends: 24335 [2025-04-13 23:19:15,889 INFO L226 Difference]: Without dead ends: 23570 [2025-04-13 23:19:15,897 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=501, Invalid=1059, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 23:19:15,897 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 432 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 54 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:15,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 202 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 878 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2025-04-13 23:19:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23570 states. [2025-04-13 23:19:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23570 to 14094. [2025-04-13 23:19:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14094 states, 14093 states have (on average 3.9968069254239693) internal successors, (56327), 14093 states have internal predecessors, (56327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 56327 transitions. [2025-04-13 23:19:22,401 INFO L79 Accepts]: Start accepts. Automaton has 14094 states and 56327 transitions. Word has length 27 [2025-04-13 23:19:22,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:22,401 INFO L485 AbstractCegarLoop]: Abstraction has 14094 states and 56327 transitions. [2025-04-13 23:19:22,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:22,401 INFO L278 IsEmpty]: Start isEmpty. Operand 14094 states and 56327 transitions. [2025-04-13 23:19:22,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:19:22,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:22,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:22,432 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 23:19:22,627 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,SelfDestructingSolverStorable26 [2025-04-13 23:19:22,627 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 23:19:22,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1728824495, now seen corresponding path program 2 times [2025-04-13 23:19:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:22,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884996797] [2025-04-13 23:19:22,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:19:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:22,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:19:22,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:19:22,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:19:22,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:19:22,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:22,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884996797] [2025-04-13 23:19:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884996797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:22,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:22,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:19:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380007188] [2025-04-13 23:19:22,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:22,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:19:22,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:22,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:19:22,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:19:22,742 INFO L87 Difference]: Start difference. First operand 14094 states and 56327 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:32,727 INFO L93 Difference]: Finished difference Result 16219 states and 62720 transitions. [2025-04-13 23:19:32,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:19:32,728 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:19:32,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:32,787 INFO L225 Difference]: With dead ends: 16219 [2025-04-13 23:19:32,788 INFO L226 Difference]: Without dead ends: 15849 [2025-04-13 23:19:32,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:19:32,794 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:32,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 39 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:19:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15849 states. [2025-04-13 23:19:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15849 to 13935. [2025-04-13 23:19:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13935 states, 13934 states have (on average 3.9987799626812115) internal successors, (55719), 13934 states have internal predecessors, (55719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 55719 transitions. [2025-04-13 23:19:39,187 INFO L79 Accepts]: Start accepts. Automaton has 13935 states and 55719 transitions. Word has length 27 [2025-04-13 23:19:39,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:39,187 INFO L485 AbstractCegarLoop]: Abstraction has 13935 states and 55719 transitions. [2025-04-13 23:19:39,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:19:39,187 INFO L278 IsEmpty]: Start isEmpty. Operand 13935 states and 55719 transitions. [2025-04-13 23:19:39,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:19:39,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:39,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:39,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 23:19:39,219 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 23:19:39,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1483905269, now seen corresponding path program 3 times [2025-04-13 23:19:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:39,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667156930] [2025-04-13 23:19:39,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:39,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:19:39,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:19:39,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:19:39,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:39,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667156930] [2025-04-13 23:19:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667156930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:39,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612990664] [2025-04-13 23:19:39,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:39,428 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 23:19:39,430 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 23:19:39,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:19:39,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:19:39,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:19:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:39,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 23:19:39,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:39,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612990664] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:40,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 22 [2025-04-13 23:19:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267459602] [2025-04-13 23:19:40,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:40,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:19:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:19:40,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:19:40,042 INFO L87 Difference]: Start difference. First operand 13935 states and 55719 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:13,041 INFO L93 Difference]: Finished difference Result 35486 states and 137665 transitions. [2025-04-13 23:20:13,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-04-13 23:20:13,042 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:20:13,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:13,159 INFO L225 Difference]: With dead ends: 35486 [2025-04-13 23:20:13,160 INFO L226 Difference]: Without dead ends: 34906 [2025-04-13 23:20:13,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3474, Invalid=13556, Unknown=0, NotChecked=0, Total=17030 [2025-04-13 23:20:13,171 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1002 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:13,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 380 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 23:20:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2025-04-13 23:20:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 17530. [2025-04-13 23:20:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17530 states, 17529 states have (on average 4.0502025215357405) internal successors, (70996), 17529 states have internal predecessors, (70996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17530 states to 17530 states and 70996 transitions. [2025-04-13 23:20:22,255 INFO L79 Accepts]: Start accepts. Automaton has 17530 states and 70996 transitions. Word has length 27 [2025-04-13 23:20:22,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:22,255 INFO L485 AbstractCegarLoop]: Abstraction has 17530 states and 70996 transitions. [2025-04-13 23:20:22,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:22,255 INFO L278 IsEmpty]: Start isEmpty. Operand 17530 states and 70996 transitions. [2025-04-13 23:20:22,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:20:22,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:22,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:22,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 23:20:22,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 23:20:22,493 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 23:20:22,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash -420061901, now seen corresponding path program 4 times [2025-04-13 23:20:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:22,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065452700] [2025-04-13 23:20:22,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:20:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:22,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:20:22,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:20:22,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:20:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:22,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065452700] [2025-04-13 23:20:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065452700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:22,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13032617] [2025-04-13 23:20:22,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:20:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:22,698 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 23:20:22,699 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 23:20:22,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:20:22,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:20:22,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:20:22,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:22,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:20:22,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:23,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13032617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:20:23,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:20:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-04-13 23:20:23,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036449998] [2025-04-13 23:20:23,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:20:23,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:20:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:23,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:20:23,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:20:23,536 INFO L87 Difference]: Start difference. First operand 17530 states and 70996 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:43,687 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:20:52,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:11,329 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:19,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:26,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:30,930 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:35,038 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:21:42,698 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 23:22:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:03,740 INFO L93 Difference]: Finished difference Result 33954 states and 132913 transitions. [2025-04-13 23:22:03,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-04-13 23:22:03,741 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:22:03,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:03,907 INFO L225 Difference]: With dead ends: 33954 [2025-04-13 23:22:03,907 INFO L226 Difference]: Without dead ends: 33374 [2025-04-13 23:22:03,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8315 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=4494, Invalid=15525, Unknown=3, NotChecked=0, Total=20022 [2025-04-13 23:22:03,923 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 914 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 142 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:03,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 378 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2439 Invalid, 8 Unknown, 0 Unchecked, 36.3s Time] [2025-04-13 23:22:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33374 states. [2025-04-13 23:22:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33374 to 16131. [2025-04-13 23:22:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16131 states, 16130 states have (on average 4.030688158710477) internal successors, (65015), 16130 states have internal predecessors, (65015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16131 states to 16131 states and 65015 transitions. [2025-04-13 23:22:13,468 INFO L79 Accepts]: Start accepts. Automaton has 16131 states and 65015 transitions. Word has length 27 [2025-04-13 23:22:13,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:13,468 INFO L485 AbstractCegarLoop]: Abstraction has 16131 states and 65015 transitions. [2025-04-13 23:22:13,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:13,468 INFO L278 IsEmpty]: Start isEmpty. Operand 16131 states and 65015 transitions. [2025-04-13 23:22:13,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:22:13,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:13,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:13,509 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 23:22:13,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:13,704 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 23:22:13,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -525769745, now seen corresponding path program 8 times [2025-04-13 23:22:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:13,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920817866] [2025-04-13 23:22:13,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:22:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:13,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:22:13,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:22:13,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:13,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:13,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920817866] [2025-04-13 23:22:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920817866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:22:13,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576987105] [2025-04-13 23:22:13,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:22:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:13,856 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 23:22:13,857 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 23:22:13,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:22:13,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:22:13,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:13,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 23:22:13,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:22:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:14,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:22:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576987105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:22:15,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:22:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 19 [2025-04-13 23:22:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957099375] [2025-04-13 23:22:15,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:22:15,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 23:22:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:15,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 23:22:15,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:22:15,980 INFO L87 Difference]: Start difference. First operand 16131 states and 65015 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:38,745 INFO L93 Difference]: Finished difference Result 24553 states and 95753 transitions. [2025-04-13 23:22:38,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:22:38,745 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:22:38,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:38,847 INFO L225 Difference]: With dead ends: 24553 [2025-04-13 23:22:38,848 INFO L226 Difference]: Without dead ends: 23522 [2025-04-13 23:22:38,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:22:38,858 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 368 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:38,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 266 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:22:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23522 states. [2025-04-13 23:22:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23522 to 17947. [2025-04-13 23:22:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17947 states, 17946 states have (on average 4.011868940153795) internal successors, (71997), 17946 states have internal predecessors, (71997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17947 states to 17947 states and 71997 transitions. [2025-04-13 23:22:50,655 INFO L79 Accepts]: Start accepts. Automaton has 17947 states and 71997 transitions. Word has length 27 [2025-04-13 23:22:50,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:50,656 INFO L485 AbstractCegarLoop]: Abstraction has 17947 states and 71997 transitions. [2025-04-13 23:22:50,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:50,656 INFO L278 IsEmpty]: Start isEmpty. Operand 17947 states and 71997 transitions. [2025-04-13 23:22:50,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:22:50,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:50,690 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:50,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 23:22:50,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:50,891 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 23:22:50,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1044775287, now seen corresponding path program 9 times [2025-04-13 23:22:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:50,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222560661] [2025-04-13 23:22:50,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:22:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:50,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:22:50,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:22:50,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:22:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:51,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222560661] [2025-04-13 23:22:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222560661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:22:51,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047745797] [2025-04-13 23:22:51,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:22:51,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:51,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:51,082 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 23:22:51,083 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 23:22:51,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:22:51,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:22:51,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:22:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:51,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:22:51,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:22:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:51,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:22:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047745797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:22:51,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:22:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 23 [2025-04-13 23:22:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399048897] [2025-04-13 23:22:51,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:22:51,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 23:22:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:51,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 23:22:51,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:22:51,708 INFO L87 Difference]: Start difference. First operand 17947 states and 71997 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 23:23:04,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 23:23:04,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1050, Invalid=3372, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 23:23:04,388 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 696 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:04,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 326 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:23:04,390 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:23:04,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 23:23:04,407 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:23:04,409 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 23:23:04,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:23:04,592 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (17947states) and FLOYD_HOARE automaton (currently 60 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (9923 states constructed, input type IntersectNwa). [2025-04-13 23:23:04,594 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:23:04,594 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:23:04,594 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:23:04,597 INFO L422 BasicCegarLoop]: Path program histogram: [9, 8, 6, 4, 3, 1, 1] [2025-04-13 23:23:04,598 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:23:04,599 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:23:04,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:23:04 BasicIcfg [2025-04-13 23:23:04,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:23:04,600 INFO L158 Benchmark]: Toolchain (without parser) took 861184.31ms. Allocated memory was 113.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 78.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-13 23:23:04,600 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:04,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 113.2MB. Free memory was 77.5MB in the beginning and 63.0MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:23:04,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.67ms. Allocated memory is still 113.2MB. Free memory was 63.0MB in the beginning and 61.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:23:04,601 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 113.2MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:04,601 INFO L158 Benchmark]: IcfgBuilder took 325.34ms. Allocated memory is still 113.2MB. Free memory was 59.9MB in the beginning and 33.6MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:23:04,601 INFO L158 Benchmark]: TraceAbstraction took 860574.72ms. Allocated memory was 113.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 33.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-13 23:23:04,601 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.21ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 113.2MB. Free memory was 77.5MB in the beginning and 63.0MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.67ms. Allocated memory is still 113.2MB. Free memory was 63.0MB in the beginning and 61.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 113.2MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 325.34ms. Allocated memory is still 113.2MB. Free memory was 59.9MB in the beginning and 33.6MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 860574.72ms. Allocated memory was 113.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 33.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. 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: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17947states) and FLOYD_HOARE automaton (currently 60 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (9923 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (17947states) and FLOYD_HOARE automaton (currently 60 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (9923 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (17947states) and FLOYD_HOARE automaton (currently 60 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (9923 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (17947states) and FLOYD_HOARE automaton (currently 60 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (9923 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 860.5s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.3s, AutomataDifference: 765.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 111 mSolverCounterUnknown, 10205 SdHoareTripleChecker+Valid, 479.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10205 mSDsluCounter, 6988 SdHoareTripleChecker+Invalid, 475.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6126 mSDsCounter, 1436 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31265 IncrementalHoareTripleChecker+Invalid, 32812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1436 mSolverCounterUnsat, 862 mSDtfsCounter, 31265 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2344 GetRequests, 955 SyntacticMatches, 13 SemanticMatches, 1376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43739 ImplicationChecksByTransitivity, 126.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17947occurred in iteration=31, InterpolantAutomatonStates: 1190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 68.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 104905 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 1381 NumberOfCodeBlocks, 1381 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 1903 ConstructedInterpolants, 57 QuantifiedInterpolants, 21783 SizeOfPredicates, 121 NumberOfNonLiveVariables, 3243 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 80 InterpolantComputations, 12 PerfectInterpolantSequences, 36/190 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