/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:33:27,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:33:27,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:33:27,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:33:27,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:33:27,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:33:27,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:33:27,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:33:27,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:33:27,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:33:27,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:33:27,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:33:27,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:33:27,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:33:27,391 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:33:27,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:33:27,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:33:27,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:33:27,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:33:27,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:33:27,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:33:27,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:33:27,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:33:27,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:33:27,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:33:27,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:33:27,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:33:27,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:33:27,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:33:27,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:33:27,638 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:33:27,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2025-04-13 17:33:28,909 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b052ba/9e5457c0c5d747328a0fc5ecdb3816d8/FLAG4fd190025 [2025-04-13 17:33:29,076 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:33:29,077 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2025-04-13 17:33:29,082 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b052ba/9e5457c0c5d747328a0fc5ecdb3816d8/FLAG4fd190025 [2025-04-13 17:33:29,910 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b052ba/9e5457c0c5d747328a0fc5ecdb3816d8 [2025-04-13 17:33:29,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:33:29,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:33:29,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:33:29,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:33:29,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:33:29,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:33:29" (1/1) ... [2025-04-13 17:33:29,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb06448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:29, skipping insertion in model container [2025-04-13 17:33:29,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:33:29" (1/1) ... [2025-04-13 17:33:29,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:33:30,090 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/bench-exp2x3.wvr.c[2289,2302] [2025-04-13 17:33:30,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:33:30,104 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:33:30,133 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/bench-exp2x3.wvr.c[2289,2302] [2025-04-13 17:33:30,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:33:30,150 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:33:30,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30 WrapperNode [2025-04-13 17:33:30,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:33:30,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:33:30,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:33:30,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:33:30,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,185 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 17:33:30,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:33:30,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:33:30,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:33:30,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:33:30,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,214 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 17:33:30,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:33:30,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:33:30,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:33:30,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:33:30,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (1/1) ... [2025-04-13 17:33:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:33:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:30,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:33:30,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:33:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:33:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:33:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:33:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:33:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:33:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 17:33:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 17:33:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 17:33:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 17:33:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:33:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:33:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:33:30,283 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:33:30,340 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:33:30,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:33:30,464 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:33:30,465 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:33:30,465 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:33:30,592 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:33:30,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:33:30 BoogieIcfgContainer [2025-04-13 17:33:30,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:33:30,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:33:30,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:33:30,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:33:30,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:33:29" (1/3) ... [2025-04-13 17:33:30,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60acc5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:33:30, skipping insertion in model container [2025-04-13 17:33:30,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:33:30" (2/3) ... [2025-04-13 17:33:30,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60acc5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:33:30, skipping insertion in model container [2025-04-13 17:33:30,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:33:30" (3/3) ... [2025-04-13 17:33:30,600 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-04-13 17:33:30,609 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:33:30,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 17:33:30,611 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:33:30,649 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 17:33:30,669 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 17:33:30,714 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:30,732 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:33:30,740 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;@29d072db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:33:30,740 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:33:30,745 INFO L278 IsEmpty]: Start isEmpty. Operand has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:30,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:33:30,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:30,755 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 17:33:30,755 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:30,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1108043139, now seen corresponding path program 1 times [2025-04-13 17:33:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:30,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438047846] [2025-04-13 17:33:30,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:33:30,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:33:30,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:30,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:33:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:31,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438047846] [2025-04-13 17:33:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438047846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:33:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244436817] [2025-04-13 17:33:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:31,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:33:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:31,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:33:31,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:33:31,162 INFO L87 Difference]: Start difference. First operand has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 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 17:33:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:31,300 INFO L93 Difference]: Finished difference Result 556 states and 2283 transitions. [2025-04-13 17:33:31,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:33:31,302 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 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 17:33:31,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:31,318 INFO L225 Difference]: With dead ends: 556 [2025-04-13 17:33:31,318 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 17:33:31,321 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 17:33:31,323 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:31,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 17:33:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-04-13 17:33:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 4.12956204379562) internal successors, (2263), 548 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 2263 transitions. [2025-04-13 17:33:31,421 INFO L79 Accepts]: Start accepts. Automaton has 549 states and 2263 transitions. Word has length 22 [2025-04-13 17:33:31,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:31,423 INFO L485 AbstractCegarLoop]: Abstraction has 549 states and 2263 transitions. [2025-04-13 17:33:31,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 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 17:33:31,424 INFO L278 IsEmpty]: Start isEmpty. Operand 549 states and 2263 transitions. [2025-04-13 17:33:31,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:31,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:31,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:31,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:33:31,431 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:31,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1834322786, now seen corresponding path program 1 times [2025-04-13 17:33:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:31,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85095719] [2025-04-13 17:33:31,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:31,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:31,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:31,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:31,587 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 17:33:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:31,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85095719] [2025-04-13 17:33:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85095719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:31,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558782528] [2025-04-13 17:33:31,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:31,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:33:31,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 17:33:31,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:33:31,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:31,843 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 17:33:31,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:31,915 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 17:33:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558782528] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:31,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:31,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:33:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449741357] [2025-04-13 17:33:31,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:31,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:33:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:31,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:33:31,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:33:31,917 INFO L87 Difference]: Start difference. First operand 549 states and 2263 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 17:33:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:32,125 INFO L93 Difference]: Finished difference Result 966 states and 3923 transitions. [2025-04-13 17:33:32,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:32,126 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 23 [2025-04-13 17:33:32,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:32,134 INFO L225 Difference]: With dead ends: 966 [2025-04-13 17:33:32,134 INFO L226 Difference]: Without dead ends: 882 [2025-04-13 17:33:32,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:32,135 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:32,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 21 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-04-13 17:33:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 677. [2025-04-13 17:33:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 4.2766272189349115) internal successors, (2891), 676 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2891 transitions. [2025-04-13 17:33:32,216 INFO L79 Accepts]: Start accepts. Automaton has 677 states and 2891 transitions. Word has length 23 [2025-04-13 17:33:32,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:32,216 INFO L485 AbstractCegarLoop]: Abstraction has 677 states and 2891 transitions. [2025-04-13 17:33:32,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 17:33:32,217 INFO L278 IsEmpty]: Start isEmpty. Operand 677 states and 2891 transitions. [2025-04-13 17:33:32,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:32,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:32,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:32,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:33:32,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:32,423 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:32,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:32,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1425208633, now seen corresponding path program 1 times [2025-04-13 17:33:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:32,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526269864] [2025-04-13 17:33:32,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:32,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:32,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:32,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:32,518 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 17:33:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:32,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526269864] [2025-04-13 17:33:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526269864] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:32,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96054561] [2025-04-13 17:33:32,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:32,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:32,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:33:32,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 17:33:32,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:32,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:32,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:32,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:32,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:33:32,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:32,713 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 17:33:32,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:32,765 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 17:33:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96054561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:32,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:33:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213823775] [2025-04-13 17:33:32,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:32,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:33:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:32,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:33:32,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:33:32,766 INFO L87 Difference]: Start difference. First operand 677 states and 2891 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:32,990 INFO L93 Difference]: Finished difference Result 1125 states and 4776 transitions. [2025-04-13 17:33:32,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:32,990 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:32,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:32,999 INFO L225 Difference]: With dead ends: 1125 [2025-04-13 17:33:33,000 INFO L226 Difference]: Without dead ends: 1054 [2025-04-13 17:33:33,001 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:33,004 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:33,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 25 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-04-13 17:33:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 871. [2025-04-13 17:33:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 4.4126436781609195) internal successors, (3839), 870 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 3839 transitions. [2025-04-13 17:33:33,130 INFO L79 Accepts]: Start accepts. Automaton has 871 states and 3839 transitions. Word has length 23 [2025-04-13 17:33:33,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:33,130 INFO L485 AbstractCegarLoop]: Abstraction has 871 states and 3839 transitions. [2025-04-13 17:33:33,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,130 INFO L278 IsEmpty]: Start isEmpty. Operand 871 states and 3839 transitions. [2025-04-13 17:33:33,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:33,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:33,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:33,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:33,338 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,SelfDestructingSolverStorable2 [2025-04-13 17:33:33,338 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:33,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1496813134, now seen corresponding path program 1 times [2025-04-13 17:33:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:33,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775398960] [2025-04-13 17:33:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:33,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:33,441 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 17:33:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:33,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775398960] [2025-04-13 17:33:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775398960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:33,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851468046] [2025-04-13 17:33:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:33,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:33,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:33,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:33,443 INFO L87 Difference]: Start difference. First operand 871 states and 3839 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:33,668 INFO L93 Difference]: Finished difference Result 1055 states and 4463 transitions. [2025-04-13 17:33:33,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:33,669 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:33,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:33,676 INFO L225 Difference]: With dead ends: 1055 [2025-04-13 17:33:33,676 INFO L226 Difference]: Without dead ends: 971 [2025-04-13 17:33:33,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:33,677 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:33,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-04-13 17:33:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 884. [2025-04-13 17:33:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 4.362400906002265) internal successors, (3852), 883 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3852 transitions. [2025-04-13 17:33:33,783 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 3852 transitions. Word has length 23 [2025-04-13 17:33:33,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:33,784 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 3852 transitions. [2025-04-13 17:33:33,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:33,784 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 3852 transitions. [2025-04-13 17:33:33,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:33,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:33,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:33,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:33:33,787 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:33,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1414182149, now seen corresponding path program 1 times [2025-04-13 17:33:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:33,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696926183] [2025-04-13 17:33:33,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:33,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:33:33,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:33,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:33,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:33,845 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 17:33:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:33,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696926183] [2025-04-13 17:33:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696926183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:33,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:33,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519227772] [2025-04-13 17:33:33,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:33,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:33,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:33,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:33,846 INFO L87 Difference]: Start difference. First operand 884 states and 3852 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:34,042 INFO L93 Difference]: Finished difference Result 1170 states and 4812 transitions. [2025-04-13 17:33:34,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:34,042 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:34,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:34,049 INFO L225 Difference]: With dead ends: 1170 [2025-04-13 17:33:34,050 INFO L226 Difference]: Without dead ends: 1026 [2025-04-13 17:33:34,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:34,052 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:34,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-04-13 17:33:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 908. [2025-04-13 17:33:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 4.282249173098125) internal successors, (3884), 907 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 3884 transitions. [2025-04-13 17:33:34,143 INFO L79 Accepts]: Start accepts. Automaton has 908 states and 3884 transitions. Word has length 23 [2025-04-13 17:33:34,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:34,143 INFO L485 AbstractCegarLoop]: Abstraction has 908 states and 3884 transitions. [2025-04-13 17:33:34,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,144 INFO L278 IsEmpty]: Start isEmpty. Operand 908 states and 3884 transitions. [2025-04-13 17:33:34,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:34,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:34,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:34,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:33:34,147 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:34,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1528942486, now seen corresponding path program 2 times [2025-04-13 17:33:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:34,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729978462] [2025-04-13 17:33:34,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:34,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:34,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:34,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:34,231 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 17:33:34,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:34,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729978462] [2025-04-13 17:33:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729978462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:34,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124056139] [2025-04-13 17:33:34,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:34,234 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:33:34,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 17:33:34,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:34,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:34,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:34,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:33:34,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:34,380 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 17:33:34,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:34,424 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 17:33:34,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124056139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:34,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:33:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599169441] [2025-04-13 17:33:34,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:34,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:33:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:34,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:33:34,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:33:34,425 INFO L87 Difference]: Start difference. First operand 908 states and 3884 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:34,629 INFO L93 Difference]: Finished difference Result 1131 states and 4788 transitions. [2025-04-13 17:33:34,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:34,630 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:34,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:34,637 INFO L225 Difference]: With dead ends: 1131 [2025-04-13 17:33:34,638 INFO L226 Difference]: Without dead ends: 1055 [2025-04-13 17:33:34,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:34,640 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:34,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-04-13 17:33:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 988. [2025-04-13 17:33:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 4.313069908814589) internal successors, (4257), 987 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 4257 transitions. [2025-04-13 17:33:34,721 INFO L79 Accepts]: Start accepts. Automaton has 988 states and 4257 transitions. Word has length 23 [2025-04-13 17:33:34,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:34,721 INFO L485 AbstractCegarLoop]: Abstraction has 988 states and 4257 transitions. [2025-04-13 17:33:34,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:34,721 INFO L278 IsEmpty]: Start isEmpty. Operand 988 states and 4257 transitions. [2025-04-13 17:33:34,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:34,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:34,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:34,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:33:34,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:34,925 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:34,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2088547561, now seen corresponding path program 2 times [2025-04-13 17:33:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:34,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078220213] [2025-04-13 17:33:34,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:34,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:34,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:34,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:34,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:34,990 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 17:33:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:34,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078220213] [2025-04-13 17:33:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078220213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:34,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:34,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:34,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070152848] [2025-04-13 17:33:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:34,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:34,991 INFO L87 Difference]: Start difference. First operand 988 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:35,210 INFO L93 Difference]: Finished difference Result 1130 states and 4713 transitions. [2025-04-13 17:33:35,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:35,210 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:35,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:35,218 INFO L225 Difference]: With dead ends: 1130 [2025-04-13 17:33:35,218 INFO L226 Difference]: Without dead ends: 1039 [2025-04-13 17:33:35,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:35,222 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:35,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 19 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-04-13 17:33:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1012. [2025-04-13 17:33:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 4.247279920870425) internal successors, (4294), 1011 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 4294 transitions. [2025-04-13 17:33:35,328 INFO L79 Accepts]: Start accepts. Automaton has 1012 states and 4294 transitions. Word has length 23 [2025-04-13 17:33:35,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:35,329 INFO L485 AbstractCegarLoop]: Abstraction has 1012 states and 4294 transitions. [2025-04-13 17:33:35,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,329 INFO L278 IsEmpty]: Start isEmpty. Operand 1012 states and 4294 transitions. [2025-04-13 17:33:35,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:35,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:35,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:35,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:33:35,333 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:35,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 958723165, now seen corresponding path program 2 times [2025-04-13 17:33:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:35,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823017162] [2025-04-13 17:33:35,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:35,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:35,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:35,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:35,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:35,389 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 17:33:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:35,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823017162] [2025-04-13 17:33:35,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823017162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:35,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261317349] [2025-04-13 17:33:35,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:35,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:35,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:33:35,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 17:33:35,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:35,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:35,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:35,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:33:35,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:33:35,532 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 17:33:35,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:33:35,580 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 17:33:35,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261317349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:33:35,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:33:35,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:33:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576599694] [2025-04-13 17:33:35,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:33:35,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:33:35,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:35,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:33:35,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:33:35,581 INFO L87 Difference]: Start difference. First operand 1012 states and 4294 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:35,835 INFO L93 Difference]: Finished difference Result 1426 states and 5910 transitions. [2025-04-13 17:33:35,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:35,836 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:35,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:35,844 INFO L225 Difference]: With dead ends: 1426 [2025-04-13 17:33:35,844 INFO L226 Difference]: Without dead ends: 1274 [2025-04-13 17:33:35,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:33:35,845 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:35,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-04-13 17:33:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1142. [2025-04-13 17:33:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 4.2839614373356705) internal successors, (4888), 1141 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 4888 transitions. [2025-04-13 17:33:35,955 INFO L79 Accepts]: Start accepts. Automaton has 1142 states and 4888 transitions. Word has length 23 [2025-04-13 17:33:35,955 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:35,955 INFO L485 AbstractCegarLoop]: Abstraction has 1142 states and 4888 transitions. [2025-04-13 17:33:35,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:35,955 INFO L278 IsEmpty]: Start isEmpty. Operand 1142 states and 4888 transitions. [2025-04-13 17:33:35,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:33:35,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:35,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:35,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:33:36,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:36,158 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:36,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1038664158, now seen corresponding path program 2 times [2025-04-13 17:33:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:36,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76513441] [2025-04-13 17:33:36,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:36,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:33:36,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:33:36,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:33:36,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:36,203 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 17:33:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:36,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76513441] [2025-04-13 17:33:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76513441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:33:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728379707] [2025-04-13 17:33:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:36,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:33:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:36,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:33:36,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:33:36,204 INFO L87 Difference]: Start difference. First operand 1142 states and 4888 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:36,402 INFO L93 Difference]: Finished difference Result 1446 states and 5886 transitions. [2025-04-13 17:33:36,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:33:36,403 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:33:36,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:36,411 INFO L225 Difference]: With dead ends: 1446 [2025-04-13 17:33:36,412 INFO L226 Difference]: Without dead ends: 1240 [2025-04-13 17:33:36,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:33:36,414 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:36,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:33:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-04-13 17:33:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1182. [2025-04-13 17:33:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 4.201524132091448) internal successors, (4962), 1181 states have internal predecessors, (4962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 4962 transitions. [2025-04-13 17:33:36,533 INFO L79 Accepts]: Start accepts. Automaton has 1182 states and 4962 transitions. Word has length 23 [2025-04-13 17:33:36,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:36,533 INFO L485 AbstractCegarLoop]: Abstraction has 1182 states and 4962 transitions. [2025-04-13 17:33:36,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:33:36,534 INFO L278 IsEmpty]: Start isEmpty. Operand 1182 states and 4962 transitions. [2025-04-13 17:33:36,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:33:36,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:36,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:36,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:33:36,536 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:33:36,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1861754688, now seen corresponding path program 1 times [2025-04-13 17:33:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:36,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965328079] [2025-04-13 17:33:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:36,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:33:36,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:33:36,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:36,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:36,937 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 17:33:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:36,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965328079] [2025-04-13 17:33:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965328079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:33:36,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436084527] [2025-04-13 17:33:36,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:33:36,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:33:36,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:33:36,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:33:36,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 17:33:36,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:33:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:33:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:37,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:33:37,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:35:38,738 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:36:34,057 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:36:47,904 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 17:36:52,180 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 17:36:52,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:37:19,089 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 17:37:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436084527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:37:19,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:37:19,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2025-04-13 17:37:19,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875461244] [2025-04-13 17:37:19,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:37:19,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:37:19,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:19,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:37:19,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=189, Unknown=22, NotChecked=0, Total=272 [2025-04-13 17:37:19,091 INFO L87 Difference]: Start difference. First operand 1182 states and 4962 transitions. Second operand has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:37:32,427 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 48 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:37:41,658 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 17:37:45,660 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 17:37:49,667 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 17:37:58,768 WARN L286 SmtUtils]: Spent 8.97s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:38:03,413 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 17:38:07,961 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 17:38:11,032 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:38:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:28,660 INFO L93 Difference]: Finished difference Result 2620 states and 10383 transitions. [2025-04-13 17:38:28,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:38:28,660 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:38:28,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:28,674 INFO L225 Difference]: With dead ends: 2620 [2025-04-13 17:38:28,674 INFO L226 Difference]: Without dead ends: 2354 [2025-04-13 17:38:28,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 163.6s TimeCoverageRelationStatistics Valid=144, Invalid=433, Unknown=23, NotChecked=0, Total=600 [2025-04-13 17:38:28,676 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 241 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:28,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 104 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 651 Invalid, 5 Unknown, 0 Unchecked, 29.8s Time] [2025-04-13 17:38:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-04-13 17:38:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1470. [2025-04-13 17:38:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 4.323349217154527) internal successors, (6351), 1469 states have internal predecessors, (6351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 6351 transitions. [2025-04-13 17:38:28,875 INFO L79 Accepts]: Start accepts. Automaton has 1470 states and 6351 transitions. Word has length 24 [2025-04-13 17:38:28,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:28,875 INFO L485 AbstractCegarLoop]: Abstraction has 1470 states and 6351 transitions. [2025-04-13 17:38:28,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:28,875 INFO L278 IsEmpty]: Start isEmpty. Operand 1470 states and 6351 transitions. [2025-04-13 17:38:28,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:38:28,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:28,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:28,885 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 17:38:29,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 17:38:29,083 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:38:29,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1555958440, now seen corresponding path program 1 times [2025-04-13 17:38:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:29,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572593301] [2025-04-13 17:38:29,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:29,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:38:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:29,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:29,435 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 17:38:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:29,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572593301] [2025-04-13 17:38:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572593301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:29,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123863121] [2025-04-13 17:38:29,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:29,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:38:29,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 17:38:29,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:38:29,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:29,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:29,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:29,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:38:29,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:30,285 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 17:38:30,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:30,788 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 17:38:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123863121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:30,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-13 17:38:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713983400] [2025-04-13 17:38:30,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:30,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:38:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:30,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:38:30,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:38:30,789 INFO L87 Difference]: Start difference. First operand 1470 states and 6351 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 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 17:38:37,724 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 17:38:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:39,124 INFO L93 Difference]: Finished difference Result 2029 states and 8527 transitions. [2025-04-13 17:38:39,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:38:39,124 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 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 24 [2025-04-13 17:38:39,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:39,135 INFO L225 Difference]: With dead ends: 2029 [2025-04-13 17:38:39,135 INFO L226 Difference]: Without dead ends: 1996 [2025-04-13 17:38:39,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:38:39,136 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 85 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:39,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 100 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 495 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-04-13 17:38:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-04-13 17:38:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1731. [2025-04-13 17:38:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 4.344508670520232) internal successors, (7516), 1730 states have internal predecessors, (7516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 7516 transitions. [2025-04-13 17:38:39,359 INFO L79 Accepts]: Start accepts. Automaton has 1731 states and 7516 transitions. Word has length 24 [2025-04-13 17:38:39,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:39,359 INFO L485 AbstractCegarLoop]: Abstraction has 1731 states and 7516 transitions. [2025-04-13 17:38:39,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 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 17:38:39,359 INFO L278 IsEmpty]: Start isEmpty. Operand 1731 states and 7516 transitions. [2025-04-13 17:38:39,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:38:39,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:39,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:38:39,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 17:38:39,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:39,564 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:38:39,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1176246138, now seen corresponding path program 2 times [2025-04-13 17:38:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:39,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-13 17:38:39,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:39,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:38:39,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:39,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:39,881 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 17:38:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:39,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-13 17:38:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613842661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:39,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703826833] [2025-04-13 17:38:39,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:39,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:38:39,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 17:38:39,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:38:39,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:39,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:39,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:38:39,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:12,640 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 17:39:12,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:13,536 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 17:39:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703826833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:39:13,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:39:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 17:39:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010221776] [2025-04-13 17:39:13,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:39:13,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:39:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:39:13,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:39:13,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:39:13,538 INFO L87 Difference]: Start difference. First operand 1731 states and 7516 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 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 17:39:17,897 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 17:39:23,854 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:39:27,860 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 17:39:37,021 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 17:39:41,025 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 17:39:46,203 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 17:39:50,206 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 17:39:54,847 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 17:39:57,569 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:01,093 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:05,095 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 17:40:09,100 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 17:40:13,411 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 17:40:15,085 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:19,092 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 17:40:28,627 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 17:40:34,311 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 17:40:38,317 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 17:40:41,552 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:42,821 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:44,403 INFO L93 Difference]: Finished difference Result 2927 states and 12297 transitions. [2025-04-13 17:40:44,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:40:44,404 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 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 24 [2025-04-13 17:40:44,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:44,414 INFO L225 Difference]: With dead ends: 2927 [2025-04-13 17:40:44,414 INFO L226 Difference]: Without dead ends: 2782 [2025-04-13 17:40:44,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=128, Invalid=332, Unknown=2, NotChecked=0, Total=462 [2025-04-13 17:40:44,415 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 18 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:44,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 128 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 571 Invalid, 14 Unknown, 0 Unchecked, 75.7s Time] [2025-04-13 17:40:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-04-13 17:40:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 1959. [2025-04-13 17:40:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1958 states have (on average 4.422880490296221) internal successors, (8660), 1958 states have internal predecessors, (8660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 8660 transitions. [2025-04-13 17:40:44,721 INFO L79 Accepts]: Start accepts. Automaton has 1959 states and 8660 transitions. Word has length 24 [2025-04-13 17:40:44,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:44,721 INFO L485 AbstractCegarLoop]: Abstraction has 1959 states and 8660 transitions. [2025-04-13 17:40:44,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 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 17:40:44,721 INFO L278 IsEmpty]: Start isEmpty. Operand 1959 states and 8660 transitions. [2025-04-13 17:40:44,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:40:44,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:44,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:40:44,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 17:40:44,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:44,926 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:40:44,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -387787614, now seen corresponding path program 2 times [2025-04-13 17:40:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:44,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733288649] [2025-04-13 17:40:44,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:40:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:44,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:40:44,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:40:44,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:40:44,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:45,236 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 17:40:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:45,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733288649] [2025-04-13 17:40:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733288649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:45,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153034836] [2025-04-13 17:40:45,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:40:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:45,239 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:40:45,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 17:40:45,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:40:45,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:40:45,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:40:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:45,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 17:40:45,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:10,280 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:42:35,182 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 17:42:35,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:43:06,442 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 17:43:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153034836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:43:06,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:43:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 17:43:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118146410] [2025-04-13 17:43:06,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:43:06,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:43:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:43:06,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:43:06,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=160, Unknown=17, NotChecked=0, Total=240 [2025-04-13 17:43:06,443 INFO L87 Difference]: Start difference. First operand 1959 states and 8660 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:43:18,826 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 48 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:43:35,573 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 17:43:37,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:39,587 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:41,944 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:43,843 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:50,592 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 49 DAG size of output: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:44:05,128 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:09,130 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 17:44:13,579 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 17:44:16,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:26,280 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 17:44:27,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:31,817 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 17:44:44,365 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 17:44:48,418 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 17:44:53,055 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 17:44:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:53,700 INFO L93 Difference]: Finished difference Result 3616 states and 15214 transitions. [2025-04-13 17:44:53,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:44:53,701 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:44:53,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:53,712 INFO L225 Difference]: With dead ends: 3616 [2025-04-13 17:44:53,712 INFO L226 Difference]: Without dead ends: 3341 [2025-04-13 17:44:53,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 146.0s TimeCoverageRelationStatistics Valid=202, Invalid=477, Unknown=23, NotChecked=0, Total=702 [2025-04-13 17:44:53,714 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 224 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 41 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:53,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 139 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 683 Invalid, 8 Unknown, 0 Unchecked, 55.5s Time] [2025-04-13 17:44:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2025-04-13 17:44:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 2276. [2025-04-13 17:44:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2275 states have (on average 4.477802197802198) internal successors, (10187), 2275 states have internal predecessors, (10187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 10187 transitions. [2025-04-13 17:44:54,161 INFO L79 Accepts]: Start accepts. Automaton has 2276 states and 10187 transitions. Word has length 24 [2025-04-13 17:44:54,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:54,162 INFO L485 AbstractCegarLoop]: Abstraction has 2276 states and 10187 transitions. [2025-04-13 17:44:54,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:54,162 INFO L278 IsEmpty]: Start isEmpty. Operand 2276 states and 10187 transitions. [2025-04-13 17:44:54,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:54,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:54,166 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:54,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 17:44:54,366 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,SelfDestructingSolverStorable12 [2025-04-13 17:44:54,366 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:44:54,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1992901764, now seen corresponding path program 3 times [2025-04-13 17:44:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:54,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438002260] [2025-04-13 17:44:54,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:54,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:54,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:54,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:54,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:54,467 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 17:44:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:54,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438002260] [2025-04-13 17:44:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438002260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:54,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933542864] [2025-04-13 17:44:54,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:54,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:54,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:54,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:44:54,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 17:44:54,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:54,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:54,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:54,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:44:54,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:55,348 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 17:44:55,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:58,143 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 17:44:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933542864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:58,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 17:44:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571969813] [2025-04-13 17:44:58,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:58,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:44:58,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:58,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:44:58,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:44:58,144 INFO L87 Difference]: Start difference. First operand 2276 states and 10187 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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 17:45:00,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:03,586 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:05,508 INFO L93 Difference]: Finished difference Result 3923 states and 16717 transitions. [2025-04-13 17:45:05,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:45:05,508 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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 25 [2025-04-13 17:45:05,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:05,522 INFO L225 Difference]: With dead ends: 3923 [2025-04-13 17:45:05,522 INFO L226 Difference]: Without dead ends: 3697 [2025-04-13 17:45:05,523 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:45:05,524 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 272 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:05,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 108 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-04-13 17:45:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2025-04-13 17:45:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 2504. [2025-04-13 17:45:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 4.619256891729924) internal successors, (11562), 2503 states have internal predecessors, (11562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 11562 transitions. [2025-04-13 17:45:06,184 INFO L79 Accepts]: Start accepts. Automaton has 2504 states and 11562 transitions. Word has length 25 [2025-04-13 17:45:06,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:06,184 INFO L485 AbstractCegarLoop]: Abstraction has 2504 states and 11562 transitions. [2025-04-13 17:45:06,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 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 17:45:06,184 INFO L278 IsEmpty]: Start isEmpty. Operand 2504 states and 11562 transitions. [2025-04-13 17:45:06,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:45:06,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:06,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:06,195 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 17:45:06,389 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,SelfDestructingSolverStorable13 [2025-04-13 17:45:06,390 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:45:06,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -705603304, now seen corresponding path program 4 times [2025-04-13 17:45:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:06,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 17:45:06,390 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:06,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:06,400 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:06,400 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:06,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:06,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 17:45:06,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037078783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:06,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333196596] [2025-04-13 17:45:06,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:06,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:06,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:06,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:06,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 17:45:06,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:06,550 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:06,550 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:06,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:06,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:45:06,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:07,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333196596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:08,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:45:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346657233] [2025-04-13 17:45:08,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:08,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:45:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:08,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:45:08,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:45:08,462 INFO L87 Difference]: Start difference. First operand 2504 states and 11562 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:12,101 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:16,074 INFO L93 Difference]: Finished difference Result 3640 states and 15624 transitions. [2025-04-13 17:45:16,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:45:16,074 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:45:16,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:16,087 INFO L225 Difference]: With dead ends: 3640 [2025-04-13 17:45:16,087 INFO L226 Difference]: Without dead ends: 3301 [2025-04-13 17:45:16,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:45:16,091 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:16,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 130 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-04-13 17:45:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2025-04-13 17:45:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2592. [2025-04-13 17:45:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 4.556541875723659) internal successors, (11806), 2591 states have internal predecessors, (11806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 11806 transitions. [2025-04-13 17:45:16,666 INFO L79 Accepts]: Start accepts. Automaton has 2592 states and 11806 transitions. Word has length 25 [2025-04-13 17:45:16,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:16,666 INFO L485 AbstractCegarLoop]: Abstraction has 2592 states and 11806 transitions. [2025-04-13 17:45:16,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:16,666 INFO L278 IsEmpty]: Start isEmpty. Operand 2592 states and 11806 transitions. [2025-04-13 17:45:16,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:45:16,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:16,671 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:16,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:16,871 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,SelfDestructingSolverStorable14 [2025-04-13 17:45:16,872 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:45:16,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1702596722, now seen corresponding path program 3 times [2025-04-13 17:45:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:16,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880570185] [2025-04-13 17:45:16,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:16,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:16,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:16,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:16,952 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 17:45:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:16,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880570185] [2025-04-13 17:45:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880570185] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:16,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459599755] [2025-04-13 17:45:16,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:16,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:16,954 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:16,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 17:45:16,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:17,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:17,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:17,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:45:17,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:19,395 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 17:45:19,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:21,002 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 17:45:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459599755] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:21,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 17:45:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104397115] [2025-04-13 17:45:21,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:21,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:45:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:21,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:45:21,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:45:21,003 INFO L87 Difference]: Start difference. First operand 2592 states and 11806 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:38,375 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:47,245 INFO L93 Difference]: Finished difference Result 5644 states and 25052 transitions. [2025-04-13 17:45:47,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:45:47,245 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:45:47,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:47,263 INFO L225 Difference]: With dead ends: 5644 [2025-04-13 17:45:47,264 INFO L226 Difference]: Without dead ends: 5499 [2025-04-13 17:45:47,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=262, Invalid=928, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:45:47,266 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 469 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:47,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 184 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2025-04-13 17:45:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2025-04-13 17:45:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 3391. [2025-04-13 17:45:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3390 states have (on average 4.687610619469027) internal successors, (15891), 3390 states have internal predecessors, (15891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 15891 transitions. [2025-04-13 17:45:48,195 INFO L79 Accepts]: Start accepts. Automaton has 3391 states and 15891 transitions. Word has length 25 [2025-04-13 17:45:48,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:48,195 INFO L485 AbstractCegarLoop]: Abstraction has 3391 states and 15891 transitions. [2025-04-13 17:45:48,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:48,195 INFO L278 IsEmpty]: Start isEmpty. Operand 3391 states and 15891 transitions. [2025-04-13 17:45:48,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:45:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:48,202 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:45:48,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:48,406 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,SelfDestructingSolverStorable15 [2025-04-13 17:45:48,406 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:45:48,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 517142809, now seen corresponding path program 4 times [2025-04-13 17:45:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:48,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860856804] [2025-04-13 17:45:48,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:48,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:48,426 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:48,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:48,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:48,706 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 17:45:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:48,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860856804] [2025-04-13 17:45:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860856804] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:48,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739808139] [2025-04-13 17:45:48,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:48,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:48,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:48,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:45:48,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 17:45:48,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:48,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:48,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:45:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:48,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:45:48,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:49,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:54,531 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 17:45:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739808139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:54,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2025-04-13 17:45:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191498433] [2025-04-13 17:45:54,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:54,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:45:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:54,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:45:54,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:45:54,533 INFO L87 Difference]: Start difference. First operand 3391 states and 15891 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:03,668 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:46:07,380 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:46:13,121 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 17:46:16,398 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:46:20,426 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 17:46:21,997 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:46:25,998 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 17:46:30,002 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 17:46:46,571 WARN L286 SmtUtils]: Spent 16.47s on a formula simplification. DAG size of input: 94 DAG size of output: 88 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:46:50,263 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:46:54,267 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 17:46:58,356 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 17:47:09,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:11,117 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:15,285 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 17:47:25,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:27,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:31,169 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 17:47:33,298 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:46,624 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:50,789 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 17:47:55,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 17:48:06,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:48:06,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=261, Invalid=996, Unknown=3, NotChecked=0, Total=1260 [2025-04-13 17:48:06,736 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 358 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 68 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:06,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 281 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1004 Invalid, 9 Unknown, 0 Unchecked, 76.0s Time] [2025-04-13 17:48:06,737 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 17:48:06,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 17:48:06,767 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:48:06,767 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 17:48:06,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 17:48:06,938 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). [2025-04-13 17:48:06,939 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 17:48:06,940 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 17:48:06,940 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 17:48:06,940 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 17:48:06,941 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 1] [2025-04-13 17:48:06,943 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:48:06,943 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:48:06,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:48:06 BasicIcfg [2025-04-13 17:48:06,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:48:06,945 INFO L158 Benchmark]: Toolchain (without parser) took 877032.47ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 109.6MB in the beginning and 467.8MB in the end (delta: -358.2MB). Peak memory consumption was 702.3MB. Max. memory is 8.0GB. [2025-04-13 17:48:06,945 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:48:06,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.38ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 95.0MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:48:06,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 93.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:48:06,947 INFO L158 Benchmark]: Boogie Preprocessor took 42.66ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:48:06,947 INFO L158 Benchmark]: RCFGBuilder took 359.86ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 61.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 17:48:06,949 INFO L158 Benchmark]: TraceAbstraction took 876351.01ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 60.9MB in the beginning and 467.8MB in the end (delta: -406.9MB). Peak memory consumption was 656.2MB. Max. memory is 8.0GB. [2025-04-13 17:48:06,950 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.38ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 95.0MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 93.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.66ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 359.86ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 61.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 876351.01ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 60.9MB in the beginning and 467.8MB in the end (delta: -406.9MB). Peak memory consumption was 656.2MB. 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: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3391states) and FLOYD_HOARE automaton (currently 35 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (5425 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 876.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 451.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 2311 SdHoareTripleChecker+Valid, 275.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2311 mSDsluCounter, 1364 SdHoareTripleChecker+Invalid, 273.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1136 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6544 IncrementalHoareTripleChecker+Invalid, 6818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 228 mSDtfsCounter, 6544 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 471 SyntacticMatches, 9 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 423.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3391occurred in iteration=16, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 7924 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 416.3s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 19530 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 41 InterpolantComputations, 5 PerfectInterpolantSequences, 9/88 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