/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 12:31:07,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 12:31:07,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 12:31:07,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 12:31:07,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 12:31:08,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 12:31:08,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 12:31:08,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 12:31:08,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 12:31:08,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 12:31:08,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 12:31:08,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 12:31:08,023 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 12:31:08,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 12:31:08,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:31:08,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:31:08,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:31:08,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 12:31:08,025 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 12:31:08,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 12:31:08,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 12:31:08,026 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 12:31:08,026 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 12:31:08,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 12:31:08,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 12:31:08,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 12:31:08,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 12:31:08,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 12:31:08,256 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 12:31:08,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-14 12:31:09,531 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0387a078f/2b0ec11919af4fd8ab6986f2155e6a7d/FLAG986ba8361 [2025-04-14 12:31:09,764 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 12:31:09,764 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-14 12:31:09,770 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0387a078f/2b0ec11919af4fd8ab6986f2155e6a7d/FLAG986ba8361 [2025-04-14 12:31:10,581 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0387a078f/2b0ec11919af4fd8ab6986f2155e6a7d [2025-04-14 12:31:10,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 12:31:10,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 12:31:10,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 12:31:10,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 12:31:10,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 12:31:10,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d8329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10, skipping insertion in model container [2025-04-14 12:31:10,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 12:31:10,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-04-14 12:31:10,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:31:10,783 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 12:31:10,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-04-14 12:31:10,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:31:10,833 INFO L204 MainTranslator]: Completed translation [2025-04-14 12:31:10,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10 WrapperNode [2025-04-14 12:31:10,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 12:31:10,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 12:31:10,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 12:31:10,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 12:31:10,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,861 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-14 12:31:10,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 12:31:10,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 12:31:10,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 12:31:10,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 12:31:10,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 12:31:10,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 12:31:10,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 12:31:10,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 12:31:10,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (1/1) ... [2025-04-14 12:31:10,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:31:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:31:10,920 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-14 12:31:10,922 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-14 12:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 12:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 12:31:10,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 12:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 12:31:10,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 12:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 12:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 12:31:10,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 12:31:10,940 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 12:31:10,995 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 12:31:10,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 12:31:11,165 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 12:31:11,165 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 12:31:11,304 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 12:31:11,304 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 12:31:11,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:31:11 BoogieIcfgContainer [2025-04-14 12:31:11,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 12:31:11,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 12:31:11,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 12:31:11,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 12:31:11,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:31:10" (1/3) ... [2025-04-14 12:31:11,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbd2543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:31:11, skipping insertion in model container [2025-04-14 12:31:11,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:31:10" (2/3) ... [2025-04-14 12:31:11,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbd2543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:31:11, skipping insertion in model container [2025-04-14 12:31:11,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:31:11" (3/3) ... [2025-04-14 12:31:11,312 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-04-14 12:31:11,322 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 12:31:11,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 12:31:11,325 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 12:31:11,371 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 12:31:11,410 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:31:11,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 12:31:11,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:31:11,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 12:31:11,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 12:31:11,461 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:31:11,474 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 12:31:11,479 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=PARTIAL_ORDER_FA, 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;@430d36f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:31:11,479 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 12:31:11,704 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:31:11,704 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:31:11,707 INFO L139 ounterexampleChecker]: Examining path program with hash -1112909302, occurence #1 [2025-04-14 12:31:11,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:31:11,708 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:31:11,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:31:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-04-14 12:31:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:31:11,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915658180] [2025-04-14 12:31:11,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:31:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 12:31:11,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 12:31:11,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:11,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:12,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-14 12:31:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:31:12,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915658180] [2025-04-14 12:31:12,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915658180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:31:12,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:31:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:31:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334574766] [2025-04-14 12:31:12,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:31:12,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:31:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:31:12,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:31:12,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:31:12,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:12,065 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:31:12,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:31:12,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:12,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:12,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 12:31:12,153 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:31:12,153 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:31:12,153 INFO L139 ounterexampleChecker]: Examining path program with hash -687417324, occurence #1 [2025-04-14 12:31:12,153 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:31:12,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:31:12,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:31:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-04-14 12:31:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:31:12,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115665256] [2025-04-14 12:31:12,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:31:12,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 12:31:12,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 12:31:12,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:31:12,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:31:12,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115665256] [2025-04-14 12:31:12,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115665256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:31:12,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:31:12,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:31:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223178373] [2025-04-14 12:31:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:31:12,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:31:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:31:12,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:31:12,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:31:12,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:12,336 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:31:12,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 12:31:12,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:12,336 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:12,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:12,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:12,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 12:31:12,411 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:31:12,411 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:31:12,412 INFO L139 ounterexampleChecker]: Examining path program with hash -1719521395, occurence #1 [2025-04-14 12:31:12,412 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:31:12,412 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:31:12,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:31:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-04-14 12:31:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:31:12,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323100816] [2025-04-14 12:31:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:31:12,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 12:31:12,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 12:31:12,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:12,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 12:31:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:31:12,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323100816] [2025-04-14 12:31:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323100816] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:31:12,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642590011] [2025-04-14 12:31:12,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:12,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:31:12,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:31:12,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:31:12,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 12:31:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 12:31:12,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 12:31:12,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:12,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 12:31:12,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:31:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 12:31:13,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 12:31:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642590011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:31:13,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 12:31:13,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-04-14 12:31:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900217836] [2025-04-14 12:31:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:31:13,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:31:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:31:13,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:31:13,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-14 12:31:13,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:13,025 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:31:13,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:31:13,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:13,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:13,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:13,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:13,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:13,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:13,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 12:31:13,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-14 12:31:13,300 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:31:13,300 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:31:13,300 INFO L139 ounterexampleChecker]: Examining path program with hash 1282604392, occurence #1 [2025-04-14 12:31:13,300 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:31:13,301 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:31:13,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:31:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-04-14 12:31:13,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:31:13,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746974916] [2025-04-14 12:31:13,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:31:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 12:31:13,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 12:31:13,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:13,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 12:31:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:31:13,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746974916] [2025-04-14 12:31:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746974916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:31:13,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098711628] [2025-04-14 12:31:13,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:31:13,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:31:13,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:31:13,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:31:13,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 12:31:13,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 12:31:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 12:31:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:31:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:13,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 12:31:13,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:31:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 12:31:13,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:31:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 12:31:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098711628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:31:13,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:31:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-04-14 12:31:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260375245] [2025-04-14 12:31:13,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:31:13,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 12:31:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:31:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 12:31:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-14 12:31:13,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:13,958 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:31:13,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 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-14 12:31:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:14,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:14,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:14,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:14,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 12:31:14,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 12:31:15,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:31:15,049 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:31:15,049 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:31:15,049 INFO L139 ounterexampleChecker]: Examining path program with hash 327941973, occurence #1 [2025-04-14 12:31:15,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:31:15,049 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:31:15,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:31:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-04-14 12:31:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:31:15,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284960050] [2025-04-14 12:31:15,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:31:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:31:15,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-04-14 12:31:15,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 12:31:15,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:31:15,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-14 12:31:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:31:15,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284960050] [2025-04-14 12:31:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284960050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:31:15,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624263375] [2025-04-14 12:31:15,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:31:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:31:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:31:15,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:31:15,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 12:31:15,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-04-14 12:31:16,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 12:31:16,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:31:16,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:31:16,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 12:31:16,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:31:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 12:31:16,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:31:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 12:31:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624263375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:31:17,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:31:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-04-14 12:31:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538150643] [2025-04-14 12:31:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:31:17,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 12:31:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:31:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 12:31:17,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-04-14 12:31:17,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:17,223 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:31:17,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 0 states have call successors, (0), 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-14 12:31:17,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:31:17,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:17,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:31:17,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 12:31:17,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:31:27,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:31:36,800 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 60 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:31:57,354 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:32:01,467 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:32:03,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:32:29,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:32:29,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:32:29,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:32:29,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 12:32:29,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:32:29,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 12:32:30,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:32:30,044 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 12:32:30,044 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:32:30,044 INFO L139 ounterexampleChecker]: Examining path program with hash 1853161006, occurence #1 [2025-04-14 12:32:30,044 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:32:30,044 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:32:30,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:32:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-04-14 12:32:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:32:30,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921324642] [2025-04-14 12:32:30,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:32:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:32:30,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-04-14 12:32:30,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-04-14 12:32:30,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-14 12:32:30,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:32:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1087 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:32:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:32:52,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921324642] [2025-04-14 12:32:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921324642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:32:52,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669450340] [2025-04-14 12:32:52,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:32:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:32:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:32:52,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:32:52,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 12:32:52,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-04-14 12:32:54,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-04-14 12:32:54,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-04-14 12:32:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:32:54,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-14 12:32:54,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:33:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:33:05,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:33:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:33:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669450340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:33:34,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:33:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-04-14 12:33:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013272403] [2025-04-14 12:33:34,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:33:34,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-04-14 12:33:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:33:34,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-04-14 12:33:34,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2392, Invalid=17913, Unknown=1, NotChecked=0, Total=20306 [2025-04-14 12:33:34,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:33:34,618 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:33:34,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 4.335664335664336) internal successors, (620), 143 states have internal predecessors, (620), 0 states have call successors, (0), 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-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2025-04-14 12:33:34,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:33:44,727 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:33:49,157 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:02,042 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:06,433 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:07,999 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:15,180 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:38,238 WARN L286 SmtUtils]: Spent 8.82s on a formula simplification. DAG size of input: 57 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:34:46,990 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:34:51,150 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:34:52,924 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:35:08,135 WARN L286 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 70 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:35:20,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:35:32,606 WARN L286 SmtUtils]: Spent 9.50s on a formula simplification. DAG size of input: 80 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:35:57,021 WARN L286 SmtUtils]: Spent 16.32s on a formula simplification. DAG size of input: 65 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:04,119 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 62 DAG size of output: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:17,442 WARN L286 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 71 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:37,162 WARN L286 SmtUtils]: Spent 15.87s on a formula simplification. DAG size of input: 87 DAG size of output: 51 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:50,851 WARN L286 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 83 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:36:52,322 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:37:00,796 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 53 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:37:05,191 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:37:09,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:37:11,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:37:15,212 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:37:44,538 WARN L286 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 96 DAG size of output: 34 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:37:48,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:38:16,454 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 89 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:38:20,005 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 12:38:37,426 WARN L286 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 59 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:39:11,223 WARN L286 SmtUtils]: Spent 29.90s on a formula simplification. DAG size of input: 72 DAG size of output: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:39:27,559 WARN L286 SmtUtils]: Spent 14.57s on a formula simplification. DAG size of input: 69 DAG size of output: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 12:39:36,456 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse53 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse53 2)) (.cse49 (mod (+ c_~i2~0 12) 4294967296)) (.cse50 (mod (+ 5 c_~i2~0) 4294967296)) (.cse5 (mod c_~i1~0 2)) (.cse9 (* c_~N~0 2)) (.cse10 (* 4294967295 c_~i2~0))) (let ((.cse15 (mod (+ c_~i1~0 20) 4294967296)) (.cse21 (mod (+ 23 c_~i2~0) 4294967296)) (.cse31 (mod (+ c_~i2~0 17) 4294967296)) (.cse14 (mod (+ c_~i2~0 11) 4294967296)) (.cse38 (mod (+ .cse9 3 .cse10) 4294967296)) (.cse2 (+ .cse9 .cse5)) (.cse23 (mod (+ c_~i1~0 18) 4294967296)) (.cse8 (mod (+ c_~i2~0 20) 4294967296)) (.cse19 (mod c_~i1~0 4294967296)) (.cse24 (mod (+ 21 c_~i2~0) 4294967296)) (.cse36 (mod (+ c_~i1~0 14) 4294967296)) (.cse34 (mod (+ c_~i1~0 4) 4294967296)) (.cse18 (+ .cse50 .cse5 1)) (.cse30 (mod (+ c_~i1~0 15) 4294967296)) (.cse41 (mod (+ 7 c_~i2~0) 4294967296)) (.cse37 (mod (+ c_~i1~0 4294967288) 4294967296)) (.cse32 (mod (+ c_~i1~0 12) 4294967296)) (.cse27 (mod (+ 14 c_~i2~0) 4294967296)) (.cse44 (mod (+ c_~i2~0 18) 4294967296)) (.cse45 (mod (+ c_~i1~0 16) 4294967296)) (.cse17 (mod (+ c_~i1~0 2) 4294967296)) (.cse13 (mod (+ c_~i1~0 7) 4294967296)) (.cse4 (mod (+ c_~i2~0 10) 4294967296)) (.cse28 (mod (+ c_~i1~0 10) 4294967296)) (.cse0 (mod (+ .cse9 .cse10 1) 4294967296)) (.cse25 (mod (+ c_~i1~0 4294967290) 4294967296)) (.cse26 (mod (+ c_~i1~0 11) 4294967296)) (.cse48 (mod (+ c_~i2~0 13) 4294967296)) (.cse6 (mod (+ c_~i1~0 17) 4294967296)) (.cse46 (mod (+ 19 c_~i2~0) 4294967296)) (.cse42 (mod (+ c_~i1~0 19) 4294967296)) (.cse16 (mod (+ 22 c_~i2~0) 4294967296)) (.cse20 (mod (+ 3 c_~i2~0) 4294967296)) (.cse39 (mod (+ c_~i1~0 8) 4294967296)) (.cse29 (+ .cse49 .cse5 1)) (.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse22 (mod (+ .cse9 5 .cse10) 4294967296)) (.cse11 (mod (+ c_~i1~0 4294967286) 4294967296)) (.cse12 (+ .cse7 .cse9)) (.cse40 (mod (+ c_~i1~0 5) 4294967296)) (.cse35 (mod (+ 6 c_~i2~0) 4294967296)) (.cse51 (mod .cse53 4294967296)) (.cse47 (mod (+ c_~i2~0 4) 4294967296)) (.cse3 (mod (+ c_~i1~0 6) 4294967296)) (.cse33 (mod (+ 15 c_~i2~0) 4294967296)) (.cse52 (mod (+ c_~i1~0 13) 4294967296)) (.cse43 (mod (+ 16 c_~i2~0) 4294967296))) (and (<= (+ .cse0 .cse1 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse2) (< .cse3 (+ .cse4 .cse5 1)) (< .cse6 (+ .cse7 .cse8 1)) (<= (+ (mod (+ .cse9 4 .cse10) 4294967296) .cse1 6 .cse11) .cse12) (< .cse13 (+ .cse7 .cse14 1)) (< .cse15 (+ .cse16 .cse5 1)) (< .cse17 .cse18) (< .cse19 (+ .cse20 .cse5 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse7 .cse21 1)) (<= (+ .cse1 .cse22 (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse2) (< .cse23 (+ .cse24 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 .cse10) 4294967296) 6 .cse25) .cse12) (< .cse26 (+ .cse7 .cse27 1)) (< .cse15 (+ .cse5 .cse21 1)) (< .cse28 .cse29) (< .cse30 (+ .cse7 .cse31 1)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse5 1)) (< .cse32 (+ .cse33 .cse5 1)) (< .cse34 (+ .cse35 .cse5 1)) (< .cse36 (+ .cse31 .cse5 1)) (<= (+ .cse1 .cse37 6 .cse38) .cse12) (< .cse39 (+ .cse14 .cse5 1)) (< .cse40 (+ .cse7 .cse41 1)) (<= (+ .cse1 (mod (+ c_~i1~0 4294967287) 4294967296) 6 .cse38) .cse2) (< .cse23 (+ .cse8 .cse5 1)) (< .cse19 (+ .cse5 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse42 (+ .cse7 .cse24 1)) (< .cse36 (+ .cse43 .cse5 1)) (< .cse34 .cse18) (< .cse30 (+ .cse44 .cse7 1)) (< .cse3 (+ .cse5 .cse41 1)) (<= (+ (mod (+ .cse9 2 .cse10) 4294967296) .cse1 .cse37 6) .cse12) (< .cse32 (+ .cse27 .cse5 1)) (<= (+ .cse1 (mod (+ .cse9 6 .cse10) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse12) (< .cse45 (+ .cse44 .cse5 1)) (< .cse45 (+ .cse46 .cse5 1)) (< .cse17 (+ .cse5 .cse47 1)) (< .cse13 (+ .cse7 .cse4 1)) (< .cse28 (+ .cse48 .cse5 1)) (<= (+ .cse0 .cse1 6 .cse25) .cse12) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 .cse49 1)) (< .cse26 (+ .cse7 .cse48 1)) (< .cse6 (+ .cse7 .cse46 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 .cse50 1)) (< .cse42 (+ .cse7 .cse16 1)) (< .cse51 (+ .cse7 .cse20 1)) (< .cse39 .cse29) (<= (+ .cse1 .cse22 6 .cse11) .cse12) (< .cse40 (+ .cse7 .cse35 1)) (< .cse51 (+ .cse7 .cse47 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse5 1)) (< .cse52 (+ .cse7 .cse33 1)) (< .cse52 (+ .cse7 .cse43 1)))))) is different from false [2025-04-14 12:39:40,472 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse9 2)) (.cse0 (* c_~N~0 2)) (.cse6 (mod c_~i1~0 2))) (let ((.cse4 (mod c_~i2~0 4294967296)) (.cse3 (+ .cse0 .cse6)) (.cse1 (* 4294967295 c_~i2~0)) (.cse2 (* (div c_~N~0 2147483648) 4294967296)) (.cse8 (+ .cse7 .cse0)) (.cse5 (mod (+ c_~i1~0 6) 4294967296))) (and (<= (+ (mod (+ .cse0 .cse1 1) 4294967296) .cse2 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse3) (<= (+ .cse2 .cse4 1) .cse0) (< .cse5 (+ (mod (+ c_~i2~0 10) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse7 (mod (+ c_~i2~0 20) 4294967296) 1)) (<= (+ (mod (+ .cse0 4 .cse1) 4294967296) .cse2 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse8) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse7 (mod (+ c_~i2~0 11) 4294967296) 1)) (< (mod c_~i1~0 4294967296) (+ (mod (+ 3 c_~i2~0) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ .cse0 5 .cse1) 4294967296) (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse3) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ 21 c_~i2~0) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ .cse0 .cse1) 4294967296) 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse8) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse7 (mod (+ 14 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 20) 4294967296) (+ .cse6 (mod (+ 23 c_~i2~0) 4294967296) 1)) (<= (+ 5 (mod (+ c_~i1~0 4294967291) 4294967296)) (+ .cse4 .cse6)) (< .cse5 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 15 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 4) 4294967296) (+ (mod (+ 6 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ c_~i2~0 17) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ c_~i1~0 4294967287) 4294967296) 6 (mod (+ .cse0 3 .cse1) 4294967296)) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse7 1)) (< .cse5 (+ .cse6 (mod (+ 7 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse0 2 .cse1) 4294967296) .cse2 (mod (+ c_~i1~0 4294967288) 4294967296) 6) .cse8) (<= (+ .cse2 (mod (+ .cse0 6 .cse1) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse8) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ 19 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 10) 4294967296) (+ (mod (+ c_~i2~0 13) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 (mod (+ 5 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse0 4294967295 .cse1) 4294967296) .cse2 5 (mod (+ c_~i1~0 4294967292) 4294967296)) .cse8) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse7 (mod (+ 22 c_~i2~0) 4294967296) 1)) (< (mod .cse9 4294967296) (+ .cse7 (mod (+ c_~i2~0 4) 4294967296) 1)) (< .cse5 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse7 (mod (+ 16 c_~i2~0) 4294967296) 1)))))) is different from false [2025-04-14 12:39:44,484 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i1~0 1))) (let ((.cse2 (mod .cse10 2)) (.cse5 (* c_~N~0 2)) (.cse8 (mod (+ c_~i2~0 12) 4294967296)) (.cse9 (mod (+ 5 c_~i2~0) 4294967296)) (.cse0 (mod c_~i1~0 2))) (let ((.cse1 (+ .cse9 .cse0 1)) (.cse3 (+ .cse8 .cse0 1)) (.cse4 (* (div c_~N~0 2147483648) 4294967296)) (.cse6 (* 4294967295 c_~i2~0)) (.cse7 (+ .cse2 .cse5))) (and (< (mod (+ c_~i1~0 20) 4294967296) (+ (mod (+ 22 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 2) 4294967296) .cse1) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse2 (mod (+ 23 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 10) 4294967296) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ .cse2 (mod (+ c_~i2~0 17) 4294967296) 1)) (<= (+ .cse4 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse5 3 .cse6) 4294967296)) .cse7) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ c_~i2~0 20) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse2 (mod (+ 21 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ 16 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 4) 4294967296) .cse1) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 14 c_~i2~0) 4294967296) .cse0 1)) (<= (+ .cse4 (mod (+ .cse5 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse2 (mod (+ c_~i2~0 10) 4294967296) 1)) (<= (+ (mod (+ .cse5 .cse6 1) 4294967296) .cse4 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse7) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse2 .cse8 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse2 (mod (+ c_~i2~0 13) 4294967296) 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse2 (mod (+ 19 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse2 .cse9 1)) (< (mod .cse10 4294967296) (+ .cse2 (mod (+ 3 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 8) 4294967296) .cse3) (<= (+ .cse4 (mod (+ .cse5 5 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 5) 4294967296) (+ .cse2 (mod (+ 6 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 6) 4294967296) (+ (mod (+ 9 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse2 (mod (+ 15 c_~i2~0) 4294967296) 1)))))) is different from false Received shutdown request... [2025-04-14 12:45:49,440 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:45:49,443 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:45:49,447 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:45:50,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 12:45:50,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 12:45:50,649 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 12:45:50,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 12:45:50,667 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-14 12:45:50,669 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 12:45:50,669 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 12:45:50,669 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 12:45:50,670 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 137 [2025-04-14 12:45:50,673 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-14 12:45:50,675 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 12:45:50,675 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 12:45:50,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:45:50 BasicIcfg [2025-04-14 12:45:50,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 12:45:50,677 INFO L158 Benchmark]: Toolchain (without parser) took 880092.82ms. Allocated memory was 155.2MB in the beginning and 381.7MB in the end (delta: 226.5MB). Free memory was 109.1MB in the beginning and 275.2MB in the end (delta: -166.0MB). Peak memory consumption was 58.8MB. Max. memory is 8.0GB. [2025-04-14 12:45:50,677 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:45:50,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.83ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 94.3MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 12:45:50,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 12:45:50,678 INFO L158 Benchmark]: Boogie Preprocessor took 25.12ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 91.7MB in the end (delta: 852.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:45:50,678 INFO L158 Benchmark]: RCFGBuilder took 412.91ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 68.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 12:45:50,678 INFO L158 Benchmark]: TraceAbstraction took 879370.61ms. Allocated memory was 155.2MB in the beginning and 381.7MB in the end (delta: 226.5MB). Free memory was 67.4MB in the beginning and 275.2MB in the end (delta: -207.8MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2025-04-14 12:45:50,679 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.70ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.83ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 94.3MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.12ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 91.7MB in the end (delta: 852.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 412.91ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 68.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 879370.61ms. Allocated memory was 155.2MB in the beginning and 381.7MB in the end (delta: 226.5MB). Free memory was 67.4MB in the beginning and 275.2MB in the end (delta: -207.8MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1893, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 404, dependent conditional: 394, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1515, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 26, dependent conditional: 16, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1515, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 26, dependent conditional: 16, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 82, dependent conditional: 72, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 82, dependent conditional: 12, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 82, dependent conditional: 12, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, independent: 295, independent conditional: 0, independent unconditional: 295, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 164, dependent conditional: 42, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1571, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 64, dependent conditional: 4, dependent unconditional: 60, unknown: 314, unknown conditional: 8, unknown unconditional: 306] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1169, Maximal queried relation: 5, Independence queries for same thread: 378, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 69, Number of trivial persistent sets: 52, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 390, independent: 380, independent conditional: 0, independent unconditional: 380, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1893, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 404, dependent conditional: 394, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1515, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 26, dependent conditional: 16, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1515, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 26, dependent conditional: 16, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 1109, independent unconditional: 380, dependent: 82, dependent conditional: 72, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 82, dependent conditional: 12, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1571, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 82, dependent conditional: 12, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, independent: 295, independent conditional: 0, independent unconditional: 295, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 164, dependent conditional: 42, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1571, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 64, dependent conditional: 4, dependent unconditional: 60, unknown: 314, unknown conditional: 8, unknown unconditional: 306] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1169, Maximal queried relation: 5, Independence queries for same thread: 378 - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 47 locations, 54 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 879.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 810.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 65.1s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1172 ConstructedInterpolants, 1 QuantifiedInterpolants, 17900 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 160/3873 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown