/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/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:23:21,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:23:21,674 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:23:21,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:23:21,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:23:21,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:23:21,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:23:21,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:23:21,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:23:21,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:23:21,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:23:21,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:23:21,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:23:21,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:23:21,706 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:23:21,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:23:21,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:23:21,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:21,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:21,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:23:21,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:23:21,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:23:21,709 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:23:21,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:23:21,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:23:21,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:23:21,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:23:21,954 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:23:21,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:23,233 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f32cedcd/b94877477ec246e3aba9fdf5b331899f/FLAG34176ffee [2025-04-13 17:23:23,485 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:23:23,486 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:23,503 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f32cedcd/b94877477ec246e3aba9fdf5b331899f/FLAG34176ffee [2025-04-13 17:23:24,234 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f32cedcd/b94877477ec246e3aba9fdf5b331899f [2025-04-13 17:23:24,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:23:24,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:23:24,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:23:24,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:23:24,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:23:24,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c46314b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24, skipping insertion in model container [2025-04-13 17:23:24,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:23:24,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-04-13 17:23:24,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:23:24,589 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:23:24,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-04-13 17:23:24,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:23:24,694 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:23:24,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24 WrapperNode [2025-04-13 17:23:24,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:23:24,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:23:24,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:23:24,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:23:24,699 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:23:24" (1/1) ... [2025-04-13 17:23:24,712 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:23:24" (1/1) ... [2025-04-13 17:23:24,732 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-13 17:23:24,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:23:24,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:23:24,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:23:24,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:23:24,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,769 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:23:24,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:23:24,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:23:24,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:23:24,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:23:24,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (1/1) ... [2025-04-13 17:23:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:23:24,820 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:23:24,826 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:23:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 17:23:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 17:23:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 17:23:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:23:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:23:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:23:24,844 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:23:24,949 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:23:24,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:23:25,179 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:23:25,179 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:23:25,179 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:23:25,411 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:23:25,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:23:25 BoogieIcfgContainer [2025-04-13 17:23:25,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:23:25,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:23:25,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:23:25,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:23:25,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:23:24" (1/3) ... [2025-04-13 17:23:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b919f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:23:25, skipping insertion in model container [2025-04-13 17:23:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:24" (2/3) ... [2025-04-13 17:23:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b919f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:23:25, skipping insertion in model container [2025-04-13 17:23:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:23:25" (3/3) ... [2025-04-13 17:23:25,421 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:25,431 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:23:25,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 17:23:25,433 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:23:25,474 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:23:25,505 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 17:23:25,653 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2592 states, 2589 states have (on average 3.3854770181537273) internal successors, (8765), 2591 states have internal predecessors, (8765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:25,674 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:23:25,685 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;@ca39456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:23:25,686 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:23:25,698 INFO L278 IsEmpty]: Start isEmpty. Operand has 2592 states, 2589 states have (on average 3.3854770181537273) internal successors, (8765), 2591 states have internal predecessors, (8765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:25,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:23:25,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:25,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:23:25,702 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:25,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 10889850, now seen corresponding path program 1 times [2025-04-13 17:23:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:25,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851302783] [2025-04-13 17:23:25,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:25,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:23:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:23:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:26,105 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:23:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:26,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851302783] [2025-04-13 17:23:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851302783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:23:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991962948] [2025-04-13 17:23:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:26,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:23:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:26,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:23:26,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:23:26,134 INFO L87 Difference]: Start difference. First operand has 2592 states, 2589 states have (on average 3.3854770181537273) internal successors, (8765), 2591 states have internal predecessors, (8765), 0 states have call successors, (0), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:26,288 INFO L93 Difference]: Finished difference Result 2592 states and 8765 transitions. [2025-04-13 17:23:26,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:23:26,290 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-04-13 17:23:26,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:26,328 INFO L225 Difference]: With dead ends: 2592 [2025-04-13 17:23:26,328 INFO L226 Difference]: Without dead ends: 2158 [2025-04-13 17:23:26,338 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:23:26,341 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:26,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-04-13 17:23:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2158. [2025-04-13 17:23:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 3.3662494204914233) internal successors, (7261), 2157 states have internal predecessors, (7261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 7261 transitions. [2025-04-13 17:23:26,502 INFO L79 Accepts]: Start accepts. Automaton has 2158 states and 7261 transitions. Word has length 4 [2025-04-13 17:23:26,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:26,503 INFO L485 AbstractCegarLoop]: Abstraction has 2158 states and 7261 transitions. [2025-04-13 17:23:26,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:26,504 INFO L278 IsEmpty]: Start isEmpty. Operand 2158 states and 7261 transitions. [2025-04-13 17:23:26,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:23:26,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:26,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:26,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:23:26,509 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:26,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -818998029, now seen corresponding path program 1 times [2025-04-13 17:23:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:26,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430607775] [2025-04-13 17:23:26,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:23:26,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:23:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:26,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:26,890 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:23:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:26,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430607775] [2025-04-13 17:23:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430607775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:26,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:26,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:23:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344315061] [2025-04-13 17:23:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:26,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:23:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:26,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:23:26,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:23:26,893 INFO L87 Difference]: Start difference. First operand 2158 states and 7261 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:27,066 INFO L93 Difference]: Finished difference Result 2662 states and 8771 transitions. [2025-04-13 17:23:27,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:23:27,067 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-13 17:23:27,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:27,081 INFO L225 Difference]: With dead ends: 2662 [2025-04-13 17:23:27,081 INFO L226 Difference]: Without dead ends: 2074 [2025-04-13 17:23:27,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:23:27,085 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:27,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-04-13 17:23:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-04-13 17:23:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 3.3463579353593826) internal successors, (6937), 2073 states have internal predecessors, (6937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 6937 transitions. [2025-04-13 17:23:27,149 INFO L79 Accepts]: Start accepts. Automaton has 2074 states and 6937 transitions. Word has length 12 [2025-04-13 17:23:27,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:27,150 INFO L485 AbstractCegarLoop]: Abstraction has 2074 states and 6937 transitions. [2025-04-13 17:23:27,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:27,150 INFO L278 IsEmpty]: Start isEmpty. Operand 2074 states and 6937 transitions. [2025-04-13 17:23:27,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:23:27,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:27,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:27,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:23:27,152 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:27,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -629494818, now seen corresponding path program 1 times [2025-04-13 17:23:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:27,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090556415] [2025-04-13 17:23:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:27,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:23:27,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:23:27,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:28,007 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:23:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:28,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090556415] [2025-04-13 17:23:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090556415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:28,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784061706] [2025-04-13 17:23:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:28,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:28,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:28,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:28,008 INFO L87 Difference]: Start difference. First operand 2074 states and 6937 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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:23:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:28,273 INFO L93 Difference]: Finished difference Result 2654 states and 8771 transitions. [2025-04-13 17:23:28,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:23:28,274 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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:23:28,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:28,288 INFO L225 Difference]: With dead ends: 2654 [2025-04-13 17:23:28,288 INFO L226 Difference]: Without dead ends: 2120 [2025-04-13 17:23:28,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:23:28,291 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:28,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 60 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:23:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2025-04-13 17:23:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1960. [2025-04-13 17:23:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 3.313935681470138) internal successors, (6492), 1959 states have internal predecessors, (6492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 6492 transitions. [2025-04-13 17:23:28,352 INFO L79 Accepts]: Start accepts. Automaton has 1960 states and 6492 transitions. Word has length 14 [2025-04-13 17:23:28,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:28,352 INFO L485 AbstractCegarLoop]: Abstraction has 1960 states and 6492 transitions. [2025-04-13 17:23:28,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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:23:28,353 INFO L278 IsEmpty]: Start isEmpty. Operand 1960 states and 6492 transitions. [2025-04-13 17:23:28,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:23:28,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:28,355 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:23:28,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:23:28,355 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:28,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 639512277, now seen corresponding path program 1 times [2025-04-13 17:23:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:28,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546330849] [2025-04-13 17:23:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:28,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:23:28,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:23:28,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:28,867 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:23:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:28,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546330849] [2025-04-13 17:23:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546330849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041660512] [2025-04-13 17:23:28,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:28,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:23:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:28,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:23:28,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:28,868 INFO L87 Difference]: Start difference. First operand 1960 states and 6492 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:23:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:29,046 INFO L93 Difference]: Finished difference Result 3360 states and 11102 transitions. [2025-04-13 17:23:29,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:29,047 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:23:29,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:29,060 INFO L225 Difference]: With dead ends: 3360 [2025-04-13 17:23:29,060 INFO L226 Difference]: Without dead ends: 1920 [2025-04-13 17:23:29,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:23:29,065 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:29,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 53 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-04-13 17:23:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1800. [2025-04-13 17:23:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1799 states have (on average 3.2762645914396886) internal successors, (5894), 1799 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 5894 transitions. [2025-04-13 17:23:29,129 INFO L79 Accepts]: Start accepts. Automaton has 1800 states and 5894 transitions. Word has length 16 [2025-04-13 17:23:29,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:29,129 INFO L485 AbstractCegarLoop]: Abstraction has 1800 states and 5894 transitions. [2025-04-13 17:23:29,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:23:29,130 INFO L278 IsEmpty]: Start isEmpty. Operand 1800 states and 5894 transitions. [2025-04-13 17:23:29,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:23:29,132 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:29,132 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:23:29,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:23:29,132 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:29,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash -80624605, now seen corresponding path program 2 times [2025-04-13 17:23:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:29,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079435178] [2025-04-13 17:23:29,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:23:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:29,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:23:29,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:23:29,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:23:29,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:29,550 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:23:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:29,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079435178] [2025-04-13 17:23:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079435178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354245260] [2025-04-13 17:23:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:29,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:29,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:29,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:29,551 INFO L87 Difference]: Start difference. First operand 1800 states and 5894 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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:23:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:29,684 INFO L93 Difference]: Finished difference Result 2064 states and 6656 transitions. [2025-04-13 17:23:29,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:29,685 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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:23:29,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:29,697 INFO L225 Difference]: With dead ends: 2064 [2025-04-13 17:23:29,697 INFO L226 Difference]: Without dead ends: 1784 [2025-04-13 17:23:29,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:29,699 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:29,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-04-13 17:23:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-04-13 17:23:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 3.272013460459899) internal successors, (5834), 1783 states have internal predecessors, (5834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 5834 transitions. [2025-04-13 17:23:29,754 INFO L79 Accepts]: Start accepts. Automaton has 1784 states and 5834 transitions. Word has length 16 [2025-04-13 17:23:29,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:29,755 INFO L485 AbstractCegarLoop]: Abstraction has 1784 states and 5834 transitions. [2025-04-13 17:23:29,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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:23:29,755 INFO L278 IsEmpty]: Start isEmpty. Operand 1784 states and 5834 transitions. [2025-04-13 17:23:29,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:23:29,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:29,758 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:23:29,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:23:29,761 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:29,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash 600133799, now seen corresponding path program 1 times [2025-04-13 17:23:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:29,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883358021] [2025-04-13 17:23:29,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:29,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:29,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:23:29,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:23:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:30,272 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:23:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:30,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883358021] [2025-04-13 17:23:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883358021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044320782] [2025-04-13 17:23:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:30,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:30,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:30,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:30,274 INFO L87 Difference]: Start difference. First operand 1784 states and 5834 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:23:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:30,448 INFO L93 Difference]: Finished difference Result 2776 states and 8922 transitions. [2025-04-13 17:23:30,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:30,448 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:23:30,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:30,464 INFO L225 Difference]: With dead ends: 2776 [2025-04-13 17:23:30,464 INFO L226 Difference]: Without dead ends: 1844 [2025-04-13 17:23:30,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:30,467 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:30,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-04-13 17:23:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1684. [2025-04-13 17:23:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 3.1794414735591205) internal successors, (5351), 1683 states have internal predecessors, (5351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 5351 transitions. [2025-04-13 17:23:30,509 INFO L79 Accepts]: Start accepts. Automaton has 1684 states and 5351 transitions. Word has length 17 [2025-04-13 17:23:30,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:30,509 INFO L485 AbstractCegarLoop]: Abstraction has 1684 states and 5351 transitions. [2025-04-13 17:23:30,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:23:30,510 INFO L278 IsEmpty]: Start isEmpty. Operand 1684 states and 5351 transitions. [2025-04-13 17:23:30,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:23:30,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:30,512 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:23:30,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:23:30,513 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:30,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1816539149, now seen corresponding path program 1 times [2025-04-13 17:23:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:30,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252115780] [2025-04-13 17:23:30,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:30,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:23:30,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:23:30,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:30,906 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:23:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:30,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252115780] [2025-04-13 17:23:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252115780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449915326] [2025-04-13 17:23:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:30,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:23:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:23:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:30,907 INFO L87 Difference]: Start difference. First operand 1684 states and 5351 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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:23:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:31,068 INFO L93 Difference]: Finished difference Result 1844 states and 5799 transitions. [2025-04-13 17:23:31,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:31,068 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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:23:31,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:31,078 INFO L225 Difference]: With dead ends: 1844 [2025-04-13 17:23:31,078 INFO L226 Difference]: Without dead ends: 1620 [2025-04-13 17:23:31,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:23:31,081 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:31,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 68 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-04-13 17:23:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2025-04-13 17:23:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 3.166769610870908) internal successors, (5127), 1619 states have internal predecessors, (5127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 5127 transitions. [2025-04-13 17:23:31,118 INFO L79 Accepts]: Start accepts. Automaton has 1620 states and 5127 transitions. Word has length 17 [2025-04-13 17:23:31,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:31,119 INFO L485 AbstractCegarLoop]: Abstraction has 1620 states and 5127 transitions. [2025-04-13 17:23:31,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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:23:31,119 INFO L278 IsEmpty]: Start isEmpty. Operand 1620 states and 5127 transitions. [2025-04-13 17:23:31,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:23:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:31,122 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:23:31,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:23:31,122 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:31,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 931079525, now seen corresponding path program 1 times [2025-04-13 17:23:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:31,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114181182] [2025-04-13 17:23:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:23:31,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:23:31,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:31,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:31,479 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:23:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:31,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114181182] [2025-04-13 17:23:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114181182] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525612338] [2025-04-13 17:23:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:31,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:23:31,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:31,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:23:31,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:31,480 INFO L87 Difference]: Start difference. First operand 1620 states and 5127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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:23:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:31,635 INFO L93 Difference]: Finished difference Result 1873 states and 5829 transitions. [2025-04-13 17:23:31,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:31,637 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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:23:31,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:31,647 INFO L225 Difference]: With dead ends: 1873 [2025-04-13 17:23:31,647 INFO L226 Difference]: Without dead ends: 1667 [2025-04-13 17:23:31,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:23:31,649 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:31,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 70 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-04-13 17:23:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2025-04-13 17:23:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 3.140456182472989) internal successors, (5232), 1666 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 5232 transitions. [2025-04-13 17:23:31,691 INFO L79 Accepts]: Start accepts. Automaton has 1667 states and 5232 transitions. Word has length 18 [2025-04-13 17:23:31,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:31,691 INFO L485 AbstractCegarLoop]: Abstraction has 1667 states and 5232 transitions. [2025-04-13 17:23:31,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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:23:31,691 INFO L278 IsEmpty]: Start isEmpty. Operand 1667 states and 5232 transitions. [2025-04-13 17:23:31,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:23:31,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:31,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:31,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:23:31,694 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:31,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1321182603, now seen corresponding path program 1 times [2025-04-13 17:23:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:31,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571163410] [2025-04-13 17:23:31,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:31,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:23:31,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:23:31,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:32,098 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:23:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:32,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571163410] [2025-04-13 17:23:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571163410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:23:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328060586] [2025-04-13 17:23:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:32,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:23:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:32,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:23:32,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:23:32,100 INFO L87 Difference]: Start difference. First operand 1667 states and 5232 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:32,359 INFO L93 Difference]: Finished difference Result 2153 states and 6699 transitions. [2025-04-13 17:23:32,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:23:32,360 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:23:32,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:32,369 INFO L225 Difference]: With dead ends: 2153 [2025-04-13 17:23:32,369 INFO L226 Difference]: Without dead ends: 1816 [2025-04-13 17:23:32,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:23:32,373 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 112 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:32,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 96 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:23:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-04-13 17:23:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1708. [2025-04-13 17:23:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1707 states have (on average 3.103104862331576) internal successors, (5297), 1707 states have internal predecessors, (5297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 5297 transitions. [2025-04-13 17:23:32,411 INFO L79 Accepts]: Start accepts. Automaton has 1708 states and 5297 transitions. Word has length 19 [2025-04-13 17:23:32,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:32,411 INFO L485 AbstractCegarLoop]: Abstraction has 1708 states and 5297 transitions. [2025-04-13 17:23:32,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:32,412 INFO L278 IsEmpty]: Start isEmpty. Operand 1708 states and 5297 transitions. [2025-04-13 17:23:32,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:23:32,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:32,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:32,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:23:32,418 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:32,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1201277744, now seen corresponding path program 1 times [2025-04-13 17:23:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:32,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792768293] [2025-04-13 17:23:32,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:32,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:23:32,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:23:32,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:32,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:33,355 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:23:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:33,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792768293] [2025-04-13 17:23:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792768293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:33,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:23:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596411481] [2025-04-13 17:23:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:33,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:23:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:33,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:23:33,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:23:33,357 INFO L87 Difference]: Start difference. First operand 1708 states and 5297 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:33,595 INFO L93 Difference]: Finished difference Result 1947 states and 5957 transitions. [2025-04-13 17:23:33,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:23:33,596 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:23:33,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:33,604 INFO L225 Difference]: With dead ends: 1947 [2025-04-13 17:23:33,605 INFO L226 Difference]: Without dead ends: 1788 [2025-04-13 17:23:33,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:23:33,606 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:33,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 96 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:23:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-04-13 17:23:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1645. [2025-04-13 17:23:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1644 states have (on average 3.121654501216545) internal successors, (5132), 1644 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 5132 transitions. [2025-04-13 17:23:33,638 INFO L79 Accepts]: Start accepts. Automaton has 1645 states and 5132 transitions. Word has length 19 [2025-04-13 17:23:33,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:33,638 INFO L485 AbstractCegarLoop]: Abstraction has 1645 states and 5132 transitions. [2025-04-13 17:23:33,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:33,638 INFO L278 IsEmpty]: Start isEmpty. Operand 1645 states and 5132 transitions. [2025-04-13 17:23:33,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:23:33,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:33,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:33,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:23:33,641 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:33,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1144537346, now seen corresponding path program 1 times [2025-04-13 17:23:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:33,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822109266] [2025-04-13 17:23:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:33,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:23:33,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:23:33,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:33,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:34,033 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:23:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:34,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822109266] [2025-04-13 17:23:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822109266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:34,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:34,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:23:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034983792] [2025-04-13 17:23:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:34,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:23:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:34,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:23:34,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:34,035 INFO L87 Difference]: Start difference. First operand 1645 states and 5132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:34,205 INFO L93 Difference]: Finished difference Result 2390 states and 7433 transitions. [2025-04-13 17:23:34,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:23:34,220 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:23:34,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:34,226 INFO L225 Difference]: With dead ends: 2390 [2025-04-13 17:23:34,226 INFO L226 Difference]: Without dead ends: 1535 [2025-04-13 17:23:34,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:23:34,229 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:34,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 81 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-04-13 17:23:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1415. [2025-04-13 17:23:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1414 states have (on average 3.0537482319660536) internal successors, (4318), 1414 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4318 transitions. [2025-04-13 17:23:34,260 INFO L79 Accepts]: Start accepts. Automaton has 1415 states and 4318 transitions. Word has length 20 [2025-04-13 17:23:34,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:34,260 INFO L485 AbstractCegarLoop]: Abstraction has 1415 states and 4318 transitions. [2025-04-13 17:23:34,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,261 INFO L278 IsEmpty]: Start isEmpty. Operand 1415 states and 4318 transitions. [2025-04-13 17:23:34,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:23:34,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:34,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:34,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:23:34,263 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:34,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1331830622, now seen corresponding path program 2 times [2025-04-13 17:23:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:34,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752718726] [2025-04-13 17:23:34,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:23:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:34,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:23:34,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:23:34,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:23:34,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:34,401 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:23:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:34,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752718726] [2025-04-13 17:23:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752718726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:34,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977558071] [2025-04-13 17:23:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:34,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:23:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:34,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:23:34,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:23:34,403 INFO L87 Difference]: Start difference. First operand 1415 states and 4318 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:34,484 INFO L93 Difference]: Finished difference Result 2033 states and 6087 transitions. [2025-04-13 17:23:34,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:23:34,484 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:23:34,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:34,491 INFO L225 Difference]: With dead ends: 2033 [2025-04-13 17:23:34,491 INFO L226 Difference]: Without dead ends: 1172 [2025-04-13 17:23:34,493 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:23:34,493 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:34,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 24 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-04-13 17:23:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2025-04-13 17:23:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 2.92399658411614) internal successors, (3424), 1171 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 3424 transitions. [2025-04-13 17:23:34,519 INFO L79 Accepts]: Start accepts. Automaton has 1172 states and 3424 transitions. Word has length 20 [2025-04-13 17:23:34,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:34,519 INFO L485 AbstractCegarLoop]: Abstraction has 1172 states and 3424 transitions. [2025-04-13 17:23:34,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,519 INFO L278 IsEmpty]: Start isEmpty. Operand 1172 states and 3424 transitions. [2025-04-13 17:23:34,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:23:34,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:34,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:34,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:23:34,522 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:34,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 755785489, now seen corresponding path program 1 times [2025-04-13 17:23:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:34,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552087888] [2025-04-13 17:23:34,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:34,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:23:34,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:23:34,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:34,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:34,622 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:23:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:34,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552087888] [2025-04-13 17:23:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552087888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847077703] [2025-04-13 17:23:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:34,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:34,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:34,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:34,624 INFO L87 Difference]: Start difference. First operand 1172 states and 3424 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:34,721 INFO L93 Difference]: Finished difference Result 1408 states and 4048 transitions. [2025-04-13 17:23:34,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:23:34,722 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 17:23:34,722 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:34,727 INFO L225 Difference]: With dead ends: 1408 [2025-04-13 17:23:34,727 INFO L226 Difference]: Without dead ends: 790 [2025-04-13 17:23:34,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:23:34,730 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:34,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 24 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-04-13 17:23:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 766. [2025-04-13 17:23:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 2.762091503267974) internal successors, (2113), 765 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2113 transitions. [2025-04-13 17:23:34,744 INFO L79 Accepts]: Start accepts. Automaton has 766 states and 2113 transitions. Word has length 21 [2025-04-13 17:23:34,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:34,745 INFO L485 AbstractCegarLoop]: Abstraction has 766 states and 2113 transitions. [2025-04-13 17:23:34,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,745 INFO L278 IsEmpty]: Start isEmpty. Operand 766 states and 2113 transitions. [2025-04-13 17:23:34,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:23:34,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:34,747 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:23:34,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:23:34,747 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:34,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -622756346, now seen corresponding path program 1 times [2025-04-13 17:23:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:34,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932559937] [2025-04-13 17:23:34,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:23:34,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:23:34,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:34,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:34,877 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:23:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:34,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932559937] [2025-04-13 17:23:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932559937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:23:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910829805] [2025-04-13 17:23:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:34,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:23:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:23:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:23:34,878 INFO L87 Difference]: Start difference. First operand 766 states and 2113 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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:23:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:34,977 INFO L93 Difference]: Finished difference Result 806 states and 2205 transitions. [2025-04-13 17:23:34,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:34,978 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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:23:34,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:34,982 INFO L225 Difference]: With dead ends: 806 [2025-04-13 17:23:34,982 INFO L226 Difference]: Without dead ends: 414 [2025-04-13 17:23:34,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:23:34,983 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:34,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 16 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-04-13 17:23:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 396. [2025-04-13 17:23:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.7088607594936707) internal successors, (1070), 395 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1070 transitions. [2025-04-13 17:23:34,993 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1070 transitions. Word has length 23 [2025-04-13 17:23:34,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:34,993 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1070 transitions. [2025-04-13 17:23:34,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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:23:34,993 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1070 transitions. [2025-04-13 17:23:34,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:23:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:34,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:34,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:23:34,996 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:34,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1404134425, now seen corresponding path program 1 times [2025-04-13 17:23:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:34,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379114803] [2025-04-13 17:23:34,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:35,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:23:35,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:23:35,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:35,823 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:23:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:35,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379114803] [2025-04-13 17:23:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379114803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:23:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387958792] [2025-04-13 17:23:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:35,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:23:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:35,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:23:35,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:23:35,824 INFO L87 Difference]: Start difference. First operand 396 states and 1070 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:23:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:35,983 INFO L93 Difference]: Finished difference Result 532 states and 1426 transitions. [2025-04-13 17:23:35,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:35,983 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:23:35,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:35,987 INFO L225 Difference]: With dead ends: 532 [2025-04-13 17:23:35,987 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 17:23:35,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:23:35,989 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:35,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 58 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 17:23:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-04-13 17:23:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.529182879377432) internal successors, (650), 257 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 650 transitions. [2025-04-13 17:23:35,996 INFO L79 Accepts]: Start accepts. Automaton has 258 states and 650 transitions. Word has length 26 [2025-04-13 17:23:35,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:35,996 INFO L485 AbstractCegarLoop]: Abstraction has 258 states and 650 transitions. [2025-04-13 17:23:35,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:23:35,996 INFO L278 IsEmpty]: Start isEmpty. Operand 258 states and 650 transitions. [2025-04-13 17:23:35,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:23:35,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:35,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:35,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:23:35,997 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:35,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 346524755, now seen corresponding path program 2 times [2025-04-13 17:23:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:35,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838097171] [2025-04-13 17:23:35,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:23:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:36,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:23:36,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:23:36,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:23:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:23:36,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:23:36,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:23:36,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:23:36,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:36,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:23:36,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:23:36,128 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:23:36,129 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:23:36,130 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:23:36,130 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 17:23:36,130 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 17:23:36,131 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 17:23:36,131 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:23:36,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:23:36,133 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:36,208 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:23:36,208 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:23:36,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:23:36 BasicIcfg [2025-04-13 17:23:36,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:23:36,215 INFO L158 Benchmark]: Toolchain (without parser) took 11977.78ms. Allocated memory was 142.6MB in the beginning and 574.6MB in the end (delta: 432.0MB). Free memory was 97.4MB in the beginning and 234.8MB in the end (delta: -137.5MB). Peak memory consumption was 293.2MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,215 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:23:36,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.36ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 70.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,216 INFO L158 Benchmark]: Boogie Preprocessor took 52.66ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,216 INFO L158 Benchmark]: RCFGBuilder took 625.60ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 74.1MB in the end (delta: -9.3MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,216 INFO L158 Benchmark]: TraceAbstraction took 10801.53ms. Allocated memory was 142.6MB in the beginning and 574.6MB in the end (delta: 432.0MB). Free memory was 74.1MB in the beginning and 234.8MB in the end (delta: -160.7MB). Peak memory consumption was 269.8MB. Max. memory is 8.0GB. [2025-04-13 17:23:36,220 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.15ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.36ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 70.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.66ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 625.60ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 74.1MB in the end (delta: -9.3MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10801.53ms. Allocated memory was 142.6MB in the beginning and 574.6MB in the end (delta: 432.0MB). Free memory was 74.1MB in the beginning and 234.8MB in the end (delta: -160.7MB). Peak memory consumption was 269.8MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 55 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 932 mSDsluCounter, 828 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 573 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1502 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 255 mSDtfsCounter, 1502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2592occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 853 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2025-04-13 17:23:36,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...