/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/safe023_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:49,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:23:49,568 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:49,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:23:49,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:23:49,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:23:49,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:23:49,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:23:49,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:23:49,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:23:49,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:23:49,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:23:49,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:23:49,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:23:49,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:49,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:23:49,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:49,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:23:49,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:23:49,596 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:49,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:23:49,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:23:49,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:23:49,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:23:49,813 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:23:49,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:51,137 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec52b4144/8dfa7649a0f348c997b7b6af0364895e/FLAG5e7185d75 [2025-04-13 17:23:51,406 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:23:51,407 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:51,419 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec52b4144/8dfa7649a0f348c997b7b6af0364895e/FLAG5e7185d75 [2025-04-13 17:23:52,138 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec52b4144/8dfa7649a0f348c997b7b6af0364895e [2025-04-13 17:23:52,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:23:52,141 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:23:52,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:23:52,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:23:52,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:23:52,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:23:52" (1/1) ... [2025-04-13 17:23:52,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4961e057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:52, skipping insertion in model container [2025-04-13 17:23:52,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:23:52" (1/1) ... [2025-04-13 17:23:52,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:23:52,339 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-13 17:23:52,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:23:52,553 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:23:52,574 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-13 17:23:52,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:23:52,651 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:23:52,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:52 WrapperNode [2025-04-13 17:23:52,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:23:52,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:23:52,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:23:52,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:23:52,659 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:52" (1/1) ... [2025-04-13 17:23:52,673 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:52" (1/1) ... [2025-04-13 17:23:52,700 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-04-13 17:23:52,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:23:52,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:23:52,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:23:52,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:23:52,717 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:52" (1/1) ... [2025-04-13 17:23:52,717 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:52" (1/1) ... [2025-04-13 17:23:52,726 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:52" (1/1) ... [2025-04-13 17:23:52,748 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:52,748 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:52" (1/1) ... [2025-04-13 17:23:52,748 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:52" (1/1) ... [2025-04-13 17:23:52,758 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:52" (1/1) ... [2025-04-13 17:23:52,763 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:52" (1/1) ... [2025-04-13 17:23:52,764 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:52" (1/1) ... [2025-04-13 17:23:52,769 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:52" (1/1) ... [2025-04-13 17:23:52,770 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:52" (1/1) ... [2025-04-13 17:23:52,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:23:52,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:23:52,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:23:52,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:23:52,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:52" (1/1) ... [2025-04-13 17:23:52,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:23:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:23:52,810 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:52,813 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:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:23:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:23:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 17:23:52,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 17:23:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 17:23:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 17:23:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 17:23:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 17:23:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:23:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:23:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:23:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:23:52,835 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:52,940 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:23:52,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:23:53,317 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:23:53,318 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:23:53,318 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:23:53,612 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:23:53,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:23:53 BoogieIcfgContainer [2025-04-13 17:23:53,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:23:53,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:23:53,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:23:53,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:23:53,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:23:52" (1/3) ... [2025-04-13 17:23:53,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c71f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:23:53, skipping insertion in model container [2025-04-13 17:23:53,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:23:52" (2/3) ... [2025-04-13 17:23:53,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c71f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:23:53, skipping insertion in model container [2025-04-13 17:23:53,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:23:53" (3/3) ... [2025-04-13 17:23:53,618 INFO L128 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 17:23:53,627 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:23:53,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 17:23:53,628 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:23:53,683 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:23:53,727 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 36 transitions, 84 flow [2025-04-13 17:23:53,884 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3450 states, 3447 states have (on average 3.428778648099797) internal successors, (11819), 3449 states have internal predecessors, (11819), 0 states have call successors, (0), 0 states have 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:53,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:23:53,910 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;@29daf294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:23:53,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:23:53,920 INFO L278 IsEmpty]: Start isEmpty. Operand has 3450 states, 3447 states have (on average 3.428778648099797) internal successors, (11819), 3449 states have internal predecessors, (11819), 0 states have call successors, (0), 0 states have 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:53,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:23:53,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:53,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:23:53,925 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:53,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash 131100342, now seen corresponding path program 1 times [2025-04-13 17:23:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:53,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629035553] [2025-04-13 17:23:53,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:53,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:23:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:23:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:54,330 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:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:54,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629035553] [2025-04-13 17:23:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629035553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:54,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:54,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:23:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249800447] [2025-04-13 17:23:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:54,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:23:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:54,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:23:54,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:23:54,361 INFO L87 Difference]: Start difference. First operand has 3450 states, 3447 states have (on average 3.428778648099797) internal successors, (11819), 3449 states have internal predecessors, (11819), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:54,570 INFO L93 Difference]: Finished difference Result 3450 states and 11819 transitions. [2025-04-13 17:23:54,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:23:54,572 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-13 17:23:54,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:54,604 INFO L225 Difference]: With dead ends: 3450 [2025-04-13 17:23:54,604 INFO L226 Difference]: Without dead ends: 2874 [2025-04-13 17:23:54,610 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:54,612 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:54,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2025-04-13 17:23:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2874. [2025-04-13 17:23:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2873 states have (on average 3.409328228332753) internal successors, (9795), 2873 states have internal predecessors, (9795), 0 states have call successors, (0), 0 states have 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:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 9795 transitions. [2025-04-13 17:23:54,757 INFO L79 Accepts]: Start accepts. Automaton has 2874 states and 9795 transitions. Word has length 6 [2025-04-13 17:23:54,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:54,758 INFO L485 AbstractCegarLoop]: Abstraction has 2874 states and 9795 transitions. [2025-04-13 17:23:54,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:54,758 INFO L278 IsEmpty]: Start isEmpty. Operand 2874 states and 9795 transitions. [2025-04-13 17:23:54,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:23:54,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:54,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:54,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:23:54,761 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:54,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1723848732, now seen corresponding path program 1 times [2025-04-13 17:23:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:54,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914568837] [2025-04-13 17:23:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:54,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:23:54,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:23:54,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:54,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:55,096 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:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:55,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914568837] [2025-04-13 17:23:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914568837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:23:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134869035] [2025-04-13 17:23:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:55,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:23:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:23:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:23:55,098 INFO L87 Difference]: Start difference. First operand 2874 states and 9795 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:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:55,276 INFO L93 Difference]: Finished difference Result 3434 states and 11493 transitions. [2025-04-13 17:23:55,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:23:55,277 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:55,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:55,296 INFO L225 Difference]: With dead ends: 3434 [2025-04-13 17:23:55,296 INFO L226 Difference]: Without dead ends: 2650 [2025-04-13 17:23:55,299 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:55,300 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:55,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-04-13 17:23:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2025-04-13 17:23:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2649 states have (on average 3.3820309550773877) internal successors, (8959), 2649 states have internal predecessors, (8959), 0 states have call successors, (0), 0 states have 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:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 8959 transitions. [2025-04-13 17:23:55,410 INFO L79 Accepts]: Start accepts. Automaton has 2650 states and 8959 transitions. Word has length 12 [2025-04-13 17:23:55,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:55,412 INFO L485 AbstractCegarLoop]: Abstraction has 2650 states and 8959 transitions. [2025-04-13 17:23:55,412 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:55,412 INFO L278 IsEmpty]: Start isEmpty. Operand 2650 states and 8959 transitions. [2025-04-13 17:23:55,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:23:55,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:55,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:55,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:23:55,418 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:55,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1237699043, now seen corresponding path program 1 times [2025-04-13 17:23:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:55,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525520644] [2025-04-13 17:23:55,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:23:55,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:23:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:56,203 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:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:56,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525520644] [2025-04-13 17:23:56,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525520644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:56,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:56,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745376618] [2025-04-13 17:23:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:56,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:56,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:56,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:56,205 INFO L87 Difference]: Start difference. First operand 2650 states and 8959 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:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:56,678 INFO L93 Difference]: Finished difference Result 3372 states and 11281 transitions. [2025-04-13 17:23:56,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:23:56,679 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:56,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:56,695 INFO L225 Difference]: With dead ends: 3372 [2025-04-13 17:23:56,696 INFO L226 Difference]: Without dead ends: 2786 [2025-04-13 17:23:56,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:23:56,699 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 92 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:56,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 59 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:23:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-04-13 17:23:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2682. [2025-04-13 17:23:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2681 states have (on average 3.3759791122715406) internal successors, (9051), 2681 states have internal predecessors, (9051), 0 states have call successors, (0), 0 states have 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:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 9051 transitions. [2025-04-13 17:23:56,775 INFO L79 Accepts]: Start accepts. Automaton has 2682 states and 9051 transitions. Word has length 14 [2025-04-13 17:23:56,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:56,776 INFO L485 AbstractCegarLoop]: Abstraction has 2682 states and 9051 transitions. [2025-04-13 17:23:56,776 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:56,776 INFO L278 IsEmpty]: Start isEmpty. Operand 2682 states and 9051 transitions. [2025-04-13 17:23:56,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:23:56,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:56,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:23:56,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:23:56,778 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:56,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1205380613, now seen corresponding path program 2 times [2025-04-13 17:23:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:56,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657509071] [2025-04-13 17:23:56,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:23:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:56,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:23:56,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:23:56,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:23:56,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:56,931 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:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:56,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657509071] [2025-04-13 17:23:56,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657509071] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:56,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:56,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:56,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638054427] [2025-04-13 17:23:56,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:56,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:56,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:56,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:56,933 INFO L87 Difference]: Start difference. First operand 2682 states and 9051 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:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:57,146 INFO L93 Difference]: Finished difference Result 3802 states and 12727 transitions. [2025-04-13 17:23:57,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:23:57,147 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:57,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:57,161 INFO L225 Difference]: With dead ends: 3802 [2025-04-13 17:23:57,161 INFO L226 Difference]: Without dead ends: 1810 [2025-04-13 17:23:57,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:23:57,167 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:57,167 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:23:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-04-13 17:23:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2025-04-13 17:23:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 3.245992260917634) internal successors, (5872), 1809 states have internal predecessors, (5872), 0 states have call successors, (0), 0 states have 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:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 5872 transitions. [2025-04-13 17:23:57,215 INFO L79 Accepts]: Start accepts. Automaton has 1810 states and 5872 transitions. Word has length 14 [2025-04-13 17:23:57,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:57,215 INFO L485 AbstractCegarLoop]: Abstraction has 1810 states and 5872 transitions. [2025-04-13 17:23:57,215 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:57,215 INFO L278 IsEmpty]: Start isEmpty. Operand 1810 states and 5872 transitions. [2025-04-13 17:23:57,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:23:57,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:57,217 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:57,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:23:57,217 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:57,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -668826257, now seen corresponding path program 1 times [2025-04-13 17:23:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:57,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287286382] [2025-04-13 17:23:57,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:23:57,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:23:57,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:57,380 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:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:57,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287286382] [2025-04-13 17:23:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287286382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:57,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:23:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790226623] [2025-04-13 17:23:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:57,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:23:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:23:57,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:23:57,382 INFO L87 Difference]: Start difference. First operand 1810 states and 5872 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:57,495 INFO L93 Difference]: Finished difference Result 1970 states and 6320 transitions. [2025-04-13 17:23:57,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:23:57,495 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 17:23:57,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:57,507 INFO L225 Difference]: With dead ends: 1970 [2025-04-13 17:23:57,507 INFO L226 Difference]: Without dead ends: 1650 [2025-04-13 17:23:57,509 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:57,509 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:57,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-04-13 17:23:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2025-04-13 17:23:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1649 states have (on average 3.216494845360825) internal successors, (5304), 1649 states have internal predecessors, (5304), 0 states have call successors, (0), 0 states have 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:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 5304 transitions. [2025-04-13 17:23:57,548 INFO L79 Accepts]: Start accepts. Automaton has 1650 states and 5304 transitions. Word has length 17 [2025-04-13 17:23:57,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:57,549 INFO L485 AbstractCegarLoop]: Abstraction has 1650 states and 5304 transitions. [2025-04-13 17:23:57,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:23:57,549 INFO L278 IsEmpty]: Start isEmpty. Operand 1650 states and 5304 transitions. [2025-04-13 17:23:57,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:23:57,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:57,553 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:57,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:23:57,554 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:57,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 82325421, now seen corresponding path program 1 times [2025-04-13 17:23:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:57,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833826922] [2025-04-13 17:23:57,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:57,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:23:57,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:23:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:57,798 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:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:57,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833826922] [2025-04-13 17:23:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833826922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:23:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246805491] [2025-04-13 17:23:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:57,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:23:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:57,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:23:57,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:23:57,799 INFO L87 Difference]: Start difference. First operand 1650 states and 5304 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:57,919 INFO L93 Difference]: Finished difference Result 2314 states and 7288 transitions. [2025-04-13 17:23:57,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:23:57,920 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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:57,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:57,929 INFO L225 Difference]: With dead ends: 2314 [2025-04-13 17:23:57,929 INFO L226 Difference]: Without dead ends: 1338 [2025-04-13 17:23:57,932 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:57,932 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:57,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 21 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:23:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-04-13 17:23:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2025-04-13 17:23:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1337 states have (on average 3.0740463724756917) internal successors, (4110), 1337 states have internal predecessors, (4110), 0 states have call successors, (0), 0 states have 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:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 4110 transitions. [2025-04-13 17:23:57,970 INFO L79 Accepts]: Start accepts. Automaton has 1338 states and 4110 transitions. Word has length 21 [2025-04-13 17:23:57,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:57,970 INFO L485 AbstractCegarLoop]: Abstraction has 1338 states and 4110 transitions. [2025-04-13 17:23:57,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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:57,970 INFO L278 IsEmpty]: Start isEmpty. Operand 1338 states and 4110 transitions. [2025-04-13 17:23:57,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:23:57,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:57,973 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:57,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:23:57,973 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:57,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1471001328, now seen corresponding path program 1 times [2025-04-13 17:23:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:57,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978693387] [2025-04-13 17:23:57,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:23:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:23:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:23:58,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:23:58,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:59,377 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:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:59,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978693387] [2025-04-13 17:23:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978693387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:23:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884846327] [2025-04-13 17:23:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:59,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:23:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:59,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:23:59,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:23:59,379 INFO L87 Difference]: Start difference. First operand 1338 states and 4110 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:23:59,697 INFO L93 Difference]: Finished difference Result 1532 states and 4671 transitions. [2025-04-13 17:23:59,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:23:59,698 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:59,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:23:59,711 INFO L225 Difference]: With dead ends: 1532 [2025-04-13 17:23:59,711 INFO L226 Difference]: Without dead ends: 1452 [2025-04-13 17:23:59,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:23:59,712 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:23:59,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 93 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:23:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2025-04-13 17:23:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1410. [2025-04-13 17:23:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 3.0731014904187366) internal successors, (4330), 1409 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have 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:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 4330 transitions. [2025-04-13 17:23:59,743 INFO L79 Accepts]: Start accepts. Automaton has 1410 states and 4330 transitions. Word has length 23 [2025-04-13 17:23:59,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:23:59,744 INFO L485 AbstractCegarLoop]: Abstraction has 1410 states and 4330 transitions. [2025-04-13 17:23:59,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:59,744 INFO L278 IsEmpty]: Start isEmpty. Operand 1410 states and 4330 transitions. [2025-04-13 17:23:59,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:23:59,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:23:59,746 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:59,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:23:59,746 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:23:59,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:23:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1579916504, now seen corresponding path program 2 times [2025-04-13 17:23:59,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:23:59,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304353039] [2025-04-13 17:23:59,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:23:59,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:23:59,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:23:59,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:23:59,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:23:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:23:59,966 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:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:23:59,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304353039] [2025-04-13 17:23:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304353039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:23:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:23:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:23:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19123910] [2025-04-13 17:23:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:23:59,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:23:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:23:59,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:23:59,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:23:59,968 INFO L87 Difference]: Start difference. First operand 1410 states and 4330 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:24:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:00,125 INFO L93 Difference]: Finished difference Result 1662 states and 5006 transitions. [2025-04-13 17:24:00,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:24:00,125 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 17:24:00,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:00,132 INFO L225 Difference]: With dead ends: 1662 [2025-04-13 17:24:00,133 INFO L226 Difference]: Without dead ends: 968 [2025-04-13 17:24:00,134 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:24:00,135 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:00,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:24:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-04-13 17:24:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2025-04-13 17:24:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 2.903783783783784) internal successors, (2686), 925 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have 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:24:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2686 transitions. [2025-04-13 17:24:00,159 INFO L79 Accepts]: Start accepts. Automaton has 926 states and 2686 transitions. Word has length 23 [2025-04-13 17:24:00,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:00,159 INFO L485 AbstractCegarLoop]: Abstraction has 926 states and 2686 transitions. [2025-04-13 17:24:00,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:24:00,159 INFO L278 IsEmpty]: Start isEmpty. Operand 926 states and 2686 transitions. [2025-04-13 17:24:00,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:24:00,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:00,162 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] [2025-04-13 17:24:00,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:24:00,162 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:00,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1630459301, now seen corresponding path program 1 times [2025-04-13 17:24:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:00,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140739074] [2025-04-13 17:24:00,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:00,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:00,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:24:00,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:24:00,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:00,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:00,389 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:24:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:00,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140739074] [2025-04-13 17:24:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140739074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:24:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606069395] [2025-04-13 17:24:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:00,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:24:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:24:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:24:00,390 INFO L87 Difference]: Start difference. First operand 926 states and 2686 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:24:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:00,525 INFO L93 Difference]: Finished difference Result 966 states and 2778 transitions. [2025-04-13 17:24:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:24:00,525 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:24:00,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:00,530 INFO L225 Difference]: With dead ends: 966 [2025-04-13 17:24:00,531 INFO L226 Difference]: Without dead ends: 714 [2025-04-13 17:24:00,531 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:24:00,532 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:00,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 16 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:24:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-04-13 17:24:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2025-04-13 17:24:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 2.8751753155680224) internal successors, (2050), 713 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have 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:24:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2050 transitions. [2025-04-13 17:24:00,545 INFO L79 Accepts]: Start accepts. Automaton has 714 states and 2050 transitions. Word has length 25 [2025-04-13 17:24:00,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:00,545 INFO L485 AbstractCegarLoop]: Abstraction has 714 states and 2050 transitions. [2025-04-13 17:24:00,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:24:00,545 INFO L278 IsEmpty]: Start isEmpty. Operand 714 states and 2050 transitions. [2025-04-13 17:24:00,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:00,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:00,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:24:00,547 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:00,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1547399420, now seen corresponding path program 1 times [2025-04-13 17:24:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:00,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729972188] [2025-04-13 17:24:00,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:00,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:00,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:01,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:24:01,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:01,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729972188] [2025-04-13 17:24:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729972188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:24:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041953665] [2025-04-13 17:24:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:01,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:24:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:01,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:24:01,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:24:01,107 INFO L87 Difference]: Start difference. First operand 714 states and 2050 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:01,350 INFO L93 Difference]: Finished difference Result 1520 states and 4321 transitions. [2025-04-13 17:24:01,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:24:01,351 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:01,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:01,356 INFO L225 Difference]: With dead ends: 1520 [2025-04-13 17:24:01,356 INFO L226 Difference]: Without dead ends: 1056 [2025-04-13 17:24:01,357 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:24:01,358 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:01,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 102 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-04-13 17:24:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 856. [2025-04-13 17:24:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 2.8374269005847954) internal successors, (2426), 855 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have 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:24:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2426 transitions. [2025-04-13 17:24:01,377 INFO L79 Accepts]: Start accepts. Automaton has 856 states and 2426 transitions. Word has length 28 [2025-04-13 17:24:01,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:01,378 INFO L485 AbstractCegarLoop]: Abstraction has 856 states and 2426 transitions. [2025-04-13 17:24:01,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:01,378 INFO L278 IsEmpty]: Start isEmpty. Operand 856 states and 2426 transitions. [2025-04-13 17:24:01,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:01,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:01,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:01,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:24:01,380 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:01,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2041796878, now seen corresponding path program 2 times [2025-04-13 17:24:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:01,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688328157] [2025-04-13 17:24:01,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:24:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:01,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:01,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:01,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:24:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:03,128 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:24:03,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:03,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688328157] [2025-04-13 17:24:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688328157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:24:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832697286] [2025-04-13 17:24:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:03,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:24:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:03,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:24:03,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:24:03,129 INFO L87 Difference]: Start difference. First operand 856 states and 2426 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:03,464 INFO L93 Difference]: Finished difference Result 1236 states and 3518 transitions. [2025-04-13 17:24:03,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:24:03,465 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:03,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:03,470 INFO L225 Difference]: With dead ends: 1236 [2025-04-13 17:24:03,470 INFO L226 Difference]: Without dead ends: 952 [2025-04-13 17:24:03,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:24:03,471 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 139 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:03,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 90 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:24:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-04-13 17:24:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 772. [2025-04-13 17:24:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 2.8521400778210118) internal successors, (2199), 771 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have 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:24:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2199 transitions. [2025-04-13 17:24:03,484 INFO L79 Accepts]: Start accepts. Automaton has 772 states and 2199 transitions. Word has length 28 [2025-04-13 17:24:03,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:03,485 INFO L485 AbstractCegarLoop]: Abstraction has 772 states and 2199 transitions. [2025-04-13 17:24:03,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:03,485 INFO L278 IsEmpty]: Start isEmpty. Operand 772 states and 2199 transitions. [2025-04-13 17:24:03,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:03,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:03,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:03,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:24:03,486 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:03,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 854356364, now seen corresponding path program 3 times [2025-04-13 17:24:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:03,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440835020] [2025-04-13 17:24:03,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:24:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:03,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:03,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:03,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:24:03,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:04,551 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:24:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:04,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440835020] [2025-04-13 17:24:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440835020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:24:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108724117] [2025-04-13 17:24:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:04,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:24:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:04,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:24:04,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:24:04,552 INFO L87 Difference]: Start difference. First operand 772 states and 2199 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:04,999 INFO L93 Difference]: Finished difference Result 1054 states and 2964 transitions. [2025-04-13 17:24:05,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:24:05,000 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:05,000 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:05,006 INFO L225 Difference]: With dead ends: 1054 [2025-04-13 17:24:05,006 INFO L226 Difference]: Without dead ends: 828 [2025-04-13 17:24:05,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:24:05,007 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 174 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:05,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 103 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:24:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-04-13 17:24:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 772. [2025-04-13 17:24:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 2.833981841763943) internal successors, (2185), 771 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have 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:24:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2185 transitions. [2025-04-13 17:24:05,023 INFO L79 Accepts]: Start accepts. Automaton has 772 states and 2185 transitions. Word has length 28 [2025-04-13 17:24:05,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:05,023 INFO L485 AbstractCegarLoop]: Abstraction has 772 states and 2185 transitions. [2025-04-13 17:24:05,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:05,023 INFO L278 IsEmpty]: Start isEmpty. Operand 772 states and 2185 transitions. [2025-04-13 17:24:05,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:05,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:05,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:05,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:24:05,027 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:05,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1564937620, now seen corresponding path program 4 times [2025-04-13 17:24:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:05,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840700558] [2025-04-13 17:24:05,027 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:24:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:05,037 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:24:05,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:05,091 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:24:05,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:06,535 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:24:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:06,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840700558] [2025-04-13 17:24:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840700558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:06,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:24:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240738504] [2025-04-13 17:24:06,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:06,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:24:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:06,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:24:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:24:06,536 INFO L87 Difference]: Start difference. First operand 772 states and 2185 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:06,903 INFO L93 Difference]: Finished difference Result 956 states and 2666 transitions. [2025-04-13 17:24:06,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:24:06,903 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:06,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:06,907 INFO L225 Difference]: With dead ends: 956 [2025-04-13 17:24:06,907 INFO L226 Difference]: Without dead ends: 720 [2025-04-13 17:24:06,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:24:06,908 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 213 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:06,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 106 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-04-13 17:24:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-04-13 17:24:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.8497913769123784) internal successors, (2049), 719 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have 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:24:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2049 transitions. [2025-04-13 17:24:06,921 INFO L79 Accepts]: Start accepts. Automaton has 720 states and 2049 transitions. Word has length 28 [2025-04-13 17:24:06,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:06,921 INFO L485 AbstractCegarLoop]: Abstraction has 720 states and 2049 transitions. [2025-04-13 17:24:06,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:06,921 INFO L278 IsEmpty]: Start isEmpty. Operand 720 states and 2049 transitions. [2025-04-13 17:24:06,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:06,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:06,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:06,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:24:06,923 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:06,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1509316784, now seen corresponding path program 5 times [2025-04-13 17:24:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:06,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410122340] [2025-04-13 17:24:06,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:24:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:06,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:06,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:06,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:24:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:07,795 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:24:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:07,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410122340] [2025-04-13 17:24:07,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410122340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:07,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:07,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:24:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000834341] [2025-04-13 17:24:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:07,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:24:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:07,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:24:07,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:24:07,797 INFO L87 Difference]: Start difference. First operand 720 states and 2049 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:08,048 INFO L93 Difference]: Finished difference Result 920 states and 2597 transitions. [2025-04-13 17:24:08,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:24:08,048 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:08,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:08,053 INFO L225 Difference]: With dead ends: 920 [2025-04-13 17:24:08,053 INFO L226 Difference]: Without dead ends: 694 [2025-04-13 17:24:08,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:24:08,054 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:08,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 62 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-04-13 17:24:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 606. [2025-04-13 17:24:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.811570247933884) internal successors, (1701), 605 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have 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:24:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1701 transitions. [2025-04-13 17:24:08,070 INFO L79 Accepts]: Start accepts. Automaton has 606 states and 1701 transitions. Word has length 28 [2025-04-13 17:24:08,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:08,071 INFO L485 AbstractCegarLoop]: Abstraction has 606 states and 1701 transitions. [2025-04-13 17:24:08,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:08,071 INFO L278 IsEmpty]: Start isEmpty. Operand 606 states and 1701 transitions. [2025-04-13 17:24:08,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:08,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:08,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:08,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:24:08,072 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:08,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -913497848, now seen corresponding path program 6 times [2025-04-13 17:24:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:08,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930776144] [2025-04-13 17:24:08,073 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:24:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:08,082 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:08,126 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:08,126 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:24:08,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:08,793 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:24:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:08,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930776144] [2025-04-13 17:24:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930776144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:24:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555765659] [2025-04-13 17:24:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:08,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:24:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:24:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:24:08,794 INFO L87 Difference]: Start difference. First operand 606 states and 1701 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:09,041 INFO L93 Difference]: Finished difference Result 998 states and 2763 transitions. [2025-04-13 17:24:09,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:24:09,041 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:09,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:09,045 INFO L225 Difference]: With dead ends: 998 [2025-04-13 17:24:09,045 INFO L226 Difference]: Without dead ends: 776 [2025-04-13 17:24:09,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:24:09,046 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 85 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:09,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 96 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-04-13 17:24:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 578. [2025-04-13 17:24:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 2.7954939341421143) internal successors, (1613), 577 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have 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:24:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1613 transitions. [2025-04-13 17:24:09,058 INFO L79 Accepts]: Start accepts. Automaton has 578 states and 1613 transitions. Word has length 28 [2025-04-13 17:24:09,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:09,058 INFO L485 AbstractCegarLoop]: Abstraction has 578 states and 1613 transitions. [2025-04-13 17:24:09,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:09,058 INFO L278 IsEmpty]: Start isEmpty. Operand 578 states and 1613 transitions. [2025-04-13 17:24:09,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:09,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:09,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:24:09,059 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:09,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1343371762, now seen corresponding path program 7 times [2025-04-13 17:24:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:09,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560731264] [2025-04-13 17:24:09,060 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:24:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:09,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:09,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:09,455 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:24:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:09,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560731264] [2025-04-13 17:24:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560731264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:09,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:09,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:24:09,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637809868] [2025-04-13 17:24:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:09,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:24:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:09,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:24:09,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:24:09,456 INFO L87 Difference]: Start difference. First operand 578 states and 1613 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:09,599 INFO L93 Difference]: Finished difference Result 776 states and 2116 transitions. [2025-04-13 17:24:09,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:24:09,599 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:09,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:09,603 INFO L225 Difference]: With dead ends: 776 [2025-04-13 17:24:09,603 INFO L226 Difference]: Without dead ends: 592 [2025-04-13 17:24:09,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:24:09,604 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:09,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:24:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-13 17:24:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-04-13 17:24:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 2.7681895093062607) internal successors, (1636), 591 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have 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:24:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1636 transitions. [2025-04-13 17:24:09,614 INFO L79 Accepts]: Start accepts. Automaton has 592 states and 1636 transitions. Word has length 28 [2025-04-13 17:24:09,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:09,614 INFO L485 AbstractCegarLoop]: Abstraction has 592 states and 1636 transitions. [2025-04-13 17:24:09,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:09,614 INFO L278 IsEmpty]: Start isEmpty. Operand 592 states and 1636 transitions. [2025-04-13 17:24:09,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:09,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:09,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:09,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:24:09,615 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:09,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1143470542, now seen corresponding path program 8 times [2025-04-13 17:24:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:09,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955330172] [2025-04-13 17:24:09,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:24:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:09,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:09,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:09,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:24:09,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:10,108 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:24:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:10,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955330172] [2025-04-13 17:24:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955330172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:24:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299747184] [2025-04-13 17:24:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:10,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:24:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:24:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:24:10,109 INFO L87 Difference]: Start difference. First operand 592 states and 1636 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:10,408 INFO L93 Difference]: Finished difference Result 974 states and 2681 transitions. [2025-04-13 17:24:10,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:24:10,408 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:10,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:10,412 INFO L225 Difference]: With dead ends: 974 [2025-04-13 17:24:10,412 INFO L226 Difference]: Without dead ends: 700 [2025-04-13 17:24:10,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:24:10,413 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:10,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 94 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-04-13 17:24:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 516. [2025-04-13 17:24:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 2.763106796116505) internal successors, (1423), 515 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have 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:24:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1423 transitions. [2025-04-13 17:24:10,423 INFO L79 Accepts]: Start accepts. Automaton has 516 states and 1423 transitions. Word has length 28 [2025-04-13 17:24:10,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:10,423 INFO L485 AbstractCegarLoop]: Abstraction has 516 states and 1423 transitions. [2025-04-13 17:24:10,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:10,423 INFO L278 IsEmpty]: Start isEmpty. Operand 516 states and 1423 transitions. [2025-04-13 17:24:10,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:10,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:10,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:10,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:24:10,424 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:10,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 975402990, now seen corresponding path program 9 times [2025-04-13 17:24:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:10,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579881130] [2025-04-13 17:24:10,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:24:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:10,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:10,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:10,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:24:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:10,952 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:24:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:10,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579881130] [2025-04-13 17:24:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579881130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:24:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726846595] [2025-04-13 17:24:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:10,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:24:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:10,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:24:10,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:24:10,954 INFO L87 Difference]: Start difference. First operand 516 states and 1423 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:11,183 INFO L93 Difference]: Finished difference Result 774 states and 2107 transitions. [2025-04-13 17:24:11,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:24:11,183 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:11,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:11,187 INFO L225 Difference]: With dead ends: 774 [2025-04-13 17:24:11,187 INFO L226 Difference]: Without dead ends: 510 [2025-04-13 17:24:11,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:24:11,188 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:11,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 101 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:24:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-04-13 17:24:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 474. [2025-04-13 17:24:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.7420718816067655) internal successors, (1297), 473 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have 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:24:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1297 transitions. [2025-04-13 17:24:11,196 INFO L79 Accepts]: Start accepts. Automaton has 474 states and 1297 transitions. Word has length 28 [2025-04-13 17:24:11,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:11,196 INFO L485 AbstractCegarLoop]: Abstraction has 474 states and 1297 transitions. [2025-04-13 17:24:11,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:11,196 INFO L278 IsEmpty]: Start isEmpty. Operand 474 states and 1297 transitions. [2025-04-13 17:24:11,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:11,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:11,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:11,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:24:11,197 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:11,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 761905514, now seen corresponding path program 10 times [2025-04-13 17:24:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:11,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934599095] [2025-04-13 17:24:11,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:24:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:11,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:24:11,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:11,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:24:11,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:12,466 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:24:12,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:12,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934599095] [2025-04-13 17:24:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934599095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:12,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:24:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945088178] [2025-04-13 17:24:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:12,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:24:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:12,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:24:12,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:24:12,467 INFO L87 Difference]: Start difference. First operand 474 states and 1297 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:12,732 INFO L93 Difference]: Finished difference Result 610 states and 1653 transitions. [2025-04-13 17:24:12,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:24:12,733 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-04-13 17:24:12,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:12,736 INFO L225 Difference]: With dead ends: 610 [2025-04-13 17:24:12,736 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 17:24:12,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:24:12,737 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 113 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:12,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 51 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:24:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 17:24:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-04-13 17:24:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.7308781869688383) internal successors, (964), 353 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:24:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 964 transitions. [2025-04-13 17:24:12,743 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 964 transitions. Word has length 28 [2025-04-13 17:24:12,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:12,743 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 964 transitions. [2025-04-13 17:24:12,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:24:12,744 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 964 transitions. [2025-04-13 17:24:12,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:24:12,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:12,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:12,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:24:12,744 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:24:12,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1775858440, now seen corresponding path program 11 times [2025-04-13 17:24:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:12,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972857976] [2025-04-13 17:24:12,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:24:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:12,750 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:12,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:12,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:24:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:24:12,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:24:12,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:24:12,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:24:12,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:12,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:24:12,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:24:12,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:24:12,886 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:24:12,887 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:24:12,887 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 17:24:12,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 17:24:12,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 17:24:12,888 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:24:12,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:24:12,890 INFO L422 BasicCegarLoop]: Path program histogram: [11, 2, 2, 1, 1, 1, 1, 1] [2025-04-13 17:24:12,981 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:24:12,981 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:24:12,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:24:12 BasicIcfg [2025-04-13 17:24:12,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:24:12,984 INFO L158 Benchmark]: Toolchain (without parser) took 20843.11ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 96.6MB in the beginning and 443.0MB in the end (delta: -346.4MB). Peak memory consumption was 368.4MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,984 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:24:12,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.54ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 67.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.22ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 64.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,984 INFO L158 Benchmark]: Boogie Preprocessor took 78.79ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 60.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,985 INFO L158 Benchmark]: RCFGBuilder took 828.56ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 39.4MB in the end (delta: 20.8MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,986 INFO L158 Benchmark]: TraceAbstraction took 19369.56ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 38.2MB in the beginning and 443.0MB in the end (delta: -404.9MB). Peak memory consumption was 306.8MB. Max. memory is 8.0GB. [2025-04-13 17:24:12,987 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.17ms. Allocated memory is still 167.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.54ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 67.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.22ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 64.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.79ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 60.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 828.56ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 39.4MB in the end (delta: 20.8MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. * TraceAbstraction took 19369.56ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 38.2MB in the beginning and 443.0MB in the end (delta: -404.9MB). Peak memory consumption was 306.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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, 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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, t2322=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=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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, 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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, y$r_buff0_thd2=1, 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] [L796] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, y$r_buff0_thd2=1, 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] [L813] 3 __unbuffered_p2_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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=0, y$r_buff0_thd2=1, 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] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L744] 1 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L747] 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) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 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 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L770] 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) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 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}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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: 19]: 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: 855]: 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: 857]: 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: 859]: 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, 63 locations, 59 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1744 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1744 mSDsluCounter, 1242 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 952 mSDsCounter, 281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2813 IncrementalHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 281 mSolverCounterUnsat, 290 mSDtfsCounter, 2813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3450occurred in iteration=0, InterpolantAutomatonStates: 140, 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, 19 MinimizatonAttempts, 1130 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 4358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:24:13,002 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...