/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:48:10,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:48:10,457 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:48:10,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:48:10,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:48:10,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:48:10,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:48:10,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:48:10,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:48:10,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:48:10,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:48:10,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:48:10,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:48:10,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:48:10,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:48:10,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:48:10,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:48:10,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:48:10,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:48:10,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:48:10,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:48:10,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:48:10,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:48:10,488 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:48:10,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:48:10,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:48:10,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:48:10,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:48:10,695 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:48:10,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-04-13 17:48:11,980 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cbac708/5c874ea869ae48fd9ff44485d20bfa6f/FLAGdf0fa08e0 [2025-04-13 17:48:12,189 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:48:12,190 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-04-13 17:48:12,195 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cbac708/5c874ea869ae48fd9ff44485d20bfa6f/FLAGdf0fa08e0 [2025-04-13 17:48:13,027 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cbac708/5c874ea869ae48fd9ff44485d20bfa6f [2025-04-13 17:48:13,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:48:13,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:48:13,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:48:13,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:48:13,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:48:13,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c49445b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13, skipping insertion in model container [2025-04-13 17:48:13,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:48:13,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3331,3344] [2025-04-13 17:48:13,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:48:13,214 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:48:13,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3331,3344] [2025-04-13 17:48:13,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:48:13,274 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:48:13,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13 WrapperNode [2025-04-13 17:48:13,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:48:13,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:48:13,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:48:13,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:48:13,280 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:48:13" (1/1) ... [2025-04-13 17:48:13,290 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:48:13" (1/1) ... [2025-04-13 17:48:13,320 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 277 [2025-04-13 17:48:13,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:48:13,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:48:13,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:48:13,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:48:13,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,355 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-04-13 17:48:13,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:48:13,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:48:13,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:48:13,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:48:13,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (1/1) ... [2025-04-13 17:48:13,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:48:13,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:13,399 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:48:13,401 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:48:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:48:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:48:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:48:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:48:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:48:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:48:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:48:13,422 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:48:13,519 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:48:13,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:48:13,849 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:48:13,850 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:48:13,850 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:48:14,134 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:48:14,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:48:14 BoogieIcfgContainer [2025-04-13 17:48:14,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:48:14,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:48:14,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:48:14,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:48:14,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:48:13" (1/3) ... [2025-04-13 17:48:14,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4ed527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:48:14, skipping insertion in model container [2025-04-13 17:48:14,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:48:13" (2/3) ... [2025-04-13 17:48:14,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4ed527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:48:14, skipping insertion in model container [2025-04-13 17:48:14,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:48:14" (3/3) ... [2025-04-13 17:48:14,141 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-04-13 17:48:14,151 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:48:14,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 17:48:14,152 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:48:14,199 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:48:14,222 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 17:48:14,229 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:14,249 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:48:14,258 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;@7f7002d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:48:14,258 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:48:14,259 INFO L278 IsEmpty]: Start isEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:14,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:48:14,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:14,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:14,262 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:14,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1139469918, now seen corresponding path program 1 times [2025-04-13 17:48:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:14,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293011331] [2025-04-13 17:48:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:14,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:48:14,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:48:14,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:14,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:14,684 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:48:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:14,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293011331] [2025-04-13 17:48:14,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293011331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:14,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:48:14,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:48:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156206116] [2025-04-13 17:48:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:14,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:48:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:14,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:48:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:48:14,706 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:14,763 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2025-04-13 17:48:14,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:48:14,765 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-04-13 17:48:14,765 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:14,769 INFO L225 Difference]: With dead ends: 43 [2025-04-13 17:48:14,770 INFO L226 Difference]: Without dead ends: 23 [2025-04-13 17:48:14,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:48:14,775 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:14,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:48:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-04-13 17:48:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-13 17:48:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-04-13 17:48:14,796 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 14 [2025-04-13 17:48:14,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:14,796 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-04-13 17:48:14,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:14,796 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2025-04-13 17:48:14,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:48:14,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:14,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:14,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:48:14,797 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:14,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash -103848455, now seen corresponding path program 1 times [2025-04-13 17:48:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:14,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039201985] [2025-04-13 17:48:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:14,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:48:14,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:48:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:48:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:15,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039201985] [2025-04-13 17:48:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039201985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:48:15,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:48:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199965891] [2025-04-13 17:48:15,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:15,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:48:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:15,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:48:15,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:48:15,012 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:15,058 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2025-04-13 17:48:15,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:48:15,059 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-04-13 17:48:15,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:15,059 INFO L225 Difference]: With dead ends: 43 [2025-04-13 17:48:15,059 INFO L226 Difference]: Without dead ends: 24 [2025-04-13 17:48:15,060 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:48:15,060 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:15,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:48:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-13 17:48:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-13 17:48:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-04-13 17:48:15,064 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 15 [2025-04-13 17:48:15,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:15,064 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-04-13 17:48:15,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,064 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2025-04-13 17:48:15,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:48:15,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:15,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:15,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:48:15,065 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:15,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2090748883, now seen corresponding path program 1 times [2025-04-13 17:48:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:15,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352366198] [2025-04-13 17:48:15,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:15,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:48:15,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:48:15,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:48:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:15,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352366198] [2025-04-13 17:48:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352366198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:48:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:48:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452355514] [2025-04-13 17:48:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:15,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:48:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:15,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:48:15,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:48:15,221 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:15,257 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2025-04-13 17:48:15,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:48:15,257 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-04-13 17:48:15,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:15,258 INFO L225 Difference]: With dead ends: 43 [2025-04-13 17:48:15,258 INFO L226 Difference]: Without dead ends: 25 [2025-04-13 17:48:15,258 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:48:15,259 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:15,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:48:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-13 17:48:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-13 17:48:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2025-04-13 17:48:15,261 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 16 [2025-04-13 17:48:15,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:15,261 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2025-04-13 17:48:15,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,261 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2025-04-13 17:48:15,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:48:15,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:15,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:15,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:48:15,262 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:15,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -586217470, now seen corresponding path program 1 times [2025-04-13 17:48:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:15,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323114937] [2025-04-13 17:48:15,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:15,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:48:15,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:48:15,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:15,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 17:48:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:15,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323114937] [2025-04-13 17:48:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323114937] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:15,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817008314] [2025-04-13 17:48:15,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:15,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:15,466 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:48:15,476 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:48:15,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:48:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:48:15,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:15,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:15,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:48:15,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 17:48:15,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:48:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817008314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:48:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-13 17:48:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334629919] [2025-04-13 17:48:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:15,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:48:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:15,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:48:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:48:15,626 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:15,664 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2025-04-13 17:48:15,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:48:15,665 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 17:48:15,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:15,665 INFO L225 Difference]: With dead ends: 43 [2025-04-13 17:48:15,665 INFO L226 Difference]: Without dead ends: 26 [2025-04-13 17:48:15,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:48:15,666 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:15,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:48:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-13 17:48:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-13 17:48:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-04-13 17:48:15,670 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2025-04-13 17:48:15,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:15,670 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-04-13 17:48:15,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:15,670 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2025-04-13 17:48:15,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:48:15,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:15,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:15,677 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:48:15,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:15,871 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:15,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1742957108, now seen corresponding path program 1 times [2025-04-13 17:48:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:15,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258288174] [2025-04-13 17:48:15,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:48:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:15,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:48:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:48:15,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:15,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:48:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:16,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258288174] [2025-04-13 17:48:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258288174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:48:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:48:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029335125] [2025-04-13 17:48:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:16,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:48:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:16,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:48:16,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:48:16,878 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:16,973 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-04-13 17:48:16,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:48:16,975 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 17:48:16,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:16,975 INFO L225 Difference]: With dead ends: 31 [2025-04-13 17:48:16,975 INFO L226 Difference]: Without dead ends: 21 [2025-04-13 17:48:16,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:48:16,976 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:16,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:48:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-13 17:48:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-13 17:48:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-04-13 17:48:16,981 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 18 [2025-04-13 17:48:16,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:16,981 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-04-13 17:48:16,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:16,981 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-04-13 17:48:16,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:48:16,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:16,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:48:16,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:48:16,982 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:48:16,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1577022412, now seen corresponding path program 2 times [2025-04-13 17:48:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:16,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112209125] [2025-04-13 17:48:16,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:48:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:16,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 17:48:17,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-04-13 17:48:17,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:48:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 17:48:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:17,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112209125] [2025-04-13 17:48:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112209125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:48:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:48:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:48:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552867949] [2025-04-13 17:48:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:48:17,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:48:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:17,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:48:17,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:48:17,604 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:17,671 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2025-04-13 17:48:17,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:48:17,672 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-13 17:48:17,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:17,672 INFO L225 Difference]: With dead ends: 21 [2025-04-13 17:48:17,672 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:48:17,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:48:17,673 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:17,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:48:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:48:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:48:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:48:17,674 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-04-13 17:48:17,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:17,674 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:48:17,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,674 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:48:17,674 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:48:17,676 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:48:17,676 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:48:17,676 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:48:17,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:48:17,678 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-13 17:48:17,679 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:48:17,679 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:48:17,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:48:17 BasicIcfg [2025-04-13 17:48:17,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:48:17,682 INFO L158 Benchmark]: Toolchain (without parser) took 4651.09ms. Allocated memory was 155.2MB in the beginning and 348.1MB in the end (delta: 192.9MB). Free memory was 107.1MB in the beginning and 254.9MB in the end (delta: -147.7MB). Peak memory consumption was 42.7MB. Max. memory is 8.0GB. [2025-04-13 17:48:17,682 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:48:17,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.04ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 91.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 17:48:17,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.97ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 88.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:48:17,682 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 85.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:48:17,682 INFO L158 Benchmark]: RCFGBuilder took 762.25ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 52.3MB in the end (delta: 33.0MB). Peak memory consumption was 70.0MB. Max. memory is 8.0GB. [2025-04-13 17:48:17,683 INFO L158 Benchmark]: TraceAbstraction took 3545.02ms. Allocated memory was 155.2MB in the beginning and 348.1MB in the end (delta: 192.9MB). Free memory was 51.4MB in the beginning and 254.9MB in the end (delta: -203.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:48:17,687 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.14ms. Allocated memory is still 163.6MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.04ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 91.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.97ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 88.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 85.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 762.25ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 52.3MB in the end (delta: 33.0MB). Peak memory consumption was 70.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3545.02ms. Allocated memory was 155.2MB in the beginning and 348.1MB in the end (delta: 192.9MB). Free memory was 51.4MB in the beginning and 254.9MB in the end (delta: -203.4MB). There was no memory consumed. 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 - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 115 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 673 SizeOfPredicates, 2 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 16/17 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:48:17,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...