./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/peterson.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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-atomic/peterson.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 6ea11bc1281710e3131473f2a673d7d78c2a42824b03a7d695132107cc74f895 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 00:05:15,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 00:05:15,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 00:05:15,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 00:05:15,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 00:05:15,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 00:05:15,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 00:05:15,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 00:05:15,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 00:05:15,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 00:05:15,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 00:05:15,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 00:05:15,078 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 00:05:15,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 00:05:15,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 00:05:15,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 00:05:15,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:05:15,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:05:15,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 00:05:15,080 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 00:05:15,080 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 -> 6ea11bc1281710e3131473f2a673d7d78c2a42824b03a7d695132107cc74f895 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-04-25 00:05:15,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 00:05:15,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 00:05:15,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 00:05:15,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 00:05:15,304 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 00:05:15,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-atomic/peterson.i [2025-04-25 00:05:16,566 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3085d5ebd/4de09599e98247599b46c30c908ac3be/FLAG6d8edc06a [2025-04-25 00:05:16,847 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 00:05:16,850 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/peterson.i [2025-04-25 00:05:16,864 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3085d5ebd/4de09599e98247599b46c30c908ac3be/FLAG6d8edc06a [2025-04-25 00:05:17,568 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3085d5ebd/4de09599e98247599b46c30c908ac3be [2025-04-25 00:05:17,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 00:05:17,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 00:05:17,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 00:05:17,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 00:05:17,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 00:05:17,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:17,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b87048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17, skipping insertion in model container [2025-04-25 00:05:17,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:17,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 00:05:17,882 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-atomic/peterson.i[32348,32361] [2025-04-25 00:05:17,890 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-atomic/peterson.i[32502,32515] [2025-04-25 00:05:17,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:05:17,904 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 00:05:17,943 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-atomic/peterson.i[32348,32361] [2025-04-25 00:05:17,945 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-atomic/peterson.i[32502,32515] [2025-04-25 00:05:17,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:05:17,966 INFO L204 MainTranslator]: Completed translation [2025-04-25 00:05:17,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17 WrapperNode [2025-04-25 00:05:17,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 00:05:17,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 00:05:17,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 00:05:17,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 00:05:17,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:17,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:17,994 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-04-25 00:05:17,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 00:05:17,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 00:05:17,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 00:05:17,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 00:05:17,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 00:05:18,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 00:05:18,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 00:05:18,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 00:05:18,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (1/1) ... [2025-04-25 00:05:18,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:05:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:05:18,041 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-25 00:05:18,043 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-25 00:05:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-25 00:05:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-25 00:05:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-25 00:05:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-25 00:05:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 00:05:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 00:05:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 00:05:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 00:05:18,061 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 00:05:18,145 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 00:05:18,147 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 00:05:18,212 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 00:05:18,213 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 00:05:18,251 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 00:05:18,251 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 00:05:18,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:05:18 BoogieIcfgContainer [2025-04-25 00:05:18,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 00:05:18,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 00:05:18,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 00:05:18,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 00:05:18,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 12:05:17" (1/3) ... [2025-04-25 00:05:18,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8d8329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:05:18, skipping insertion in model container [2025-04-25 00:05:18,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:05:17" (2/3) ... [2025-04-25 00:05:18,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8d8329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:05:18, skipping insertion in model container [2025-04-25 00:05:18,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:05:18" (3/3) ... [2025-04-25 00:05:18,259 INFO L128 eAbstractionObserver]: Analyzing ICFG peterson.i [2025-04-25 00:05:18,268 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 00:05:18,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG peterson.i that has 3 procedures, 29 locations, 30 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-25 00:05:18,270 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 00:05:18,311 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 00:05:18,347 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:18,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 00:05:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:05:18,351 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-25 00:05:18,352 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-25 00:05:18,413 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:05:18,419 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork1 ======== [2025-04-25 00:05:18,426 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;@261faa0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:18,427 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 00:05:18,484 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:18,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -509677767, now seen corresponding path program 1 times [2025-04-25 00:05:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:18,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731502948] [2025-04-25 00:05:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:18,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 00:05:18,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 00:05:18,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:18,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:18,723 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-25 00:05:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:18,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731502948] [2025-04-25 00:05:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731502948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:18,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:05:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696326780] [2025-04-25 00:05:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:18,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 00:05:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:18,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 00:05:18,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 00:05:18,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:18,748 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:18,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-25 00:05:18,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:18,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 00:05:18,790 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:18,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1220552977, now seen corresponding path program 1 times [2025-04-25 00:05:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:18,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818504818] [2025-04-25 00:05:18,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 00:05:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 00:05:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:18,867 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-25 00:05:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:18,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818504818] [2025-04-25 00:05:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818504818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:05:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040099067] [2025-04-25 00:05:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:18,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 00:05:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:18,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 00:05:18,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 00:05:18,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:18,869 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:18,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-25 00:05:18,869 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,869 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:18,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 00:05:18,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:18,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 424943218, now seen corresponding path program 1 times [2025-04-25 00:05:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:18,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099508544] [2025-04-25 00:05:18,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 00:05:18,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 00:05:18,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:18,975 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-25 00:05:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:18,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099508544] [2025-04-25 00:05:18,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099508544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:18,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:18,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 00:05:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633199995] [2025-04-25 00:05:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:18,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:05:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:05:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:05:18,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:18,978 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:18,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 00:05:18,978 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,978 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:18,979 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 00:05:19,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash -961969975, now seen corresponding path program 2 times [2025-04-25 00:05:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283903904] [2025-04-25 00:05:19,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:05:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-25 00:05:19,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 00:05:19,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 00:05:19,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,133 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-25 00:05:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283903904] [2025-04-25 00:05:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283903904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 00:05:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422444430] [2025-04-25 00:05:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:05:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:05:19,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:05:19,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,138 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-25 00:05:19,139 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,139 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,139 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,139 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,222 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 00:05:19,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 00:05:19,226 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 00:05:19,231 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork1 was SAFE (1/3) [2025-04-25 00:05:19,233 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:19,234 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:05:19,234 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 00:05:19,237 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;@261faa0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:19,237 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 00:05:19,241 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 00:05:19,242 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 00:05:19,242 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-25 00:05:19,242 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-04-25 00:05:19,244 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:19,244 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:05:19,244 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr2Thread1of1ForFork0 ======== [2025-04-25 00:05:19,245 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;@261faa0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:05:19,245 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 00:05:19,249 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash -817604960, now seen corresponding path program 1 times [2025-04-25 00:05:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896793903] [2025-04-25 00:05:19,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 00:05:19,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 00:05:19,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:19,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,292 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-25 00:05:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896793903] [2025-04-25 00:05:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896793903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:05:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209656706] [2025-04-25 00:05:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 00:05:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 00:05:19,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 00:05:19,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,293 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-25 00:05:19,293 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 00:05:19,318 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 300748925, now seen corresponding path program 1 times [2025-04-25 00:05:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762174207] [2025-04-25 00:05:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-25 00:05:19,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 00:05:19,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:19,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,358 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-25 00:05:19,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762174207] [2025-04-25 00:05:19,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762174207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:05:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564029131] [2025-04-25 00:05:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 00:05:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 00:05:19,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 00:05:19,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,359 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 00:05:19,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,359 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 00:05:19,387 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2076970121, now seen corresponding path program 1 times [2025-04-25 00:05:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956698774] [2025-04-25 00:05:19,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-25 00:05:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 00:05:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,416 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-25 00:05:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956698774] [2025-04-25 00:05:19,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956698774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 00:05:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920612957] [2025-04-25 00:05:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 00:05:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 00:05:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 00:05:19,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,418 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-25 00:05:19,420 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,420 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,420 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 00:05:19,449 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1190727240, now seen corresponding path program 1 times [2025-04-25 00:05:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100385894] [2025-04-25 00:05:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-25 00:05:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 00:05:19,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:19,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,492 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-25 00:05:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100385894] [2025-04-25 00:05:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100385894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 00:05:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782557985] [2025-04-25 00:05:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:05:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:05:19,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:05:19,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,495 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 00:05:19,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 00:05:19,551 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:05:19,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:05:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash 526056809, now seen corresponding path program 1 times [2025-04-25 00:05:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:05:19,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335496423] [2025-04-25 00:05:19,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:05:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:05:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 00:05:19,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 00:05:19,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:05:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:05:19,589 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-25 00:05:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:05:19,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335496423] [2025-04-25 00:05:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335496423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:05:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:05:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 00:05:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505512096] [2025-04-25 00:05:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:05:19,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 00:05:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:05:19,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 00:05:19,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 00:05:19,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,591 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:05:19,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 00:05:19,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:05:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 00:05:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 00:05:19,632 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 00:05:19,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-25 00:05:19,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-25 00:05:19,633 INFO L320 ceAbstractionStarter]: Result for error location thr2Thread1of1ForFork0 was SAFE (3/3) [2025-04-25 00:05:19,633 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 00:05:19,633 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 00:05:19,643 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-25 00:05:19,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:05:19 BasicIcfg [2025-04-25 00:05:19,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 00:05:19,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 00:05:19,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 00:05:19,645 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 00:05:19,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:05:18" (3/4) ... [2025-04-25 00:05:19,647 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-25 00:05:19,649 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-04-25 00:05:19,649 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-04-25 00:05:19,651 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-04-25 00:05:19,651 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-25 00:05:19,651 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-25 00:05:19,651 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-25 00:05:19,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 00:05:19,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 00:05:19,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 00:05:19,701 INFO L158 Benchmark]: Toolchain (without parser) took 2130.00ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 57.2MB in the end (delta: 65.6MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-04-25 00:05:19,701 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:05:19,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 100.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-25 00:05:19,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:05:19,702 INFO L158 Benchmark]: Boogie Preprocessor took 16.23ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 820.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:05:19,702 INFO L158 Benchmark]: RCFGBuilder took 240.07ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 82.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-25 00:05:19,702 INFO L158 Benchmark]: TraceAbstraction took 1390.31ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 62.5MB in the end (delta: 19.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2025-04-25 00:05:19,702 INFO L158 Benchmark]: Witness Printer took 56.10ms. Allocated memory is still 167.8MB. Free memory was 62.5MB in the beginning and 57.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 00:05:19,703 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 100.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.23ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 820.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.07ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 82.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1390.31ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 62.5MB in the end (delta: 19.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 56.10ms. Allocated memory is still 167.8MB. Free memory was 62.5MB in the beginning and 57.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. 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: 571, independent: 423, independent conditional: 423, independent unconditional: 0, dependent: 148, dependent conditional: 148, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 469, independent: 423, independent conditional: 0, independent unconditional: 423, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 469, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 100, unknown conditional: 0, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 102 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 23, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 8 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 691, independent: 500, independent conditional: 500, independent unconditional: 0, dependent: 191, dependent conditional: 191, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 554, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 554, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 137 - PositiveResult [Line: 739]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 748]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 51 locations, 58 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, 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: 14, 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.3s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 51 locations, 58 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 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: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 51 locations, 58 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, 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: 17, 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.1s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-25 00:05:19,715 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: TRUE