./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/triangular-longer-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 18:36:22,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 18:36:22,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 18:36:22,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 18:36:22,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 18:36:22,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 18:36:22,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 18:36:22,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 18:36:22,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 18:36:22,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 18:36:22,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 18:36:22,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 18:36:22,953 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 18:36:22,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 18:36:22,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 18:36:22,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:22,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:36:22,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:22,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 18:36:22,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 18:36:22,957 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 18:36:22,957 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 18:36:22,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-04-24 18:36:23,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 18:36:23,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 18:36:23,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 18:36:23,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 18:36:23,210 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 18:36:23,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-04-24 18:36:24,469 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/458e08dd4/d7c56d24bd084e449c52846f2a933bbb/FLAGdba32599e [2025-04-24 18:36:24,711 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 18:36:24,713 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-04-24 18:36:24,722 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/458e08dd4/d7c56d24bd084e449c52846f2a933bbb/FLAGdba32599e [2025-04-24 18:36:25,670 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/458e08dd4/d7c56d24bd084e449c52846f2a933bbb [2025-04-24 18:36:25,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 18:36:25,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 18:36:25,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 18:36:25,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 18:36:25,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 18:36:25,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:36:25" (1/1) ... [2025-04-24 18:36:25,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a7ce20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:25, skipping insertion in model container [2025-04-24 18:36:25,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:36:25" (1/1) ... [2025-04-24 18:36:25,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 18:36:25,946 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2025-04-24 18:36:25,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:36:25,955 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 18:36:26,011 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2025-04-24 18:36:26,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:36:26,033 INFO L204 MainTranslator]: Completed translation [2025-04-24 18:36:26,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26 WrapperNode [2025-04-24 18:36:26,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 18:36:26,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 18:36:26,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 18:36:26,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 18:36:26,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,061 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-24 18:36:26,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 18:36:26,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 18:36:26,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 18:36:26,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 18:36:26,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 18:36:26,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 18:36:26,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 18:36:26,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 18:36:26,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (1/1) ... [2025-04-24 18:36:26,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:36:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:26,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 18:36:26,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-24 18:36:26,137 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-24 18:36:26,137 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-24 18:36:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 18:36:26,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 18:36:26,138 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 18:36:26,230 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 18:36:26,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 18:36:26,329 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 18:36:26,329 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 18:36:26,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 18:36:26,404 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 18:36:26,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:26 BoogieIcfgContainer [2025-04-24 18:36:26,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 18:36:26,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 18:36:26,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 18:36:26,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 18:36:26,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 06:36:25" (1/3) ... [2025-04-24 18:36:26,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbdf054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:36:26, skipping insertion in model container [2025-04-24 18:36:26,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:36:26" (2/3) ... [2025-04-24 18:36:26,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbdf054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:36:26, skipping insertion in model container [2025-04-24 18:36:26,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:26" (3/3) ... [2025-04-24 18:36:26,416 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-04-24 18:36:26,425 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 18:36:26,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 22 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-24 18:36:26,427 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 18:36:26,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:36:26,493 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:26,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 18:36:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:26,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 18:36:26,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 18:36:26,561 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:36:26,573 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:36:26,577 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;@589b34e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:36:26,578 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-24 18:36:26,717 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:36:26,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:26,718 INFO L139 ounterexampleChecker]: Examining path program with hash -1923752835, occurence #1 [2025-04-24 18:36:26,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:26,718 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:26,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 257124573, now seen corresponding path program 1 times [2025-04-24 18:36:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:26,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206187870] [2025-04-24 18:36:26,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-24 18:36:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-24 18:36:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:27,037 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-24 18:36:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:27,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206187870] [2025-04-24 18:36:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206187870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:36:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:36:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:36:27,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398427688] [2025-04-24 18:36:27,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:36:27,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:36:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:27,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:36:27,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:36:27,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:27,060 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:27,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-24 18:36:27,062 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:27,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:27,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 18:36:27,224 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:36:27,224 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:27,224 INFO L139 ounterexampleChecker]: Examining path program with hash -374212537, occurence #1 [2025-04-24 18:36:27,224 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:27,224 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:27,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1074544264, now seen corresponding path program 1 times [2025-04-24 18:36:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:27,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636409083] [2025-04-24 18:36:27,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:27,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:36:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:36:27,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:27,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636409083] [2025-04-24 18:36:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636409083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:36:27,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150024351] [2025-04-24 18:36:27,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:36:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:36:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:27,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:36:27,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 18:36:27,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:36:27,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:36:27,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:27,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:27,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-24 18:36:27,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:36:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:27,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:36:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150024351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:36:27,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:36:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-24 18:36:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219509090] [2025-04-24 18:36:27,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:36:27,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-24 18:36:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:27,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-24 18:36:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-24 18:36:27,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:27,703 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:27,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 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-24 18:36:27,704 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:27,704 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:27,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:27,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:36:27,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-24 18:36:28,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 18:36:28,114 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:36:28,114 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:28,114 INFO L139 ounterexampleChecker]: Examining path program with hash 1973965847, occurence #1 [2025-04-24 18:36:28,115 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:36:28,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:28,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash -662093330, now seen corresponding path program 2 times [2025-04-24 18:36:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:28,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046407454] [2025-04-24 18:36:28,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 18:36:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:28,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 18:36:28,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:36:28,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 18:36:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046407454] [2025-04-24 18:36:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046407454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:36:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13194506] [2025-04-24 18:36:28,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 18:36:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:36:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:28,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:36:28,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 18:36:28,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-24 18:36:28,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:36:28,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 18:36:28,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:28,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-24 18:36:28,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:36:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:28,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:36:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13194506] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:36:28,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:36:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-24 18:36:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659306719] [2025-04-24 18:36:28,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:36:28,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-24 18:36:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:28,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-24 18:36:28,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-04-24 18:36:28,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:28,692 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:28,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 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-24 18:36:28,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:28,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:36:28,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:36:29,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-24 18:36:29,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 18:36:29,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:36:29,280 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:36:29,280 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:29,280 INFO L139 ounterexampleChecker]: Examining path program with hash 1973965847, occurence #2 [2025-04-24 18:36:29,280 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:36:29,280 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 18:36:29,290 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:36:29,290 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:36:29,290 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:36:29,291 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 18:36:29,291 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:36:29,291 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-04-24 18:36:29,291 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:36:29,291 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:36:29,291 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:29,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash 731693018, now seen corresponding path program 3 times [2025-04-24 18:36:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:29,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319847706] [2025-04-24 18:36:29,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 18:36:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:29,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 8 equivalence classes. [2025-04-24 18:36:29,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 53 of 53 statements. [2025-04-24 18:36:29,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-24 18:36:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:29,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:36:29,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319847706] [2025-04-24 18:36:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319847706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:36:29,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509742619] [2025-04-24 18:36:29,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 18:36:29,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:36:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:36:29,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:36:29,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 18:36:29,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 8 equivalence classes. [2025-04-24 18:36:29,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 53 of 53 statements. [2025-04-24 18:36:29,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-24 18:36:29,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:36:29,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-24 18:36:29,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:36:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:29,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:36:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:36:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509742619] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:36:30,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:36:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2025-04-24 18:36:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134469157] [2025-04-24 18:36:30,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:36:30,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-24 18:36:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:36:30,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-24 18:36:30,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2025-04-24 18:36:30,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:30,303 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:36:30,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 35 states have internal predecessors, (112), 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-24 18:36:30,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:30,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:36:30,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-24 18:36:30,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:36:30,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:36:30,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:36:30,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-24 18:36:30,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-24 18:36:30,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-24 18:36:31,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:36:31,085 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:36:31,085 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:36:31,085 INFO L139 ounterexampleChecker]: Examining path program with hash 1973965847, occurence #3 [2025-04-24 18:36:31,085 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:36:31,085 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-24 18:36:31,085 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:36:31,085 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:36:31,085 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:36:31,085 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 18:36:31,085 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:36:31,085 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 69 [2025-04-24 18:36:31,086 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:36:31,086 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:36:31,086 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:36:31,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:36:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1389081515, now seen corresponding path program 4 times [2025-04-24 18:36:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:36:31,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438609897] [2025-04-24 18:36:31,086 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-24 18:36:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:36:31,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-24 18:36:31,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-24 18:36:31,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-24 18:36:31,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:36:31,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:36:31,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-24 18:36:31,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-24 18:36:31,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:36:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:36:31,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:36:31,141 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:36:31,142 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-24 18:36:31,143 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-24 18:36:31,143 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-24 18:36:31,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 18:36:31,148 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-04-24 18:36:31,223 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 18:36:31,223 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 18:36:31,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-24 18:36:31,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 06:36:31 BasicIcfg [2025-04-24 18:36:31,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 18:36:31,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 18:36:31,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 18:36:31,232 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 18:36:31,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:36:26" (3/4) ... [2025-04-24 18:36:31,233 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-24 18:36:31,305 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-04-24 18:36:31,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 18:36:31,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 18:36:31,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 18:36:31,352 INFO L158 Benchmark]: Toolchain (without parser) took 5679.23ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 105.8MB in the beginning and 198.8MB in the end (delta: -93.1MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2025-04-24 18:36:31,353 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:31,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.98ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 84.4MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 18:36:31,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.08ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:31,353 INFO L158 Benchmark]: Boogie Preprocessor took 27.03ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:31,353 INFO L158 Benchmark]: RCFGBuilder took 314.38ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 64.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 18:36:31,354 INFO L158 Benchmark]: TraceAbstraction took 4822.99ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 63.5MB in the beginning and 217.1MB in the end (delta: -153.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:36:31,354 INFO L158 Benchmark]: Witness Printer took 119.59ms. Allocated memory is still 293.6MB. Free memory was 217.1MB in the beginning and 198.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 18:36:31,355 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.93ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.98ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 84.4MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.08ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.03ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 314.38ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 64.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4822.99ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 63.5MB in the beginning and 217.1MB in the end (delta: -153.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 119.59ms. Allocated memory is still 293.6MB. Free memory was 217.1MB in the beginning and 198.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1510, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 255, dependent conditional: 249, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1265, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 31, dependent conditional: 25, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 17, independent unconditional: 1238, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 17, independent unconditional: 1238, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 218, independent conditional: 17, independent unconditional: 201, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 257, independent conditional: 209, independent unconditional: 47, dependent: 147, dependent conditional: 50, 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: 1286, independent: 1037, independent conditional: 0, independent unconditional: 1037, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 228, unknown conditional: 21, unknown unconditional: 207] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 218, Positive conditional cache size: 17, Positive unconditional cache size: 201, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1049, Maximal queried relation: 1, Independence queries for same thread: 245, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 16, Number of trivial persistent sets: 7, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1510, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 255, dependent conditional: 249, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1265, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1265, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 1045, independent unconditional: 210, dependent: 31, dependent conditional: 25, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 17, independent unconditional: 1238, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1286, independent: 1255, independent conditional: 17, independent unconditional: 1238, dependent: 31, dependent conditional: 4, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 218, independent conditional: 17, independent unconditional: 201, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 257, independent conditional: 209, independent unconditional: 47, dependent: 147, dependent conditional: 50, 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: 1286, independent: 1037, independent conditional: 0, independent unconditional: 1037, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 228, unknown conditional: 21, unknown unconditional: 207] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 218, Positive conditional cache size: 17, Positive unconditional cache size: 201, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1049, Maximal queried relation: 1, Independence queries for same thread: 245 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:50}, \at(argc, Pre)=51, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*10 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=3, id1=-2, id2=-1, j=6, k=0, k=0] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L719] 0 int condJ = j >= (2*10 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=10, k=10] [L721] COND TRUE 0 condI || condJ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=10, k=10] [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=10, k=10] - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 34 locations, 36 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.5s, 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: 58, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2026 SizeOfPredicates, 28 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/393 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]: 9, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-24 18:36:31,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE