./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/twostage_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 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/twostage_3.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 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 16:15:31,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 16:15:31,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 16:15:31,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 16:15:31,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 16:15:31,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 16:15:31,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 16:15:31,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 16:15:31,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 16:15:31,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 16:15:31,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 16:15:31,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 16:15:31,409 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 16:15:31,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 16:15:31,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:15:31,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:31,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:31,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 16:15:31,412 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 16:15:31,412 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 -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 [2025-04-24 16:15:31,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 16:15:31,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 16:15:31,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 16:15:31,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 16:15:31,660 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 16:15:31,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-04-24 16:15:32,981 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9f51865ae/8a75e12d8f0e49e0a7f695753db04c0e/FLAG9c0d16cf3 [2025-04-24 16:15:33,182 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 16:15:33,183 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-04-24 16:15:33,196 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9f51865ae/8a75e12d8f0e49e0a7f695753db04c0e/FLAG9c0d16cf3 [2025-04-24 16:15:34,032 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9f51865ae/8a75e12d8f0e49e0a7f695753db04c0e [2025-04-24 16:15:34,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 16:15:34,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 16:15:34,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 16:15:34,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 16:15:34,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 16:15:34,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101b580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34, skipping insertion in model container [2025-04-24 16:15:34,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 16:15:34,404 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/twostage_3.i[59093,59106] [2025-04-24 16:15:34,426 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:34,427 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:34,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:15:34,435 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 16:15:34,509 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/twostage_3.i[59093,59106] [2025-04-24 16:15:34,523 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:34,525 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:34,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:15:34,613 INFO L204 MainTranslator]: Completed translation [2025-04-24 16:15:34,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34 WrapperNode [2025-04-24 16:15:34,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 16:15:34,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 16:15:34,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 16:15:34,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 16:15:34,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,664 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-04-24 16:15:34,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 16:15:34,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 16:15:34,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 16:15:34,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 16:15:34,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 16:15:34,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 16:15:34,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 16:15:34,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 16:15:34,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (1/1) ... [2025-04-24 16:15:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:34,730 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 16:15:34,735 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 16:15:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-04-24 16:15:34,750 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-04-24 16:15:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-04-24 16:15:34,750 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 16:15:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 16:15:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 16:15:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 16:15:34,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 16:15:34,753 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 16:15:34,889 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 16:15:34,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 16:15:35,173 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 16:15:35,174 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 16:15:35,326 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 16:15:35,326 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 16:15:35,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:35 BoogieIcfgContainer [2025-04-24 16:15:35,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 16:15:35,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 16:15:35,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 16:15:35,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 16:15:35,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 04:15:34" (1/3) ... [2025-04-24 16:15:35,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d869d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:15:35, skipping insertion in model container [2025-04-24 16:15:35,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:34" (2/3) ... [2025-04-24 16:15:35,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d869d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:15:35, skipping insertion in model container [2025-04-24 16:15:35,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:35" (3/3) ... [2025-04-24 16:15:35,335 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-04-24 16:15:35,345 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 16:15:35,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-24 16:15:35,348 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 16:15:35,396 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-24 16:15:35,427 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 16:15:35,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:35,429 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 16:15:35,431 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 16:15:35,499 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:15:35,513 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 16:15:35,519 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;@77aa86b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:35,520 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 16:15:35,588 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:15:35,588 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:35,588 INFO L139 ounterexampleChecker]: Examining path program with hash 756900944, occurence #1 [2025-04-24 16:15:35,588 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:35,588 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:35,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1847419089, now seen corresponding path program 1 times [2025-04-24 16:15:35,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:35,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079908803] [2025-04-24 16:15:35,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:35,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:15:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:15:35,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:35,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:15:35,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:15:35,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:15:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:35,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 16:15:35,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:15:35,815 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 16:15:35,817 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 16:15:35,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 16:15:35,824 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 16:15:35,825 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-04-24 16:15:35,827 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 16:15:35,827 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-24 16:15:35,858 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-24 16:15:35,863 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:35,874 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:15:35,874 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-04-24 16:15:35,876 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;@77aa86b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:35,876 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:15:36,009 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:36,009 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:36,009 INFO L139 ounterexampleChecker]: Examining path program with hash -1287792658, occurence #1 [2025-04-24 16:15:36,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:36,009 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:36,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash 164239484, now seen corresponding path program 1 times [2025-04-24 16:15:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:36,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593571797] [2025-04-24 16:15:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 16:15:36,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 16:15:36,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:36,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:36,204 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 16:15:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:36,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593571797] [2025-04-24 16:15:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593571797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:15:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729531383] [2025-04-24 16:15:36,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:36,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 16:15:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:36,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 16:15:36,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 16:15:36,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:36,226 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:36,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:15:36,228 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:36,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:36,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 16:15:36,631 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:36,631 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:36,631 INFO L139 ounterexampleChecker]: Examining path program with hash -1766917204, occurence #1 [2025-04-24 16:15:36,631 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:36,631 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:36,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1735076406, now seen corresponding path program 1 times [2025-04-24 16:15:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:36,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352309728] [2025-04-24 16:15:36,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:36,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 16:15:36,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 16:15:36,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:36,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:36,991 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 16:15:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:36,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352309728] [2025-04-24 16:15:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352309728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:15:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477917869] [2025-04-24 16:15:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:36,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:36,995 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:36,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 16:15:36,995 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:36,995 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:37,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:37,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:37,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 16:15:37,624 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:37,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:37,625 INFO L139 ounterexampleChecker]: Examining path program with hash 672152608, occurence #1 [2025-04-24 16:15:37,625 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:37,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:37,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash -843293123, now seen corresponding path program 1 times [2025-04-24 16:15:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:37,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583546150] [2025-04-24 16:15:37,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:37,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:15:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:15:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:37,887 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 16:15:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:37,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583546150] [2025-04-24 16:15:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583546150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:15:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174147650] [2025-04-24 16:15:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:37,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:37,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:37,889 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:37,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:15:37,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:37,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:37,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:38,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:38,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:38,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:38,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 16:15:38,864 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:38,864 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:38,864 INFO L139 ounterexampleChecker]: Examining path program with hash 615272913, occurence #1 [2025-04-24 16:15:38,864 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:38,864 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:38,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1384462749, now seen corresponding path program 2 times [2025-04-24 16:15:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:38,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656914467] [2025-04-24 16:15:38,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:15:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:38,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:15:38,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:15:38,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:15:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 16:15:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:39,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656914467] [2025-04-24 16:15:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656914467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:39,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:15:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591731195] [2025-04-24 16:15:39,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:39,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:39,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:39,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:39,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:39,100 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:39,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:15:39,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:39,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:39,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:39,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:40,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:40,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:40,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:40,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:40,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 16:15:40,379 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:40,379 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:40,379 INFO L139 ounterexampleChecker]: Examining path program with hash 2025769717, occurence #1 [2025-04-24 16:15:40,379 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:40,379 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:40,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1699343691, now seen corresponding path program 3 times [2025-04-24 16:15:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:40,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440344561] [2025-04-24 16:15:40,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 16:15:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:40,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:15:40,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:15:40,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-24 16:15:40,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:40,575 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 16:15:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:40,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440344561] [2025-04-24 16:15:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440344561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:15:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112214536] [2025-04-24 16:15:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:40,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:40,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:40,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:40,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:40,576 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:40,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:15:40,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:40,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:40,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:40,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:40,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:45,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:45,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:45,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:45,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:45,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:15:45,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 16:15:45,465 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:45,465 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:45,465 INFO L139 ounterexampleChecker]: Examining path program with hash 303706753, occurence #1 [2025-04-24 16:15:45,465 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:45,465 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:45,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1357286204, now seen corresponding path program 2 times [2025-04-24 16:15:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:45,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088169731] [2025-04-24 16:15:45,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:15:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:45,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-04-24 16:15:45,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 16:15:45,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:15:45,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:45,605 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 16:15:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:45,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088169731] [2025-04-24 16:15:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088169731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:45,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:45,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:15:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124333853] [2025-04-24 16:15:45,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:45,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 16:15:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:45,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 16:15:45,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-24 16:15:45,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:45,606 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:45,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:15:45,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:47,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:47,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:47,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:47,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:47,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:15:47,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:47,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 16:15:47,696 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:47,696 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:47,696 INFO L139 ounterexampleChecker]: Examining path program with hash -1036603832, occurence #1 [2025-04-24 16:15:47,696 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:47,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:47,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -280526180, now seen corresponding path program 1 times [2025-04-24 16:15:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:47,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441894326] [2025-04-24 16:15:47,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:15:47,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:15:47,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:47,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:47,913 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 16:15:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:15:47,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441894326] [2025-04-24 16:15:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441894326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 16:15:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185510856] [2025-04-24 16:15:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:47,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:15:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:47,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:47,915 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:47,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:47,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:49,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:49,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 16:15:49,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 16:15:49,538 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:49,538 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:49,539 INFO L139 ounterexampleChecker]: Examining path program with hash -1634738539, occurence #1 [2025-04-24 16:15:49,539 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:49,539 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:49,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1504229498, now seen corresponding path program 2 times [2025-04-24 16:15:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:15:49,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093858536] [2025-04-24 16:15:49,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:15:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:15:49,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:15:49,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:15:49,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:15:49,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:49,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:15:49,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:15:49,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:15:49,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:49,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:49,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 16:15:49,605 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:15:49,605 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 16:15:49,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 16:15:49,607 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1] [2025-04-24 16:15:49,607 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-04-24 16:15:49,774 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-24 16:15:49,774 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 16:15:49,783 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 16:15:49,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 04:15:49 BasicIcfg [2025-04-24 16:15:49,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 16:15:49,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 16:15:49,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 16:15:49,784 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 16:15:49,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:35" (3/4) ... [2025-04-24 16:15:49,786 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-24 16:15:49,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 16:15:49,787 INFO L158 Benchmark]: Toolchain (without parser) took 15751.68ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 57.3MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2025-04-24 16:15:49,788 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:15:49,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.02ms. Allocated memory is still 83.9MB. Free memory was 57.0MB in the beginning and 50.8MB in the end (delta: 6.2MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-04-24 16:15:49,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 83.9MB. Free memory was 50.8MB in the beginning and 48.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:15:49,788 INFO L158 Benchmark]: Boogie Preprocessor took 36.93ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-24 16:15:49,788 INFO L158 Benchmark]: RCFGBuilder took 624.22ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 49.7MB in the end (delta: -3.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 16:15:49,789 INFO L158 Benchmark]: TraceAbstraction took 14455.15ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 49.3MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-04-24 16:15:49,789 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 2.9GB. Free memory is still 2.7GB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:15:49,790 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.13ms. Allocated memory is still 83.9MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.02ms. Allocated memory is still 83.9MB. Free memory was 57.0MB in the beginning and 50.8MB in the end (delta: 6.2MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 83.9MB. Free memory was 50.8MB in the beginning and 48.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.93ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 624.22ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 49.7MB in the end (delta: -3.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14455.15ms. Allocated memory was 83.9MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 49.3MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 2.9GB. Free memory is still 2.7GB. There was no memory consumed. 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: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 14, Number of trivial persistent sets: 14, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42818, dependent conditional: 42631, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5483, independent: 5235, independent conditional: 44, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5483, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 523, independent: 206, independent conditional: 55, independent unconditional: 151, dependent: 318, dependent conditional: 71, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103878, independent: 1055825, independent conditional: 776, independent unconditional: 1055049, dependent: 42570, dependent conditional: 3829, dependent unconditional: 38741, unknown: 5483, unknown conditional: 103, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5738, Positive cache size: 5487, Positive conditional cache size: 44, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093415, Maximal queried relation: 6, Independence queries for same thread: 73380, Persistent sets #1 benchmarks: Persistent set computation time: 2.0s, Number of persistent set computation: 47392, Number of trivial persistent sets: 38283, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5755, independent: 5568, independent conditional: 0, independent unconditional: 5568, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42818, dependent conditional: 42631, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103878, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42818, dependent conditional: 3888, dependent unconditional: 38930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5483, independent: 5235, independent conditional: 44, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5483, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 435, independent: 187, independent conditional: 44, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 523, independent: 206, independent conditional: 55, independent unconditional: 151, dependent: 318, dependent conditional: 71, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103878, independent: 1055825, independent conditional: 776, independent unconditional: 1055049, dependent: 42570, dependent conditional: 3829, dependent unconditional: 38741, unknown: 5483, unknown conditional: 103, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5738, Positive cache size: 5487, Positive conditional cache size: 44, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093415, Maximal queried relation: 6, Independence queries for same thread: 73380 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] EXPR, FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1310] EXPR 0 err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) [L1310] COND FALSE 0 !(0 != (err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)))) [L1309] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={6:0}, t1=1, t1=1, t2=0, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={6:0}, t1=1, t1=1, t2=0, tPool={5:0}] [L1258] 3 int t1 = -1; [L1259] 3 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1261] COND FALSE 3 !(data1Value == 0) [L1265] 3 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1268] 3 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, \result={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 80 locations, 89 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 0, 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, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread2of2ForFork0 with 1 thread instances CFG has 7 procedures, 112 locations, 127 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 12.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 1.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-24 16:15:49,807 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 16:15:51,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 16:15:51,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-24 16:15:51,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 16:15:51,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 16:15:51,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 16:15:51,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 16:15:51,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 16:15:51,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 16:15:51,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 16:15:51,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 16:15:51,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 16:15:51,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 16:15:51,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 16:15:51,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:15:51,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:51,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 16:15:51,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:15:51,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:15:51,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:15:51,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:51,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 16:15:51,755 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 16:15:51,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-24 16:15:51,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 16:15:51,757 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 16:15:51,757 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 16:15:51,757 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 -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 [2025-04-24 16:15:51,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 16:15:51,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 16:15:51,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 16:15:51,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 16:15:51,991 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 16:15:51,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-04-24 16:15:53,275 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cfeb07f60/8e77803d2cbe468bbfbb407a6263eaa5/FLAGf63de601b [2025-04-24 16:15:53,537 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 16:15:53,538 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-04-24 16:15:53,554 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cfeb07f60/8e77803d2cbe468bbfbb407a6263eaa5/FLAGf63de601b [2025-04-24 16:15:55,376 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cfeb07f60/8e77803d2cbe468bbfbb407a6263eaa5 [2025-04-24 16:15:55,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 16:15:55,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 16:15:55,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 16:15:55,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 16:15:55,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 16:15:55,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:55,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68eca286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55, skipping insertion in model container [2025-04-24 16:15:55,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:55,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 16:15:55,765 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/twostage_3.i[59093,59106] [2025-04-24 16:15:55,781 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:55,781 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:55,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:15:55,795 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 16:15:55,871 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/twostage_3.i[59093,59106] [2025-04-24 16:15:55,884 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:55,885 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-24 16:15:55,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:15:55,947 INFO L204 MainTranslator]: Completed translation [2025-04-24 16:15:55,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55 WrapperNode [2025-04-24 16:15:55,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 16:15:55,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 16:15:55,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 16:15:55,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 16:15:55,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:55,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,004 INFO L138 Inliner]: procedures = 376, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2025-04-24 16:15:56,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 16:15:56,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 16:15:56,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 16:15:56,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 16:15:56,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 16:15:56,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 16:15:56,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 16:15:56,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 16:15:56,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (1/1) ... [2025-04-24 16:15:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:15:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:56,077 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 16:15:56,079 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 16:15:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-04-24 16:15:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-04-24 16:15:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 16:15:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 16:15:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 16:15:56,097 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 16:15:56,198 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 16:15:56,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 16:15:56,459 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 16:15:56,459 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 16:15:56,646 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 16:15:56,646 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 16:15:56,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:56 BoogieIcfgContainer [2025-04-24 16:15:56,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 16:15:56,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 16:15:56,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 16:15:56,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 16:15:56,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 04:15:55" (1/3) ... [2025-04-24 16:15:56,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40528375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:15:56, skipping insertion in model container [2025-04-24 16:15:56,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:15:55" (2/3) ... [2025-04-24 16:15:56,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40528375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:15:56, skipping insertion in model container [2025-04-24 16:15:56,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:56" (3/3) ... [2025-04-24 16:15:56,653 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-04-24 16:15:56,663 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 16:15:56,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-24 16:15:56,665 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 16:15:56,713 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-24 16:15:56,746 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 16:15:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:56,749 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 16:15:56,751 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 16:15:56,827 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:15:56,840 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 16:15:56,845 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;@377e166a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:56,847 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 16:15:56,926 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:15:56,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:56,927 INFO L139 ounterexampleChecker]: Examining path program with hash -1130194664, occurence #1 [2025-04-24 16:15:56,927 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:56,927 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:56,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1174253329, now seen corresponding path program 1 times [2025-04-24 16:15:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:15:56,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705917347] [2025-04-24 16:15:56,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:56,944 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 16:15:56,946 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 16:15:57,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:15:57,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:15:57,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:57,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:57,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:15:57,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:15:57,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:15:57,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:57,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:15:57,142 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-24 16:15:57,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:15:57,144 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 16:15:57,146 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 16:15:57,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 16:15:57,347 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 [2025-04-24 16:15:57,351 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 16:15:57,352 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-04-24 16:15:57,353 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 16:15:57,353 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-24 16:15:57,390 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-24 16:15:57,396 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:57,406 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:15:57,410 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-04-24 16:15:57,410 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;@377e166a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:15:57,410 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:15:57,557 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:57,557 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:57,558 INFO L139 ounterexampleChecker]: Examining path program with hash 315489548, occurence #1 [2025-04-24 16:15:57,558 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:57,558 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:57,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 386463036, now seen corresponding path program 1 times [2025-04-24 16:15:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:15:57,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193557179] [2025-04-24 16:15:57,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:57,561 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 16:15:57,563 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 16:15:57,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-24 16:15:57,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-24 16:15:57,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:57,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:57,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-24 16:15:57,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:15:57,702 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 16:15:57,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:15:57,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:15:57,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193557179] [2025-04-24 16:15:57,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193557179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:57,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:57,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:15:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050314754] [2025-04-24 16:15:57,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:57,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 16:15:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:15:57,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 16:15:57,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 16:15:57,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:57,725 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:57,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:15:57,726 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:58,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:58,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 16:15:58,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:58,447 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:58,447 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:58,450 INFO L139 ounterexampleChecker]: Examining path program with hash 304034251, occurence #1 [2025-04-24 16:15:58,450 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:58,450 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:58,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1127717834, now seen corresponding path program 1 times [2025-04-24 16:15:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:15:58,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100197823] [2025-04-24 16:15:58,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:58,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:58,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:58,453 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 16:15:58,455 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 16:15:58,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 16:15:58,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 16:15:58,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:58,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:58,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 16:15:58,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:15:58,837 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 16:15:58,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:15:58,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:15:58,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100197823] [2025-04-24 16:15:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100197823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:15:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:15:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:15:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253437832] [2025-04-24 16:15:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:15:58,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:15:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:15:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:15:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:15:58,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:58,841 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:15:58,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 16:15:58,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:58,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:15:59,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:15:59,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:15:59,584 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 16:15:59,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:59,778 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:15:59,778 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:15:59,778 INFO L139 ounterexampleChecker]: Examining path program with hash 355857257, occurence #1 [2025-04-24 16:15:59,778 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:15:59,778 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:15:59,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:15:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1502915011, now seen corresponding path program 1 times [2025-04-24 16:15:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:15:59,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704103971] [2025-04-24 16:15:59,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:15:59,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:15:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:15:59,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:15:59,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 16:15:59,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:15:59,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:15:59,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:15:59,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:15:59,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 16:15:59,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:16:00,065 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 16:16:00,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:16:00,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:16:00,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704103971] [2025-04-24 16:16:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704103971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:16:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:16:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:16:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671697396] [2025-04-24 16:16:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:16:00,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:16:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:16:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:16:00,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:16:00,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:00,067 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:16:00,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:16:00,068 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:00,068 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:00,068 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:01,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:01,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:01,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:01,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-24 16:16:01,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:01,370 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:16:01,370 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:16:01,370 INFO L139 ounterexampleChecker]: Examining path program with hash 1269745798, occurence #1 [2025-04-24 16:16:01,370 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:16:01,370 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:16:01,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:16:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 724840861, now seen corresponding path program 2 times [2025-04-24 16:16:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:16:01,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852773982] [2025-04-24 16:16:01,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:16:01,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:16:01,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:16:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 16:16:01,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:16:01,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:16:01,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:16:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:16:01,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 16:16:01,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:16:01,642 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 16:16:01,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:16:01,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:16:01,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852773982] [2025-04-24 16:16:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852773982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:16:01,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:16:01,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:16:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311488180] [2025-04-24 16:16:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:16:01,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:16:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:16:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:16:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:16:01,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:01,643 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:16:01,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:16:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:02,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:02,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:02,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-24 16:16:03,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:03,155 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:16:03,155 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:16:03,155 INFO L139 ounterexampleChecker]: Examining path program with hash 588295762, occurence #1 [2025-04-24 16:16:03,155 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:16:03,155 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:16:03,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:16:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1936001717, now seen corresponding path program 3 times [2025-04-24 16:16:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:16:03,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503390733] [2025-04-24 16:16:03,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 16:16:03,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:16:03,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:16:03,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-24 16:16:03,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-04-24 16:16:03,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-24 16:16:03,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-24 16:16:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:16:03,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 16:16:03,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:16:03,367 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 16:16:03,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:16:03,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:16:03,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503390733] [2025-04-24 16:16:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503390733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:16:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:16:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 16:16:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565599857] [2025-04-24 16:16:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:16:03,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:16:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:16:03,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:16:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:16:03,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:03,368 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:16:03,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 16:16:03,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:03,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:03,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:03,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:03,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:08,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:08,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:08,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:08,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:08,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:16:08,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-24 16:16:08,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:08,299 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:16:08,299 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:16:08,299 INFO L139 ounterexampleChecker]: Examining path program with hash 2094391364, occurence #1 [2025-04-24 16:16:08,299 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:16:08,299 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:16:08,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:16:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1505508036, now seen corresponding path program 2 times [2025-04-24 16:16:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:16:08,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591538283] [2025-04-24 16:16:08,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:16:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:16:08,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:16:08,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-24 16:16:08,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-04-24 16:16:08,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 16:16:08,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:16:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:16:08,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-24 16:16:08,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:16:08,504 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 16:16:08,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:16:08,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:16:08,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591538283] [2025-04-24 16:16:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591538283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:16:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:16:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:16:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013095622] [2025-04-24 16:16:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:16:08,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 16:16:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:16:08,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 16:16:08,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-24 16:16:08,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:08,506 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:16:08,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:16:08,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:10,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:10,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:10,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:10,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:10,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:16:10,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:10,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-24 16:16:10,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:10,971 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:16:10,971 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:16:10,971 INFO L139 ounterexampleChecker]: Examining path program with hash -1458752548, occurence #1 [2025-04-24 16:16:10,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:16:10,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:16:10,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:16:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1204158374, now seen corresponding path program 1 times [2025-04-24 16:16:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:16:10,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829980135] [2025-04-24 16:16:10,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:16:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:16:10,974 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:16:10,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-24 16:16:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:16:11,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:16:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:16:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:16:11,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-24 16:16:11,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 16:16:11,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-24 16:16:11,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-24 16:16:11,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-24 16:16:11,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-24 16:16:11,173 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 16:16:11,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 16:16:11,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-24 16:16:11,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829980135] [2025-04-24 16:16:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829980135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:16:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:16:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 16:16:11,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008868485] [2025-04-24 16:16:11,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:16:11,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:16:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-24 16:16:11,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:16:11,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:16:11,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:11,174 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:16:11,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:11,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:16:12,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:16:12,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:16:12,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-24 16:16:13,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:13,083 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:16:13,083 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:16:13,083 INFO L139 ounterexampleChecker]: Examining path program with hash 811634588, occurence #1 [2025-04-24 16:16:13,083 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:16:13,083 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:16:13,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:16:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1867105604, now seen corresponding path program 2 times [2025-04-24 16:16:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-24 16:16:13,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974414206] [2025-04-24 16:16:13,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 16:16:13,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:16:13,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 16:16:13,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-24 16:16:13,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:16:13,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:16:13,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 16:16:13,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:16:13,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:16:13,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 16:16:13,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 16:16:13,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:16:13,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:16:13,370 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-24 16:16:13,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:16:13,371 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 16:16:13,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-24 16:16:13,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 16:16:13,573 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1] [2025-04-24 16:16:13,573 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-04-24 16:16:13,650 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-24 16:16:13,650 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 16:16:13,659 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 16:16:13,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 04:16:13 BasicIcfg [2025-04-24 16:16:13,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 16:16:13,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 16:16:13,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 16:16:13,660 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 16:16:13,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:15:56" (3/4) ... [2025-04-24 16:16:13,663 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-24 16:16:13,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 16:16:13,664 INFO L158 Benchmark]: Toolchain (without parser) took 18285.32ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2025-04-24 16:16:13,664 INFO L158 Benchmark]: CDTParser took 2.01ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:16:13,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.24ms. Allocated memory is still 117.4MB. Free memory was 87.6MB in the beginning and 44.7MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-24 16:16:13,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.74ms. Allocated memory is still 117.4MB. Free memory was 44.7MB in the beginning and 86.3MB in the end (delta: -41.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-04-24 16:16:13,665 INFO L158 Benchmark]: Boogie Preprocessor took 47.07ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:16:13,665 INFO L158 Benchmark]: RCFGBuilder took 594.74ms. Allocated memory is still 117.4MB. Free memory was 84.3MB in the beginning and 75.9MB in the end (delta: 8.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2025-04-24 16:16:13,665 INFO L158 Benchmark]: TraceAbstraction took 17011.67ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 75.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 296.3MB. Max. memory is 16.1GB. [2025-04-24 16:16:13,665 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 442.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 16:16:13,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.01ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.24ms. Allocated memory is still 117.4MB. Free memory was 87.6MB in the beginning and 44.7MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.74ms. Allocated memory is still 117.4MB. Free memory was 44.7MB in the beginning and 86.3MB in the end (delta: -41.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.07ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 594.74ms. Allocated memory is still 117.4MB. Free memory was 84.3MB in the beginning and 75.9MB in the end (delta: 8.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17011.67ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 75.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 296.3MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 442.4kB). There was no memory consumed. 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: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 14, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42876, dependent conditional: 42689, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42876, dependent conditional: 3888, dependent unconditional: 38988, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42876, dependent conditional: 3888, dependent unconditional: 38988, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5481, independent: 5233, independent conditional: 42, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5481, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 185, independent conditional: 42, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 185, independent conditional: 42, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 864, independent: 364, independent conditional: 165, independent unconditional: 199, dependent: 500, dependent conditional: 93, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103936, independent: 1055827, independent conditional: 778, independent unconditional: 1055049, dependent: 42628, dependent conditional: 3829, dependent unconditional: 38799, unknown: 5481, unknown conditional: 101, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5736, Positive cache size: 5485, Positive conditional cache size: 42, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093473, Maximal queried relation: 6, Independence queries for same thread: 73380, Persistent sets #1 benchmarks: Persistent set computation time: 2.2s, Number of persistent set computation: 47392, Number of trivial persistent sets: 38283, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5755, independent: 5568, independent conditional: 0, independent unconditional: 5568, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1142992, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 81932, dependent conditional: 81745, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069612, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 8552, dependent conditional: 8365, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 1055492, independent unconditional: 5568, dependent: 42876, dependent conditional: 42689, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42876, dependent conditional: 3888, dependent unconditional: 38988, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1103936, independent: 1061060, independent conditional: 820, independent unconditional: 1060240, dependent: 42876, dependent conditional: 3888, dependent unconditional: 38988, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5481, independent: 5233, independent conditional: 42, independent unconditional: 5191, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5481, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 185, independent conditional: 42, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 185, independent conditional: 42, independent unconditional: 143, dependent: 248, dependent conditional: 59, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 864, independent: 364, independent conditional: 165, independent unconditional: 199, dependent: 500, dependent conditional: 93, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1103936, independent: 1055827, independent conditional: 778, independent unconditional: 1055049, dependent: 42628, dependent conditional: 3829, dependent unconditional: 38799, unknown: 5481, unknown conditional: 101, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5736, Positive cache size: 5485, Positive conditional cache size: 42, Positive unconditional cache size: 5443, Negative cache size: 251, Negative conditional cache size: 59, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1093473, Maximal queried relation: 6, Independence queries for same thread: 73380 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={135:0}, tPool={7:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={135:0}, tPool={7:0}] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={135:0}, t1=1, tPool={7:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={135:0}, t1=1, tPool={7:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] EXPR, FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={135:0}, t1=1, tPool={7:0}] [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1310] EXPR 0 err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) [L1310] COND FALSE 0 !(0 != (err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)))) [L1309] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={135:0}, t1=1, t1=1, t2=0, tPool={7:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={135:0}, t1=1, t1=1, t2=0, tPool={7:0}] [L1258] 3 int t1 = -1; [L1259] 3 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 3 !(data1Value == 0) [L1265] 3 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 3 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, \result={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 80 locations, 89 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread2of2ForFork0 with 1 thread instances CFG has 7 procedures, 112 locations, 127 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 12.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: 46, 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, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1531 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1407 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-24 16:16:13,681 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 Result: UNKNOWN: Overapproximated counterexample