/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/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 21:50:08,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:08,918 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 21:50:08,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:08,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:08,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:08,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:08,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:08,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:08,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:08,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:08,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:08,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:08,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:08,941 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:08,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:08,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:08,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:08,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:08,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:08,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:08,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:08,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:50:09,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:09,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:09,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:09,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:09,189 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:09,190 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 21:50:10,420 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6471d10/b257a68e379b4d1d909c09225f2d63d9/FLAG8405b651b [2025-04-13 21:50:10,719 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:50:10,719 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 21:50:10,737 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6471d10/b257a68e379b4d1d909c09225f2d63d9/FLAG8405b651b [2025-04-13 21:50:11,470 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6471d10/b257a68e379b4d1d909c09225f2d63d9 [2025-04-13 21:50:11,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:50:11,473 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:50:11,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:11,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:50:11,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:50:11,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bd3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11, skipping insertion in model container [2025-04-13 21:50:11,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:50:11,675 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 21:50:11,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:11,846 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:50:11,866 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 21:50:11,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:11,938 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:50:11,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11 WrapperNode [2025-04-13 21:50:11,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:11,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:11,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:50:11,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:50:11,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,975 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-04-13 21:50:11,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:11,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:50:11,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:50:11,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:50:11,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:11,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,004 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 21:50:12,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:50:12,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:50:12,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:50:12,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:50:12,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (1/1) ... [2025-04-13 21:50:12,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:50:12,049 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 21:50:12,054 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 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:50:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:50:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:50:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:50:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:50:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:50:12,069 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:50:12,171 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:50:12,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:50:12,467 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:50:12,467 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:50:12,467 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:50:12,715 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:50:12,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:12 BoogieIcfgContainer [2025-04-13 21:50:12,715 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:50:12,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:50:12,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:50:12,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:50:12,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:50:11" (1/3) ... [2025-04-13 21:50:12,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f32ee6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:12, skipping insertion in model container [2025-04-13 21:50:12,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:11" (2/3) ... [2025-04-13 21:50:12,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f32ee6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:12, skipping insertion in model container [2025-04-13 21:50:12,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:12" (3/3) ... [2025-04-13 21:50:12,722 INFO L128 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 21:50:12,732 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:50:12,734 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 21:50:12,734 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:50:12,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:50:12,809 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 36 transitions, 84 flow [2025-04-13 21:50:12,963 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 21:50:12,980 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:50:12,987 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;@5dce8f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:50:12,987 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:50:12,997 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 21:50:13,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:50:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:13,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:50:13,001 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 21:50:13,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 285997653, now seen corresponding path program 1 times [2025-04-13 21:50:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:13,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118272822] [2025-04-13 21:50:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:13,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:50:13,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:50:13,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:13,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:13,366 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 21:50:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:13,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118272822] [2025-04-13 21:50:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118272822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:50:13,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096229977] [2025-04-13 21:50:13,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:13,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:50:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:13,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:50:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:50:13,393 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 21:50:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:13,595 INFO L93 Difference]: Finished difference Result 3450 states and 11819 transitions. [2025-04-13 21:50:13,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:50:13,597 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 21:50:13,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:13,628 INFO L225 Difference]: With dead ends: 3450 [2025-04-13 21:50:13,628 INFO L226 Difference]: Without dead ends: 2874 [2025-04-13 21:50:13,637 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 21:50:13,640 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:13,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2025-04-13 21:50:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2874. [2025-04-13 21:50:13,778 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 21:50:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 9795 transitions. [2025-04-13 21:50:13,801 INFO L79 Accepts]: Start accepts. Automaton has 2874 states and 9795 transitions. Word has length 6 [2025-04-13 21:50:13,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:13,802 INFO L485 AbstractCegarLoop]: Abstraction has 2874 states and 9795 transitions. [2025-04-13 21:50:13,802 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 21:50:13,802 INFO L278 IsEmpty]: Start isEmpty. Operand 2874 states and 9795 transitions. [2025-04-13 21:50:13,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:50:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:13,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:13,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:50:13,806 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 21:50:13,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -652917353, now seen corresponding path program 1 times [2025-04-13 21:50:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:13,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304337415] [2025-04-13 21:50:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:50:13,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:50:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:13,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:14,106 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 21:50:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:14,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304337415] [2025-04-13 21:50:14,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304337415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:14,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:14,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:50:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574339406] [2025-04-13 21:50:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:14,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:50:14,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:14,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:50:14,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:50:14,108 INFO L87 Difference]: Start difference. First operand 2874 states and 9795 transitions. Second operand has 4 states, 4 states have (on average 3.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 21:50:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:14,280 INFO L93 Difference]: Finished difference Result 4084 states and 13588 transitions. [2025-04-13 21:50:14,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:50:14,281 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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 21:50:14,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:14,296 INFO L225 Difference]: With dead ends: 4084 [2025-04-13 21:50:14,296 INFO L226 Difference]: Without dead ends: 2124 [2025-04-13 21:50:14,301 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 21:50:14,301 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:14,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 9 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-04-13 21:50:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2124. [2025-04-13 21:50:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 3.2006594441827603) internal successors, (6795), 2123 states have internal predecessors, (6795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 6795 transitions. [2025-04-13 21:50:14,392 INFO L79 Accepts]: Start accepts. Automaton has 2124 states and 6795 transitions. Word has length 12 [2025-04-13 21:50:14,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:14,392 INFO L485 AbstractCegarLoop]: Abstraction has 2124 states and 6795 transitions. [2025-04-13 21:50:14,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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 21:50:14,393 INFO L278 IsEmpty]: Start isEmpty. Operand 2124 states and 6795 transitions. [2025-04-13 21:50:14,396 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:50:14,396 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:14,396 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 21:50:14,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:50:14,397 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 21:50:14,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1316320410, now seen corresponding path program 1 times [2025-04-13 21:50:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:14,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826115896] [2025-04-13 21:50:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:50:14,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:50:14,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:14,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:14,666 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 21:50:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:14,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826115896] [2025-04-13 21:50:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826115896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:14,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:14,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:50:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244577166] [2025-04-13 21:50:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:14,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:50:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:14,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:50:14,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:50:14,667 INFO L87 Difference]: Start difference. First operand 2124 states and 6795 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 21:50:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:14,864 INFO L93 Difference]: Finished difference Result 2484 states and 7783 transitions. [2025-04-13 21:50:14,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:50:14,865 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 21:50:14,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:14,875 INFO L225 Difference]: With dead ends: 2484 [2025-04-13 21:50:14,875 INFO L226 Difference]: Without dead ends: 1274 [2025-04-13 21:50:14,878 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 21:50:14,879 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:14,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 12 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:50:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-04-13 21:50:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2025-04-13 21:50:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 3.000785545954438) internal successors, (3820), 1273 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3820 transitions. [2025-04-13 21:50:14,919 INFO L79 Accepts]: Start accepts. Automaton has 1274 states and 3820 transitions. Word has length 17 [2025-04-13 21:50:14,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:14,920 INFO L485 AbstractCegarLoop]: Abstraction has 1274 states and 3820 transitions. [2025-04-13 21:50:14,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 21:50:14,920 INFO L278 IsEmpty]: Start isEmpty. Operand 1274 states and 3820 transitions. [2025-04-13 21:50:14,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:50:14,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:14,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:14,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:50:14,923 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 21:50:14,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 96573594, now seen corresponding path program 1 times [2025-04-13 21:50:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:14,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93031245] [2025-04-13 21:50:14,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:50:15,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:50:15,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:15,305 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 21:50:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:15,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93031245] [2025-04-13 21:50:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93031245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:15,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:50:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559168170] [2025-04-13 21:50:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:15,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:50:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:15,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:50:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:50:15,306 INFO L87 Difference]: Start difference. First operand 1274 states and 3820 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:15,484 INFO L93 Difference]: Finished difference Result 1314 states and 3912 transitions. [2025-04-13 21:50:15,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:50:15,484 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 21:50:15,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:15,492 INFO L225 Difference]: With dead ends: 1314 [2025-04-13 21:50:15,493 INFO L226 Difference]: Without dead ends: 954 [2025-04-13 21:50:15,494 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 21:50:15,495 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 139 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:15,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 9 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-04-13 21:50:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-04-13 21:50:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 3.0010493179433366) internal successors, (2860), 953 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2860 transitions. [2025-04-13 21:50:15,519 INFO L79 Accepts]: Start accepts. Automaton has 954 states and 2860 transitions. Word has length 22 [2025-04-13 21:50:15,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:15,520 INFO L485 AbstractCegarLoop]: Abstraction has 954 states and 2860 transitions. [2025-04-13 21:50:15,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:15,520 INFO L278 IsEmpty]: Start isEmpty. Operand 954 states and 2860 transitions. [2025-04-13 21:50:15,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:50:15,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:15,524 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 21:50:15,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:50:15,524 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 21:50:15,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:15,525 INFO L85 PathProgramCache]: Analyzing trace with hash -762610917, now seen corresponding path program 1 times [2025-04-13 21:50:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:15,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819386356] [2025-04-13 21:50:15,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:15,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:50:15,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:50:15,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:17,046 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 21:50:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:17,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819386356] [2025-04-13 21:50:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819386356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:50:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274939180] [2025-04-13 21:50:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:17,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:50:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:17,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:50:17,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:50:17,048 INFO L87 Difference]: Start difference. First operand 954 states and 2860 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 21:50:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:17,418 INFO L93 Difference]: Finished difference Result 1466 states and 4355 transitions. [2025-04-13 21:50:17,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:50:17,419 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 21:50:17,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:17,426 INFO L225 Difference]: With dead ends: 1466 [2025-04-13 21:50:17,426 INFO L226 Difference]: Without dead ends: 1114 [2025-04-13 21:50:17,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:50:17,427 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:17,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:50:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-04-13 21:50:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 994. [2025-04-13 21:50:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 2.985901309164149) internal successors, (2965), 993 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 2965 transitions. [2025-04-13 21:50:17,452 INFO L79 Accepts]: Start accepts. Automaton has 994 states and 2965 transitions. Word has length 28 [2025-04-13 21:50:17,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:17,452 INFO L485 AbstractCegarLoop]: Abstraction has 994 states and 2965 transitions. [2025-04-13 21:50:17,452 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 21:50:17,452 INFO L278 IsEmpty]: Start isEmpty. Operand 994 states and 2965 transitions. [2025-04-13 21:50:17,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:50:17,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:17,455 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 21:50:17,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:50:17,455 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 21:50:17,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 829201629, now seen corresponding path program 2 times [2025-04-13 21:50:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:17,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887983422] [2025-04-13 21:50:17,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:50:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:17,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:50:17,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:50:17,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:50:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:19,858 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 21:50:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:19,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887983422] [2025-04-13 21:50:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887983422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:50:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202168732] [2025-04-13 21:50:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:19,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:50:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:19,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:50:19,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:50:19,859 INFO L87 Difference]: Start difference. First operand 994 states and 2965 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 21:50:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:20,387 INFO L93 Difference]: Finished difference Result 2178 states and 6324 transitions. [2025-04-13 21:50:20,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:50:20,388 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 21:50:20,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:20,396 INFO L225 Difference]: With dead ends: 2178 [2025-04-13 21:50:20,396 INFO L226 Difference]: Without dead ends: 1346 [2025-04-13 21:50:20,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:50:20,399 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:20,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 40 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:50:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-04-13 21:50:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 906. [2025-04-13 21:50:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 2.96353591160221) internal successors, (2682), 905 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2682 transitions. [2025-04-13 21:50:20,423 INFO L79 Accepts]: Start accepts. Automaton has 906 states and 2682 transitions. Word has length 28 [2025-04-13 21:50:20,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:20,424 INFO L485 AbstractCegarLoop]: Abstraction has 906 states and 2682 transitions. [2025-04-13 21:50:20,424 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 21:50:20,424 INFO L278 IsEmpty]: Start isEmpty. Operand 906 states and 2682 transitions. [2025-04-13 21:50:20,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:50:20,426 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:20,426 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 21:50:20,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:50:20,426 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 21:50:20,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash 672067771, now seen corresponding path program 3 times [2025-04-13 21:50:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:20,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410259881] [2025-04-13 21:50:20,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:50:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:20,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:50:20,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:50:20,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:50:20,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:23,313 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 21:50:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:23,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410259881] [2025-04-13 21:50:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410259881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:23,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 21:50:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991988505] [2025-04-13 21:50:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:23,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:50:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:50:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:50:23,314 INFO L87 Difference]: Start difference. First operand 906 states and 2682 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 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 21:50:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:23,869 INFO L93 Difference]: Finished difference Result 1090 states and 3178 transitions. [2025-04-13 21:50:23,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:50:23,869 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 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 21:50:23,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:23,874 INFO L225 Difference]: With dead ends: 1090 [2025-04-13 21:50:23,875 INFO L226 Difference]: Without dead ends: 858 [2025-04-13 21:50:23,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:50:23,877 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 138 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:23,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 45 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:50:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-04-13 21:50:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2025-04-13 21:50:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.9474912485414237) internal successors, (2526), 857 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2526 transitions. [2025-04-13 21:50:23,894 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2526 transitions. Word has length 28 [2025-04-13 21:50:23,895 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:23,895 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2526 transitions. [2025-04-13 21:50:23,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 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 21:50:23,895 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2526 transitions. [2025-04-13 21:50:23,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:50:23,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:23,898 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 21:50:23,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:50:23,898 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 21:50:23,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1219169821, now seen corresponding path program 4 times [2025-04-13 21:50:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:23,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667718394] [2025-04-13 21:50:23,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:50:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:23,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 21:50:23,971 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 21:50:23,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:50:23,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:50:23,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:50:23,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:50:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:50:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:50:24,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:50:24,096 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:50:24,096 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:50:24,097 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:50:24,098 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 21:50:24,098 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 21:50:24,098 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 21:50:24,098 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:50:24,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:50:24,101 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-04-13 21:50:24,208 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:50:24,208 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:50:24,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:50:24 BasicIcfg [2025-04-13 21:50:24,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:50:24,210 INFO L158 Benchmark]: Toolchain (without parser) took 12737.06ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 105.7MB in the beginning and 742.1MB in the end (delta: -636.3MB). Peak memory consumption was 415.4MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,214 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:50:24,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.21ms. Allocated memory is still 155.2MB. Free memory was 105.7MB in the beginning and 76.5MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory is still 155.2MB. Free memory was 76.5MB in the beginning and 73.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,215 INFO L158 Benchmark]: Boogie Preprocessor took 50.57ms. Allocated memory is still 155.2MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,215 INFO L158 Benchmark]: IcfgBuilder took 687.58ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 48.7MB in the end (delta: 20.2MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,215 INFO L158 Benchmark]: TraceAbstraction took 11493.44ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 48.0MB in the beginning and 742.1MB in the end (delta: -694.1MB). Peak memory consumption was 357.5MB. Max. memory is 8.0GB. [2025-04-13 21:50:24,216 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.19ms. Allocated memory is still 155.2MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.21ms. Allocated memory is still 155.2MB. Free memory was 105.7MB in the beginning and 76.5MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory is still 155.2MB. Free memory was 76.5MB in the beginning and 73.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.57ms. Allocated memory is still 155.2MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 687.58ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 48.7MB in the end (delta: 20.2MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11493.44ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 48.0MB in the beginning and 742.1MB in the end (delta: -694.1MB). Peak memory consumption was 357.5MB. 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, 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] [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}, __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, 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}, __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, 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] [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, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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}, 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=1, 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=1, 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] [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=1, 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=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=1, 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=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=0, weak$$choice2=1, 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=1, 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=1, 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: 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: 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: 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: 11.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1446 IncrementalHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 33 mSDtfsCounter, 1446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3450occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 560 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 21:50:24,231 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...