/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 15:51:41,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 15:51:41,997 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 15:51:42,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 15:51:42,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 15:51:42,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 15:51:42,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 15:51:42,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 15:51:42,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 15:51:42,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 15:51:42,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 15:51:42,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 15:51:42,024 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 15:51:42,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 15:51:42,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:51:42,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:51:42,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:51:42,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 15:51:42,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 15:51:42,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 15:51:42,027 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 15:51:42,027 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 15:51:42,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 15:51:42,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 15:51:42,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 15:51:42,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 15:51:42,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 15:51:42,274 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 15:51:42,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2025-04-14 15:51:43,524 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72841e421/1bce7ddc57ae457dba1607aac52292ec/FLAG7a84049c6 [2025-04-14 15:51:43,757 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 15:51:43,757 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2025-04-14 15:51:43,764 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72841e421/1bce7ddc57ae457dba1607aac52292ec/FLAG7a84049c6 [2025-04-14 15:51:44,527 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72841e421/1bce7ddc57ae457dba1607aac52292ec [2025-04-14 15:51:44,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 15:51:44,530 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 15:51:44,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 15:51:44,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 15:51:44,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 15:51:44,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60438462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44, skipping insertion in model container [2025-04-14 15:51:44,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 15:51:44,710 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/mult-flipped-dist.wvr.c[2174,2187] [2025-04-14 15:51:44,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:51:44,723 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 15:51:44,752 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/mult-flipped-dist.wvr.c[2174,2187] [2025-04-14 15:51:44,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:51:44,771 INFO L204 MainTranslator]: Completed translation [2025-04-14 15:51:44,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44 WrapperNode [2025-04-14 15:51:44,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 15:51:44,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 15:51:44,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 15:51:44,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 15:51:44,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,795 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-04-14 15:51:44,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 15:51:44,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 15:51:44,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 15:51:44,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 15:51:44,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 15:51:44,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 15:51:44,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 15:51:44,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 15:51:44,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (1/1) ... [2025-04-14 15:51:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:51:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:44,839 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 15:51:44,841 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 15:51:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 15:51:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 15:51:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 15:51:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 15:51:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 15:51:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 15:51:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 15:51:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 15:51:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 15:51:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 15:51:44,858 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 15:51:44,928 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 15:51:44,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 15:51:45,041 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 15:51:45,041 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 15:51:45,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 15:51:45,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 15:51:45,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:51:45 BoogieIcfgContainer [2025-04-14 15:51:45,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 15:51:45,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 15:51:45,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 15:51:45,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 15:51:45,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:51:44" (1/3) ... [2025-04-14 15:51:45,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:51:45, skipping insertion in model container [2025-04-14 15:51:45,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:44" (2/3) ... [2025-04-14 15:51:45,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:51:45, skipping insertion in model container [2025-04-14 15:51:45,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:51:45" (3/3) ... [2025-04-14 15:51:45,126 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-04-14 15:51:45,135 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 15:51:45,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 23 locations, 22 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 15:51:45,137 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 15:51:45,187 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 15:51:45,222 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:51:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 15:51:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:45,227 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 15:51:45,228 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 15:51:45,285 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:51:45,296 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 15:51:45,302 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;@74cc87ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:51:45,302 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 15:51:45,495 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:51:45,496 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:51:45,496 INFO L139 ounterexampleChecker]: Examining path program with hash 1677640298, occurence #1 [2025-04-14 15:51:45,496 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:51:45,496 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:51:45,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:51:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2007424955, now seen corresponding path program 1 times [2025-04-14 15:51:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:51:45,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86600313] [2025-04-14 15:51:45,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:51:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:51:45,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 15:51:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 15:51:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:51:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:45,827 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 15:51:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:51:45,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86600313] [2025-04-14 15:51:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86600313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:51:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:51:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 15:51:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859472] [2025-04-14 15:51:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:51:45,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 15:51:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:51:45,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 15:51:45,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 15:51:45,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:45,848 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:51:45,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 15:51:45,849 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:45,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:45,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 15:51:45,940 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:51:45,940 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:51:45,940 INFO L139 ounterexampleChecker]: Examining path program with hash 1215642259, occurence #1 [2025-04-14 15:51:45,940 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:51:45,940 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:51:45,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:51:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1320135818, now seen corresponding path program 1 times [2025-04-14 15:51:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:51:45,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481194411] [2025-04-14 15:51:45,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:51:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:51:45,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 15:51:45,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 15:51:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:51:45,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:51:46,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481194411] [2025-04-14 15:51:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481194411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:51:46,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294794624] [2025-04-14 15:51:46,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:51:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:46,165 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 15:51:46,166 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 15:51:46,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 15:51:46,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 15:51:46,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:51:46,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:46,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 15:51:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:51:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:46,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:51:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294794624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:51:46,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:51:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-14 15:51:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845683112] [2025-04-14 15:51:46,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:51:46,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 15:51:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:51:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 15:51:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-14 15:51:46,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:46,441 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:51:46,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 15:51:46,441 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:46,441 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:46,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:46,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:46,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 15:51:47,068 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,SelfDestructingSolverStorable1 [2025-04-14 15:51:47,069 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:51:47,069 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:51:47,069 INFO L139 ounterexampleChecker]: Examining path program with hash -1973767268, occurence #1 [2025-04-14 15:51:47,069 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:51:47,069 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:51:47,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:51:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash -184905644, now seen corresponding path program 2 times [2025-04-14 15:51:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:51:47,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341365730] [2025-04-14 15:51:47,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:51:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:51:47,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 15:51:47,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 15:51:47,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:51:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:51:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:51:47,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341365730] [2025-04-14 15:51:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341365730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:51:47,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699526800] [2025-04-14 15:51:47,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:51:47,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:47,403 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 15:51:47,405 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 15:51:47,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 15:51:47,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 15:51:47,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:51:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:47,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 15:51:47,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:51:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:47,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:51:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-14 15:51:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699526800] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 15:51:49,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:51:49,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 11] total 19 [2025-04-14 15:51:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90389674] [2025-04-14 15:51:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:51:49,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 15:51:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:51:49,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 15:51:49,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-14 15:51:49,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:49,202 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:51:49,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 15:51:49,202 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:49,202 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:49,202 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:49,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:49,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:49,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:51:49,296 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 15:51:49,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:49,491 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:51:49,491 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:51:49,491 INFO L139 ounterexampleChecker]: Examining path program with hash -1973767268, occurence #2 [2025-04-14 15:51:49,491 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:51:49,491 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:51:49,499 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:49,499 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:51:49,499 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:49,499 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 15:51:49,500 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:49,500 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 15:51:49,500 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:49,500 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:51:49,500 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:51:49,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:51:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1438207033, now seen corresponding path program 3 times [2025-04-14 15:51:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:51:49,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463367879] [2025-04-14 15:51:49,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:51:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:51:49,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 15:51:49,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 15:51:49,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 15:51:49,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:51:49,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463367879] [2025-04-14 15:51:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463367879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:51:49,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587719935] [2025-04-14 15:51:49,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:51:49,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:49,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:49,804 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 15:51:49,806 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 15:51:49,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-14 15:51:49,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 15:51:49,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 15:51:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:49,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 15:51:49,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:51:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:50,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:51:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587719935] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:51:50,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:51:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-14 15:51:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576527489] [2025-04-14 15:51:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:51:50,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 15:51:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:51:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 15:51:50,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-04-14 15:51:50,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:50,211 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:51:50,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 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 15:51:50,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:50,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:50,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:51:50,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:51,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:51,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:51,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:51:51,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 15:51:51,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 15:51:51,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:51,331 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:51:51,331 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:51:51,331 INFO L139 ounterexampleChecker]: Examining path program with hash -1973767268, occurence #3 [2025-04-14 15:51:51,331 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:51:51,331 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 15:51:51,331 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:51,331 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 15:51:51,331 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:51,331 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 15:51:51,331 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:51,331 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 15:51:51,331 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:51:51,331 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:51:51,331 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:51:51,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:51:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 336896007, now seen corresponding path program 4 times [2025-04-14 15:51:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:51:51,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864201510] [2025-04-14 15:51:51,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 15:51:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:51:51,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 15:51:51,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 15:51:51,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 15:51:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:51:51,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864201510] [2025-04-14 15:51:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864201510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:51:51,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530569122] [2025-04-14 15:51:51,889 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 15:51:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:51:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:51:51,890 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 15:51:51,891 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 15:51:51,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 15:51:51,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 15:51:51,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 15:51:51,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:51:51,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-14 15:51:51,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:51:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:52,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:51:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:51:52,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530569122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:51:52,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:51:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2025-04-14 15:51:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917062685] [2025-04-14 15:51:52,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:51:52,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-14 15:51:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:51:52,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-14 15:51:52,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2152, Unknown=0, NotChecked=0, Total=2450 [2025-04-14 15:51:52,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:51:52,879 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:51:52,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.92) internal successors, (96), 50 states have internal predecessors, (96), 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 15:51:52,879 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:51:52,879 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:51:52,879 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:51:52,879 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 15:51:52,879 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:52:22,898 WARN L286 SmtUtils]: Spent 29.00s on a formula simplification. DAG size of input: 65 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:52:34,662 WARN L286 SmtUtils]: Spent 9.56s on a formula simplification. DAG size of input: 71 DAG size of output: 50 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:52:36,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:52:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:52:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:52:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 15:52:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 15:52:36,999 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 15:52:37,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:52:37,194 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 15:52:37,194 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:52:37,194 INFO L139 ounterexampleChecker]: Examining path program with hash -1666502760, occurence #1 [2025-04-14 15:52:37,194 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:52:37,194 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:52:37,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:52:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2047458274, now seen corresponding path program 5 times [2025-04-14 15:52:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:52:37,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410642633] [2025-04-14 15:52:37,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 15:52:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:52:37,203 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 14 equivalence classes. [2025-04-14 15:52:37,263 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 61 of 61 statements. [2025-04-14 15:52:37,263 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-14 15:52:37,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:52:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 1 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:52:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:52:38,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410642633] [2025-04-14 15:52:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410642633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:52:38,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667181943] [2025-04-14 15:52:38,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 15:52:38,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:52:38,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:52:38,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 15:52:38,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 15:52:38,162 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 14 equivalence classes. [2025-04-14 15:52:38,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 61 of 61 statements. [2025-04-14 15:52:38,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-14 15:52:38,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:52:38,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 15:52:38,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:52:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:52:39,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:52:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 15:52:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667181943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:52:41,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:52:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 90 [2025-04-14 15:52:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228811927] [2025-04-14 15:52:41,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:52:41,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2025-04-14 15:52:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:52:41,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2025-04-14 15:52:41,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=7214, Unknown=0, NotChecked=0, Total=8010 [2025-04-14 15:52:41,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:52:41,689 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:52:41,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 1.7666666666666666) internal successors, (159), 90 states have internal predecessors, (159), 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 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-04-14 15:52:41,690 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:52:48,912 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 120 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:52:56,212 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 120 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:11,329 WARN L286 SmtUtils]: Spent 13.20s on a formula simplification. DAG size of input: 120 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:26,494 WARN L286 SmtUtils]: Spent 13.18s on a formula simplification. DAG size of input: 120 DAG size of output: 28 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:33,704 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 120 DAG size of output: 25 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:41,127 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 120 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:53:56,619 WARN L286 SmtUtils]: Spent 13.55s on a formula simplification. DAG size of input: 120 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:11,337 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 120 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:18,464 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 120 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:25,889 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 120 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:34,755 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 120 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:54:50,210 WARN L286 SmtUtils]: Spent 13.33s on a formula simplification. DAG size of input: 120 DAG size of output: 28 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:56:05,295 WARN L286 SmtUtils]: Spent 55.22s on a formula simplification. DAG size of input: 100 DAG size of output: 86 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:56:13,755 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 15:56:18,785 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 15:56:22,788 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 15:56:26,790 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 15:56:29,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:56:34,417 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 15:56:35,469 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:56:36,847 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:57:50,052 WARN L286 SmtUtils]: Spent 45.64s on a formula simplification. DAG size of input: 106 DAG size of output: 93 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:57:52,493 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:57:56,953 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:57:58,583 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 15:58:34,508 WARN L286 SmtUtils]: Spent 24.57s on a formula simplification. DAG size of input: 63 DAG size of output: 56 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 15:59:34,772 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 92 DAG size of output: 80 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:00:11,268 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 85 DAG size of output: 74 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:00:13,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 16:04:20,188 WARN L286 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 116 DAG size of output: 99 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:04:28,567 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 120 DAG size of output: 22 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:04:39,290 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 120 DAG size of output: 25 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:04:54,506 WARN L286 SmtUtils]: Spent 13.41s on a formula simplification. DAG size of input: 120 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:05:09,382 WARN L286 SmtUtils]: Spent 13.10s on a formula simplification. DAG size of input: 120 DAG size of output: 27 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:05:16,405 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 120 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 16:05:33,900 WARN L286 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 63 DAG size of output: 44 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-14 16:06:23,577 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 16:06:23,577 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 16:06:23,577 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 16:06:24,584 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 16:06:24,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 16:06:24,778 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 16:06:24,785 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 16:06:24,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 16:06:24,786 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-14 16:06:24,789 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 16:06:24,789 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 16:06:24,789 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 16:06:24,789 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 16:06:24,792 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1] [2025-04-14 16:06:24,794 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:06:24,794 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:06:24,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:06:24 BasicIcfg [2025-04-14 16:06:24,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:06:24,797 INFO L158 Benchmark]: Toolchain (without parser) took 880267.44ms. Allocated memory was 142.6MB in the beginning and 314.6MB in the end (delta: 172.0MB). Free memory was 101.4MB in the beginning and 248.9MB in the end (delta: -147.5MB). Peak memory consumption was 184.6MB. Max. memory is 8.0GB. [2025-04-14 16:06:24,797 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:06:24,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.39ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 16:06:24,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.69ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:06:24,798 INFO L158 Benchmark]: Boogie Preprocessor took 18.47ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 770.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:06:24,798 INFO L158 Benchmark]: IcfgBuilder took 305.54ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 62.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 16:06:24,798 INFO L158 Benchmark]: TraceAbstraction took 879675.15ms. Allocated memory was 142.6MB in the beginning and 314.6MB in the end (delta: 172.0MB). Free memory was 62.9MB in the beginning and 248.9MB in the end (delta: -186.0MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2025-04-14 16:06:24,800 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.39ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.69ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.47ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 770.5kB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 305.54ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 62.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 879675.15ms. Allocated memory was 142.6MB in the beginning and 314.6MB in the end (delta: 172.0MB). Free memory was 62.9MB in the beginning and 248.9MB in the end (delta: -186.0MB). Peak memory consumption was 146.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: 6783, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 1124, dependent conditional: 1120, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 0, independent unconditional: 5659, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 0, independent unconditional: 5659, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 277, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 277, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5663, independent: 5386, independent conditional: 0, independent unconditional: 5386, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 277, unknown conditional: 0, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5388, Maximal queried relation: 0, Independence queries for same thread: 1120, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 42, Number of trivial persistent sets: 25, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6783, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 1124, dependent conditional: 1120, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 5388, independent unconditional: 271, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 0, independent unconditional: 5659, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5663, independent: 5659, independent conditional: 0, independent unconditional: 5659, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 277, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 277, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 5663, independent: 5386, independent conditional: 0, independent unconditional: 5386, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 277, unknown conditional: 0, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5388, Maximal queried relation: 0, Independence queries for same thread: 1120 - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 74]: 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: 73]: 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: 75]: 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 7 procedures, 35 locations, 40 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 879.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 868.9s, 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: 327, 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, 1.1s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 4206 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 26/1116 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]: 8, 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